/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/Problem05_label42+token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 17:31:31,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 17:31:31,637 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-15 17:31:31,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 17:31:31,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 17:31:31,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 17:31:31,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 17:31:31,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 17:31:31,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 17:31:31,667 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 17:31:31,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 17:31:31,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 17:31:31,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 17:31:31,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 17:31:31,670 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 17:31:31,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 17:31:31,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 17:31:31,670 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 17:31:31,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 17:31:31,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 17:31:31,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 17:31:31,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 17:31:31,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 17:31:31,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 17:31:31,677 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 17:31:31,677 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 17:31:31,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 17:31:31,677 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 17:31:31,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 17:31:31,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 17:31:31,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 17:31:31,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 17:31:31,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 17:31:31,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 17:31:31,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 17:31:31,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 17:31:31,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 17:31:31,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 17:31:31,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 17:31:31,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 17:31:31,680 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 17:31:31,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 17:31:31,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 17:31:31,680 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 17:31:31,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 17:31:31,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 17:31:31,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 17:31:31,888 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 17:31:31,888 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 17:31:31,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/Problem05_label42+token_ring.01.cil-2.c [2023-12-15 17:31:32,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 17:31:33,355 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 17:31:33,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label42+token_ring.01.cil-2.c [2023-12-15 17:31:33,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afa953827/f60b8255bc11478aa31d5e3a57863582/FLAG5c0317713 [2023-12-15 17:31:33,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afa953827/f60b8255bc11478aa31d5e3a57863582 [2023-12-15 17:31:33,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 17:31:33,424 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 17:31:33,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 17:31:33,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 17:31:33,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 17:31:33,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:31:33" (1/1) ... [2023-12-15 17:31:33,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d00873e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:31:33, skipping insertion in model container [2023-12-15 17:31:33,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:31:33" (1/1) ... [2023-12-15 17:31:33,576 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 17:31:34,905 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label42+token_ring.01.cil-2.c[378560,378573] [2023-12-15 17:31:34,927 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label42+token_ring.01.cil-2.c[383339,383352] [2023-12-15 17:31:35,023 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 17:31:35,033 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 17:31:35,616 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label42+token_ring.01.cil-2.c[378560,378573] [2023-12-15 17:31:35,622 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label42+token_ring.01.cil-2.c[383339,383352] [2023-12-15 17:31:35,643 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 17:31:35,716 INFO L206 MainTranslator]: Completed translation [2023-12-15 17:31:35,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:31:35 WrapperNode [2023-12-15 17:31:35,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 17:31:35,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 17:31:35,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 17:31:35,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 17:31:35,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:31:35" (1/1) ... [2023-12-15 17:31:35,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:31:35" (1/1) ... [2023-12-15 17:31:35,978 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12579 [2023-12-15 17:31:35,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 17:31:35,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 17:31:35,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 17:31:35,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 17:31:35,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:31:35" (1/1) ... [2023-12-15 17:31:35,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:31:35" (1/1) ... [2023-12-15 17:31:36,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:31:35" (1/1) ... [2023-12-15 17:31:36,088 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-15 17:31:36,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:31:35" (1/1) ... [2023-12-15 17:31:36,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:31:35" (1/1) ... [2023-12-15 17:31:36,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:31:35" (1/1) ... [2023-12-15 17:31:36,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:31:35" (1/1) ... [2023-12-15 17:31:36,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:31:35" (1/1) ... [2023-12-15 17:31:36,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:31:35" (1/1) ... [2023-12-15 17:31:36,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 17:31:36,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 17:31:36,415 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 17:31:36,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 17:31:36,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:31:35" (1/1) ... [2023-12-15 17:31:36,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 17:31:36,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:31:36,437 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-15 17:31:36,458 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-15 17:31:36,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 17:31:36,463 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-15 17:31:36,463 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-15 17:31:36,463 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-15 17:31:36,464 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-15 17:31:36,464 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-15 17:31:36,464 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-15 17:31:36,464 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-15 17:31:36,464 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-15 17:31:36,464 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-15 17:31:36,464 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-15 17:31:36,464 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-15 17:31:36,464 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-15 17:31:36,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 17:31:36,464 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-15 17:31:36,465 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-15 17:31:36,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 17:31:36,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 17:31:36,610 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 17:31:36,612 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 17:31:41,813 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 17:31:41,867 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 17:31:41,867 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-15 17:31:41,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:31:41 BoogieIcfgContainer [2023-12-15 17:31:41,868 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 17:31:41,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 17:31:41,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 17:31:41,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 17:31:41,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 05:31:33" (1/3) ... [2023-12-15 17:31:41,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ada6abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 05:31:41, skipping insertion in model container [2023-12-15 17:31:41,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:31:35" (2/3) ... [2023-12-15 17:31:41,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ada6abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 05:31:41, skipping insertion in model container [2023-12-15 17:31:41,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:31:41" (3/3) ... [2023-12-15 17:31:41,874 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.01.cil-2.c [2023-12-15 17:31:41,885 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 17:31:41,886 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-15 17:31:41,951 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 17:31:41,955 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;@77c566d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 17:31:41,955 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-15 17:31:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 2226 states, 2199 states have (on average 1.8872214643019554) internal successors, (4150), 2204 states have internal predecessors, (4150), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-15 17:31:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-15 17:31:41,971 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:41,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:31:41,972 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:41,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:41,976 INFO L85 PathProgramCache]: Analyzing trace with hash 767256328, now seen corresponding path program 1 times [2023-12-15 17:31:41,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:41,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261121170] [2023-12-15 17:31:41,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:41,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:42,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 17:31:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:42,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 17:31:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:42,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 17:31:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:42,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 17:31:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:42,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 17:31:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:42,216 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-15 17:31:42,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:31:42,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261121170] [2023-12-15 17:31:42,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261121170] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:31:42,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:31:42,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 17:31:42,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536619962] [2023-12-15 17:31:42,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:31:42,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 17:31:42,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:31:42,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 17:31:42,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 17:31:42,246 INFO L87 Difference]: Start difference. First operand has 2226 states, 2199 states have (on average 1.8872214643019554) internal successors, (4150), 2204 states have internal predecessors, (4150), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 17:31:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:31:42,764 INFO L93 Difference]: Finished difference Result 4576 states and 8569 transitions. [2023-12-15 17:31:42,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 17:31:42,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-15 17:31:42,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:31:42,787 INFO L225 Difference]: With dead ends: 4576 [2023-12-15 17:31:42,787 INFO L226 Difference]: Without dead ends: 2351 [2023-12-15 17:31:42,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-12-15 17:31:42,795 INFO L413 NwaCegarLoop]: 4051 mSDtfsCounter, 4257 mSDsluCounter, 12127 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4265 SdHoareTripleChecker+Valid, 16178 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 17:31:42,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4265 Valid, 16178 Invalid, 531 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [72 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 17:31:42,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2023-12-15 17:31:42,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 2310. [2023-12-15 17:31:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 2268 states have (on average 1.843915343915344) internal successors, (4182), 2272 states have internal predecessors, (4182), 27 states have call successors, (27), 13 states have call predecessors, (27), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2023-12-15 17:31:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 4237 transitions. [2023-12-15 17:31:42,881 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 4237 transitions. Word has length 52 [2023-12-15 17:31:42,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:31:42,882 INFO L495 AbstractCegarLoop]: Abstraction has 2310 states and 4237 transitions. [2023-12-15 17:31:42,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 17:31:42,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 4237 transitions. [2023-12-15 17:31:42,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-15 17:31:42,884 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:42,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:31:42,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 17:31:42,884 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:42,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:42,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1234257540, now seen corresponding path program 1 times [2023-12-15 17:31:42,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:42,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143163088] [2023-12-15 17:31:42,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:42,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:42,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 17:31:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:42,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 17:31:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:42,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 17:31:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:42,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 17:31:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:43,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 17:31:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:43,002 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-15 17:31:43,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:31:43,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143163088] [2023-12-15 17:31:43,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143163088] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:31:43,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:31:43,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 17:31:43,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463035352] [2023-12-15 17:31:43,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:31:43,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 17:31:43,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:31:43,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 17:31:43,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:31:43,005 INFO L87 Difference]: Start difference. First operand 2310 states and 4237 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 17:31:43,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:31:43,642 INFO L93 Difference]: Finished difference Result 2639 states and 4723 transitions. [2023-12-15 17:31:43,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 17:31:43,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-15 17:31:43,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:31:43,657 INFO L225 Difference]: With dead ends: 2639 [2023-12-15 17:31:43,657 INFO L226 Difference]: Without dead ends: 2457 [2023-12-15 17:31:43,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-15 17:31:43,660 INFO L413 NwaCegarLoop]: 4113 mSDtfsCounter, 4241 mSDsluCounter, 16292 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 20405 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 17:31:43,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4249 Valid, 20405 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-15 17:31:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2023-12-15 17:31:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2394. [2023-12-15 17:31:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 2335 states have (on average 1.833404710920771) internal successors, (4281), 2340 states have internal predecessors, (4281), 37 states have call successors, (37), 19 states have call predecessors, (37), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2023-12-15 17:31:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 4358 transitions. [2023-12-15 17:31:43,713 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 4358 transitions. Word has length 52 [2023-12-15 17:31:43,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:31:43,713 INFO L495 AbstractCegarLoop]: Abstraction has 2394 states and 4358 transitions. [2023-12-15 17:31:43,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 17:31:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 4358 transitions. [2023-12-15 17:31:43,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-15 17:31:43,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:43,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:31:43,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 17:31:43,720 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:43,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:43,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1657904262, now seen corresponding path program 1 times [2023-12-15 17:31:43,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:43,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504398822] [2023-12-15 17:31:43,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:43,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:43,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 17:31:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:43,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 17:31:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:43,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 17:31:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:43,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 17:31:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:43,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 17:31:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:43,835 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-15 17:31:43,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:31:43,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504398822] [2023-12-15 17:31:43,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504398822] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:31:43,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:31:43,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 17:31:43,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738136403] [2023-12-15 17:31:43,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:31:43,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 17:31:43,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:31:43,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 17:31:43,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:31:43,840 INFO L87 Difference]: Start difference. First operand 2394 states and 4358 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 17:31:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:31:44,377 INFO L93 Difference]: Finished difference Result 2964 states and 5194 transitions. [2023-12-15 17:31:44,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 17:31:44,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-15 17:31:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:31:44,387 INFO L225 Difference]: With dead ends: 2964 [2023-12-15 17:31:44,387 INFO L226 Difference]: Without dead ends: 2698 [2023-12-15 17:31:44,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-15 17:31:44,391 INFO L413 NwaCegarLoop]: 4109 mSDtfsCounter, 4288 mSDsluCounter, 16287 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4298 SdHoareTripleChecker+Valid, 20396 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 17:31:44,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4298 Valid, 20396 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 17:31:44,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2023-12-15 17:31:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2559. [2023-12-15 17:31:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 2468 states have (on average 1.8144246353322528) internal successors, (4478), 2475 states have internal predecessors, (4478), 55 states have call successors, (55), 31 states have call predecessors, (55), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2023-12-15 17:31:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 4599 transitions. [2023-12-15 17:31:44,448 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 4599 transitions. Word has length 52 [2023-12-15 17:31:44,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:31:44,448 INFO L495 AbstractCegarLoop]: Abstraction has 2559 states and 4599 transitions. [2023-12-15 17:31:44,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 17:31:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 4599 transitions. [2023-12-15 17:31:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-15 17:31:44,449 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:44,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:31:44,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 17:31:44,450 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:44,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:44,450 INFO L85 PathProgramCache]: Analyzing trace with hash 286096964, now seen corresponding path program 1 times [2023-12-15 17:31:44,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:44,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872633742] [2023-12-15 17:31:44,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:44,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:44,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 17:31:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:44,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 17:31:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:44,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 17:31:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:44,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 17:31:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:44,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 17:31:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:44,565 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-15 17:31:44,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:31:44,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872633742] [2023-12-15 17:31:44,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872633742] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:31:44,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:31:44,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 17:31:44,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723774392] [2023-12-15 17:31:44,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:31:44,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 17:31:44,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:31:44,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 17:31:44,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:31:44,569 INFO L87 Difference]: Start difference. First operand 2559 states and 4599 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 17:31:45,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:31:45,183 INFO L93 Difference]: Finished difference Result 3480 states and 5949 transitions. [2023-12-15 17:31:45,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 17:31:45,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-15 17:31:45,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:31:45,194 INFO L225 Difference]: With dead ends: 3480 [2023-12-15 17:31:45,194 INFO L226 Difference]: Without dead ends: 3049 [2023-12-15 17:31:45,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-15 17:31:45,202 INFO L413 NwaCegarLoop]: 4098 mSDtfsCounter, 4235 mSDsluCounter, 16272 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4242 SdHoareTripleChecker+Valid, 20370 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 17:31:45,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4242 Valid, 20370 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 17:31:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2023-12-15 17:31:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2840. [2023-12-15 17:31:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2691 states have (on average 1.7822370865849126) internal successors, (4796), 2702 states have internal predecessors, (4796), 87 states have call successors, (87), 53 states have call predecessors, (87), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2023-12-15 17:31:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 5003 transitions. [2023-12-15 17:31:45,275 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 5003 transitions. Word has length 52 [2023-12-15 17:31:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:31:45,276 INFO L495 AbstractCegarLoop]: Abstraction has 2840 states and 5003 transitions. [2023-12-15 17:31:45,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 17:31:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 5003 transitions. [2023-12-15 17:31:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-15 17:31:45,278 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:45,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:31:45,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 17:31:45,279 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:45,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:45,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1559270202, now seen corresponding path program 1 times [2023-12-15 17:31:45,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:45,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303205300] [2023-12-15 17:31:45,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:45,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 17:31:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:45,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 17:31:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:45,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 17:31:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:45,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 17:31:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:45,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 17:31:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:45,364 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-15 17:31:45,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:31:45,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303205300] [2023-12-15 17:31:45,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303205300] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:31:45,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:31:45,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 17:31:45,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036345876] [2023-12-15 17:31:45,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:31:45,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 17:31:45,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:31:45,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 17:31:45,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 17:31:45,366 INFO L87 Difference]: Start difference. First operand 2840 states and 5003 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 17:31:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:31:45,859 INFO L93 Difference]: Finished difference Result 4114 states and 6859 transitions. [2023-12-15 17:31:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 17:31:45,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2023-12-15 17:31:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:31:45,869 INFO L225 Difference]: With dead ends: 4114 [2023-12-15 17:31:45,869 INFO L226 Difference]: Without dead ends: 3403 [2023-12-15 17:31:45,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-15 17:31:45,872 INFO L413 NwaCegarLoop]: 4117 mSDtfsCounter, 4346 mSDsluCounter, 12122 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4369 SdHoareTripleChecker+Valid, 16239 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 17:31:45,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4369 Valid, 16239 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 17:31:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2023-12-15 17:31:46,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3212. [2023-12-15 17:31:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 2980 states have (on average 1.7426174496644296) internal successors, (5193), 3000 states have internal predecessors, (5193), 136 states have call successors, (136), 83 states have call predecessors, (136), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2023-12-15 17:31:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 5508 transitions. [2023-12-15 17:31:46,028 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 5508 transitions. Word has length 52 [2023-12-15 17:31:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:31:46,028 INFO L495 AbstractCegarLoop]: Abstraction has 3212 states and 5508 transitions. [2023-12-15 17:31:46,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 17:31:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 5508 transitions. [2023-12-15 17:31:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-15 17:31:46,030 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:46,030 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 17:31:46,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 17:31:46,030 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:46,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash 285699760, now seen corresponding path program 1 times [2023-12-15 17:31:46,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:46,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192096036] [2023-12-15 17:31:46,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:46,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 17:31:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 17:31:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 17:31:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 17:31:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 17:31:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-15 17:31:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 17:31:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,098 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-15 17:31:46,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:31:46,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192096036] [2023-12-15 17:31:46,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192096036] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:31:46,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904109373] [2023-12-15 17:31:46,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:46,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:31:46,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:31:46,102 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-15 17:31:46,113 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-15 17:31:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 17:31:46,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:31:46,211 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 17:31:46,211 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 17:31:46,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904109373] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:31:46,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 17:31:46,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-15 17:31:46,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429260773] [2023-12-15 17:31:46,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:31:46,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 17:31:46,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:31:46,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 17:31:46,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:31:46,212 INFO L87 Difference]: Start difference. First operand 3212 states and 5508 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 17:31:46,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:31:46,303 INFO L93 Difference]: Finished difference Result 5267 states and 8483 transitions. [2023-12-15 17:31:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 17:31:46,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2023-12-15 17:31:46,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:31:46,315 INFO L225 Difference]: With dead ends: 5267 [2023-12-15 17:31:46,316 INFO L226 Difference]: Without dead ends: 4185 [2023-12-15 17:31:46,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:31:46,319 INFO L413 NwaCegarLoop]: 4194 mSDtfsCounter, 107 mSDsluCounter, 4088 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 8282 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:31:46,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 8282 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:31:46,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2023-12-15 17:31:46,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 4185. [2023-12-15 17:31:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4185 states, 3744 states have (on average 1.670405982905983) internal successors, (6254), 3777 states have internal predecessors, (6254), 255 states have call successors, (255), 161 states have call predecessors, (255), 184 states have return successors, (376), 262 states have call predecessors, (376), 253 states have call successors, (376) [2023-12-15 17:31:46,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 6885 transitions. [2023-12-15 17:31:46,420 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 6885 transitions. Word has length 84 [2023-12-15 17:31:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:31:46,421 INFO L495 AbstractCegarLoop]: Abstraction has 4185 states and 6885 transitions. [2023-12-15 17:31:46,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 17:31:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 6885 transitions. [2023-12-15 17:31:46,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-15 17:31:46,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:46,426 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:31:46,434 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-15 17:31:46,630 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-15 17:31:46,631 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:46,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:46,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1204831734, now seen corresponding path program 1 times [2023-12-15 17:31:46,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:46,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360008241] [2023-12-15 17:31:46,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:46,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 17:31:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 17:31:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 17:31:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 17:31:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 17:31:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-15 17:31:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-15 17:31:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 17:31:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 17:31:46,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:31:46,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360008241] [2023-12-15 17:31:46,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360008241] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:31:46,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246374985] [2023-12-15 17:31:46,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:46,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:31:46,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:31:46,762 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-15 17:31:46,770 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-15 17:31:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:46,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 17:31:46,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:31:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 17:31:46,912 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 17:31:46,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246374985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:31:46,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 17:31:46,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-15 17:31:46,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103679985] [2023-12-15 17:31:46,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:31:46,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 17:31:46,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:31:46,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 17:31:46,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:31:46,914 INFO L87 Difference]: Start difference. First operand 4185 states and 6885 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 17:31:47,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:31:47,042 INFO L93 Difference]: Finished difference Result 8169 states and 12572 transitions. [2023-12-15 17:31:47,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 17:31:47,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 107 [2023-12-15 17:31:47,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:31:47,061 INFO L225 Difference]: With dead ends: 8169 [2023-12-15 17:31:47,061 INFO L226 Difference]: Without dead ends: 6117 [2023-12-15 17:31:47,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:31:47,067 INFO L413 NwaCegarLoop]: 4111 mSDtfsCounter, 4036 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4036 SdHoareTripleChecker+Valid, 4229 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:31:47,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4036 Valid, 4229 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:31:47,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6117 states. [2023-12-15 17:31:47,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6117 to 6085. [2023-12-15 17:31:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6085 states, 5250 states have (on average 1.5895238095238096) internal successors, (8345), 5312 states have internal predecessors, (8345), 475 states have call successors, (475), 311 states have call predecessors, (475), 358 states have return successors, (688), 477 states have call predecessors, (688), 473 states have call successors, (688) [2023-12-15 17:31:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 9508 transitions. [2023-12-15 17:31:47,215 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 9508 transitions. Word has length 107 [2023-12-15 17:31:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:31:47,215 INFO L495 AbstractCegarLoop]: Abstraction has 6085 states and 9508 transitions. [2023-12-15 17:31:47,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-15 17:31:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 9508 transitions. [2023-12-15 17:31:47,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-15 17:31:47,223 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:47,223 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 17:31:47,230 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-15 17:31:47,427 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,SelfDestructingSolverStorable6 [2023-12-15 17:31:47,428 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:47,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:47,428 INFO L85 PathProgramCache]: Analyzing trace with hash -110947751, now seen corresponding path program 1 times [2023-12-15 17:31:47,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:47,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968851603] [2023-12-15 17:31:47,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:47,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:47,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 17:31:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:47,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 17:31:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:47,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 17:31:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:47,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 17:31:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:47,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 17:31:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:47,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 17:31:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:47,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 17:31:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:47,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:47,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 17:31:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:47,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:47,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-15 17:31:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-15 17:31:47,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:31:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968851603] [2023-12-15 17:31:47,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968851603] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:31:47,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059303792] [2023-12-15 17:31:47,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:47,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:31:47,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:31:47,514 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-15 17:31:47,543 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-15 17:31:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:47,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 17:31:47,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:31:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-15 17:31:47,635 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 17:31:47,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059303792] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:31:47,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 17:31:47,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-15 17:31:47,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899415471] [2023-12-15 17:31:47,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:31:47,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 17:31:47,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:31:47,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 17:31:47,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:31:47,637 INFO L87 Difference]: Start difference. First operand 6085 states and 9508 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-15 17:31:47,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:31:47,873 INFO L93 Difference]: Finished difference Result 9149 states and 13829 transitions. [2023-12-15 17:31:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 17:31:47,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 122 [2023-12-15 17:31:47,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:31:47,904 INFO L225 Difference]: With dead ends: 9149 [2023-12-15 17:31:47,904 INFO L226 Difference]: Without dead ends: 6373 [2023-12-15 17:31:47,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:31:47,913 INFO L413 NwaCegarLoop]: 4111 mSDtfsCounter, 4052 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4052 SdHoareTripleChecker+Valid, 4235 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:31:47,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4052 Valid, 4235 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:31:47,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6373 states. [2023-12-15 17:31:48,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6373 to 6335. [2023-12-15 17:31:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6335 states, 5468 states have (on average 1.5652889539136796) internal successors, (8559), 5530 states have internal predecessors, (8559), 481 states have call successors, (481), 337 states have call predecessors, (481), 384 states have return successors, (720), 483 states have call predecessors, (720), 479 states have call successors, (720) [2023-12-15 17:31:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 9760 transitions. [2023-12-15 17:31:48,119 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 9760 transitions. Word has length 122 [2023-12-15 17:31:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:31:48,119 INFO L495 AbstractCegarLoop]: Abstraction has 6335 states and 9760 transitions. [2023-12-15 17:31:48,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-15 17:31:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 9760 transitions. [2023-12-15 17:31:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-15 17:31:48,127 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:48,127 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:31:48,134 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-15 17:31:48,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:31:48,332 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:48,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1027407506, now seen corresponding path program 1 times [2023-12-15 17:31:48,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:48,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224371937] [2023-12-15 17:31:48,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:48,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:48,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 17:31:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:48,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 17:31:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:48,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 17:31:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:48,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 17:31:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:48,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 17:31:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:48,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-15 17:31:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:48,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:48,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 17:31:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:48,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 17:31:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:48,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:48,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 17:31:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-15 17:31:48,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:31:48,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224371937] [2023-12-15 17:31:48,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224371937] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:31:48,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265803563] [2023-12-15 17:31:48,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:48,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:31:48,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:31:48,412 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-15 17:31:48,441 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-15 17:31:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:48,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 17:31:48,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:31:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-15 17:31:48,520 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 17:31:48,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265803563] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:31:48,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 17:31:48,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-15 17:31:48,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521534882] [2023-12-15 17:31:48,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:31:48,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 17:31:48,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:31:48,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 17:31:48,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:31:48,522 INFO L87 Difference]: Start difference. First operand 6335 states and 9760 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 17:31:48,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:31:48,798 INFO L93 Difference]: Finished difference Result 14423 states and 21066 transitions. [2023-12-15 17:31:48,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 17:31:48,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2023-12-15 17:31:48,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:31:48,831 INFO L225 Difference]: With dead ends: 14423 [2023-12-15 17:31:48,832 INFO L226 Difference]: Without dead ends: 10223 [2023-12-15 17:31:48,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:31:48,845 INFO L413 NwaCegarLoop]: 4193 mSDtfsCounter, 120 mSDsluCounter, 4089 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 8282 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:31:48,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 8282 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:31:48,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10223 states. [2023-12-15 17:31:49,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10223 to 10207. [2023-12-15 17:31:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10207 states, 8526 states have (on average 1.4828759089842833) internal successors, (12643), 8648 states have internal predecessors, (12643), 927 states have call successors, (927), 657 states have call predecessors, (927), 752 states have return successors, (1550), 933 states have call predecessors, (1550), 925 states have call successors, (1550) [2023-12-15 17:31:49,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10207 states to 10207 states and 15120 transitions. [2023-12-15 17:31:49,185 INFO L78 Accepts]: Start accepts. Automaton has 10207 states and 15120 transitions. Word has length 123 [2023-12-15 17:31:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:31:49,186 INFO L495 AbstractCegarLoop]: Abstraction has 10207 states and 15120 transitions. [2023-12-15 17:31:49,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 17:31:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 10207 states and 15120 transitions. [2023-12-15 17:31:49,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-15 17:31:49,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:49,203 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 17:31:49,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-15 17:31:49,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:31:49,408 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:49,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:49,409 INFO L85 PathProgramCache]: Analyzing trace with hash -297517008, now seen corresponding path program 1 times [2023-12-15 17:31:49,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:49,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864244497] [2023-12-15 17:31:49,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:49,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:49,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 17:31:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:49,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 17:31:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:49,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 17:31:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:49,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 17:31:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:49,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 17:31:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:49,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 17:31:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:49,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 17:31:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:49,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:49,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 17:31:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:49,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:49,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 17:31:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-15 17:31:49,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:31:49,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864244497] [2023-12-15 17:31:49,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864244497] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:31:49,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665422823] [2023-12-15 17:31:49,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:49,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:31:49,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:31:49,502 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-15 17:31:49,536 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-15 17:31:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:49,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 17:31:49,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:31:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 17:31:49,606 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 17:31:49,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665422823] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:31:49,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 17:31:49,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-15 17:31:49,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963110364] [2023-12-15 17:31:49,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:31:49,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 17:31:49,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:31:49,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 17:31:49,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:31:49,607 INFO L87 Difference]: Start difference. First operand 10207 states and 15120 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 17:31:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:31:49,814 INFO L93 Difference]: Finished difference Result 14381 states and 21212 transitions. [2023-12-15 17:31:49,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 17:31:49,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 124 [2023-12-15 17:31:49,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:31:49,837 INFO L225 Difference]: With dead ends: 14381 [2023-12-15 17:31:49,837 INFO L226 Difference]: Without dead ends: 10227 [2023-12-15 17:31:49,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:31:49,960 INFO L413 NwaCegarLoop]: 4160 mSDtfsCounter, 106 mSDsluCounter, 4083 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 8243 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:31:49,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 8243 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:31:49,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10227 states. [2023-12-15 17:31:50,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10227 to 10183. [2023-12-15 17:31:50,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10183 states, 8502 states have (on average 1.4687132439426018) internal successors, (12487), 8624 states have internal predecessors, (12487), 927 states have call successors, (927), 657 states have call predecessors, (927), 752 states have return successors, (1550), 933 states have call predecessors, (1550), 925 states have call successors, (1550) [2023-12-15 17:31:50,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10183 states to 10183 states and 14964 transitions. [2023-12-15 17:31:50,230 INFO L78 Accepts]: Start accepts. Automaton has 10183 states and 14964 transitions. Word has length 124 [2023-12-15 17:31:50,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:31:50,230 INFO L495 AbstractCegarLoop]: Abstraction has 10183 states and 14964 transitions. [2023-12-15 17:31:50,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 17:31:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 10183 states and 14964 transitions. [2023-12-15 17:31:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-15 17:31:50,243 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:50,243 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 17:31:50,249 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-15 17:31:50,449 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,SelfDestructingSolverStorable9 [2023-12-15 17:31:50,450 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:50,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:50,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1189629616, now seen corresponding path program 1 times [2023-12-15 17:31:50,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:50,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115033021] [2023-12-15 17:31:50,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:50,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:50,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 17:31:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:50,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 17:31:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:50,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 17:31:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:50,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 17:31:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:50,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 17:31:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:50,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 17:31:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:50,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 17:31:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:50,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:50,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 17:31:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:50,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:50,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 17:31:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-15 17:31:50,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:31:50,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115033021] [2023-12-15 17:31:50,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115033021] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:31:50,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928322537] [2023-12-15 17:31:50,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:50,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:31:50,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:31:50,536 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-15 17:31:50,563 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-15 17:31:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:50,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 17:31:50,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:31:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-15 17:31:50,637 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 17:31:50,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928322537] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:31:50,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 17:31:50,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-15 17:31:50,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756535639] [2023-12-15 17:31:50,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:31:50,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 17:31:50,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:31:50,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 17:31:50,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:31:50,640 INFO L87 Difference]: Start difference. First operand 10183 states and 14964 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 17:31:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:31:50,836 INFO L93 Difference]: Finished difference Result 16127 states and 23370 transitions. [2023-12-15 17:31:50,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 17:31:50,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 124 [2023-12-15 17:31:50,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:31:50,856 INFO L225 Difference]: With dead ends: 16127 [2023-12-15 17:31:50,857 INFO L226 Difference]: Without dead ends: 9051 [2023-12-15 17:31:50,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 17:31:50,871 INFO L413 NwaCegarLoop]: 4092 mSDtfsCounter, 4081 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4081 SdHoareTripleChecker+Valid, 4112 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:31:50,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4081 Valid, 4112 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:31:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9051 states. [2023-12-15 17:31:51,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9051 to 8643. [2023-12-15 17:31:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8643 states, 7288 states have (on average 1.4523874862788144) internal successors, (10585), 7378 states have internal predecessors, (10585), 755 states have call successors, (755), 535 states have call predecessors, (755), 598 states have return successors, (1098), 745 states have call predecessors, (1098), 753 states have call successors, (1098) [2023-12-15 17:31:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8643 states to 8643 states and 12438 transitions. [2023-12-15 17:31:51,111 INFO L78 Accepts]: Start accepts. Automaton has 8643 states and 12438 transitions. Word has length 124 [2023-12-15 17:31:51,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:31:51,111 INFO L495 AbstractCegarLoop]: Abstraction has 8643 states and 12438 transitions. [2023-12-15 17:31:51,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-15 17:31:51,112 INFO L276 IsEmpty]: Start isEmpty. Operand 8643 states and 12438 transitions. [2023-12-15 17:31:51,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 17:31:51,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:51,120 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 17:31:51,126 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-15 17:31:51,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:31:51,327 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:51,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:51,327 INFO L85 PathProgramCache]: Analyzing trace with hash 34894625, now seen corresponding path program 1 times [2023-12-15 17:31:51,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:51,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430621476] [2023-12-15 17:31:51,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:51,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:51,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 17:31:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:51,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 17:31:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:51,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 17:31:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:51,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 17:31:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:51,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 17:31:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:51,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 17:31:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:51,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 17:31:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:51,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:51,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 17:31:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:51,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:51,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 17:31:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-15 17:31:51,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:31:51,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430621476] [2023-12-15 17:31:51,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430621476] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:31:51,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531177610] [2023-12-15 17:31:51,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:51,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:31:51,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:31:51,403 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-15 17:31:51,428 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-15 17:31:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:51,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 17:31:51,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:31:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-15 17:31:51,541 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 17:31:51,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531177610] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:31:51,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 17:31:51,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-15 17:31:51,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367077784] [2023-12-15 17:31:51,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:31:51,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 17:31:51,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:31:51,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 17:31:51,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-15 17:31:51,542 INFO L87 Difference]: Start difference. First operand 8643 states and 12438 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 17:31:51,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:31:51,789 INFO L93 Difference]: Finished difference Result 11183 states and 15869 transitions. [2023-12-15 17:31:51,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 17:31:51,789 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), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2023-12-15 17:31:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:31:51,804 INFO L225 Difference]: With dead ends: 11183 [2023-12-15 17:31:51,804 INFO L226 Difference]: Without dead ends: 6959 [2023-12-15 17:31:51,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-15 17:31:51,814 INFO L413 NwaCegarLoop]: 4044 mSDtfsCounter, 4099 mSDsluCounter, 8044 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4107 SdHoareTripleChecker+Valid, 12088 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 17:31:51,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4107 Valid, 12088 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 17:31:51,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6959 states. [2023-12-15 17:31:52,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6959 to 6935. [2023-12-15 17:31:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6935 states, 5938 states have (on average 1.469013135735938) internal successors, (8723), 5992 states have internal predecessors, (8723), 567 states have call successors, (567), 397 states have call predecessors, (567), 428 states have return successors, (766), 553 states have call predecessors, (766), 565 states have call successors, (766) [2023-12-15 17:31:52,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 10056 transitions. [2023-12-15 17:31:52,110 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 10056 transitions. Word has length 125 [2023-12-15 17:31:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:31:52,110 INFO L495 AbstractCegarLoop]: Abstraction has 6935 states and 10056 transitions. [2023-12-15 17:31:52,111 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), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 17:31:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 10056 transitions. [2023-12-15 17:31:52,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 17:31:52,115 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:52,115 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 17:31:52,121 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-15 17:31:52,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:31:52,321 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:52,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:52,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1584080289, now seen corresponding path program 1 times [2023-12-15 17:31:52,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:52,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767992359] [2023-12-15 17:31:52,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:52,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:52,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 17:31:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:52,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 17:31:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:52,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 17:31:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:52,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 17:31:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:52,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 17:31:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:52,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 17:31:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:52,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 17:31:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:52,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:52,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 17:31:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:52,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:52,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 17:31:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-15 17:31:52,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:31:52,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767992359] [2023-12-15 17:31:52,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767992359] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:31:52,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86490659] [2023-12-15 17:31:52,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:52,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:31:52,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:31:52,409 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-15 17:31:52,438 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-15 17:31:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:52,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 17:31:52,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:31:52,538 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-15 17:31:52,538 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 17:31:52,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86490659] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:31:52,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 17:31:52,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-15 17:31:52,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649896283] [2023-12-15 17:31:52,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:31:52,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 17:31:52,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:31:52,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 17:31:52,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-15 17:31:52,539 INFO L87 Difference]: Start difference. First operand 6935 states and 10056 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 17:31:52,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:31:52,794 INFO L93 Difference]: Finished difference Result 10847 states and 15238 transitions. [2023-12-15 17:31:52,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 17:31:52,794 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), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2023-12-15 17:31:52,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:31:52,809 INFO L225 Difference]: With dead ends: 10847 [2023-12-15 17:31:52,809 INFO L226 Difference]: Without dead ends: 6579 [2023-12-15 17:31:52,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-15 17:31:52,819 INFO L413 NwaCegarLoop]: 4042 mSDtfsCounter, 4129 mSDsluCounter, 8040 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 12082 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 17:31:52,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4138 Valid, 12082 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 17:31:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6579 states. [2023-12-15 17:31:52,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6579 to 4985. [2023-12-15 17:31:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4985 states, 4408 states have (on average 1.5181488203266789) internal successors, (6692), 4438 states have internal predecessors, (6692), 331 states have call successors, (331), 229 states have call predecessors, (331), 244 states have return successors, (439), 321 states have call predecessors, (439), 329 states have call successors, (439) [2023-12-15 17:31:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4985 states to 4985 states and 7462 transitions. [2023-12-15 17:31:52,951 INFO L78 Accepts]: Start accepts. Automaton has 4985 states and 7462 transitions. Word has length 125 [2023-12-15 17:31:52,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:31:52,951 INFO L495 AbstractCegarLoop]: Abstraction has 4985 states and 7462 transitions. [2023-12-15 17:31:52,951 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), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 17:31:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 4985 states and 7462 transitions. [2023-12-15 17:31:52,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 17:31:52,954 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:52,954 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 17:31:52,961 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-15 17:31:53,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-15 17:31:53,161 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:53,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:53,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1827378017, now seen corresponding path program 1 times [2023-12-15 17:31:53,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:53,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132200936] [2023-12-15 17:31:53,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:53,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 17:31:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 17:31:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 17:31:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 17:31:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 17:31:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 17:31:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 17:31:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 17:31:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 17:31:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-12-15 17:31:53,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:31:53,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132200936] [2023-12-15 17:31:53,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132200936] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:31:53,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036855897] [2023-12-15 17:31:53,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:53,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:31:53,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:31:53,227 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-15 17:31:53,253 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-15 17:31:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-15 17:31:53,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:31:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-15 17:31:53,309 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 17:31:53,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036855897] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:31:53,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 17:31:53,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-15 17:31:53,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364724841] [2023-12-15 17:31:53,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:31:53,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 17:31:53,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:31:53,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 17:31:53,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 17:31:53,310 INFO L87 Difference]: Start difference. First operand 4985 states and 7462 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 17:31:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:31:53,431 INFO L93 Difference]: Finished difference Result 6831 states and 9780 transitions. [2023-12-15 17:31:53,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 17:31:53,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2023-12-15 17:31:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:31:53,438 INFO L225 Difference]: With dead ends: 6831 [2023-12-15 17:31:53,438 INFO L226 Difference]: Without dead ends: 3978 [2023-12-15 17:31:53,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 17:31:53,444 INFO L413 NwaCegarLoop]: 4084 mSDtfsCounter, 11 mSDsluCounter, 8161 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12245 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:31:53,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12245 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:31:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3978 states. [2023-12-15 17:31:53,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 3978. [2023-12-15 17:31:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3609 states have (on average 1.5777223607647548) internal successors, (5694), 3629 states have internal predecessors, (5694), 209 states have call successors, (209), 147 states have call predecessors, (209), 158 states have return successors, (252), 203 states have call predecessors, (252), 207 states have call successors, (252) [2023-12-15 17:31:53,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 6155 transitions. [2023-12-15 17:31:53,526 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 6155 transitions. Word has length 125 [2023-12-15 17:31:53,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:31:53,526 INFO L495 AbstractCegarLoop]: Abstraction has 3978 states and 6155 transitions. [2023-12-15 17:31:53,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 17:31:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 6155 transitions. [2023-12-15 17:31:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 17:31:53,529 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:53,529 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 17:31:53,546 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-15 17:31:53,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-15 17:31:53,734 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:53,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:53,735 INFO L85 PathProgramCache]: Analyzing trace with hash -634394591, now seen corresponding path program 1 times [2023-12-15 17:31:53,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:53,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840790682] [2023-12-15 17:31:53,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:53,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 17:31:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 17:31:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 17:31:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 17:31:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 17:31:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 17:31:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 17:31:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 17:31:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 17:31:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-15 17:31:53,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:31:53,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840790682] [2023-12-15 17:31:53,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840790682] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 17:31:53,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924143767] [2023-12-15 17:31:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:53,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 17:31:53,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 17:31:53,801 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-15 17:31:53,804 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-15 17:31:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:53,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-15 17:31:53,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 17:31:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-15 17:31:53,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 17:31:53,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924143767] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:31:53,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 17:31:53,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-15 17:31:53,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031055182] [2023-12-15 17:31:53,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:31:53,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 17:31:53,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:31:53,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 17:31:53,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 17:31:53,887 INFO L87 Difference]: Start difference. First operand 3978 states and 6155 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 17:31:53,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:31:53,964 INFO L93 Difference]: Finished difference Result 5069 states and 7465 transitions. [2023-12-15 17:31:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 17:31:53,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2023-12-15 17:31:53,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:31:53,969 INFO L225 Difference]: With dead ends: 5069 [2023-12-15 17:31:53,969 INFO L226 Difference]: Without dead ends: 2852 [2023-12-15 17:31:53,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 17:31:53,972 INFO L413 NwaCegarLoop]: 4083 mSDtfsCounter, 2 mSDsluCounter, 8161 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12244 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 17:31:53,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12244 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 17:31:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2023-12-15 17:31:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2023-12-15 17:31:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2704 states have (on average 1.7082100591715976) internal successors, (4619), 2713 states have internal predecessors, (4619), 85 states have call successors, (85), 58 states have call predecessors, (85), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2023-12-15 17:31:54,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4791 transitions. [2023-12-15 17:31:54,016 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4791 transitions. Word has length 125 [2023-12-15 17:31:54,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:31:54,016 INFO L495 AbstractCegarLoop]: Abstraction has 2852 states and 4791 transitions. [2023-12-15 17:31:54,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 17:31:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4791 transitions. [2023-12-15 17:31:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-15 17:31:54,018 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:54,018 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:31:54,022 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-15 17:31:54,222 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,SelfDestructingSolverStorable14 [2023-12-15 17:31:54,222 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:54,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:54,223 INFO L85 PathProgramCache]: Analyzing trace with hash 262632801, now seen corresponding path program 1 times [2023-12-15 17:31:54,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:54,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110363601] [2023-12-15 17:31:54,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:54,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 17:31:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 17:31:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 17:31:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 17:31:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 17:31:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 17:31:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 17:31:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 17:31:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 17:31:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,308 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-15 17:31:54,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:31:54,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110363601] [2023-12-15 17:31:54,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110363601] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:31:54,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:31:54,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 17:31:54,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931388434] [2023-12-15 17:31:54,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:31:54,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 17:31:54,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:31:54,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 17:31:54,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 17:31:54,310 INFO L87 Difference]: Start difference. First operand 2852 states and 4791 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-15 17:31:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:31:54,653 INFO L93 Difference]: Finished difference Result 2874 states and 4812 transitions. [2023-12-15 17:31:54,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 17:31:54,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 125 [2023-12-15 17:31:54,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:31:54,658 INFO L225 Difference]: With dead ends: 2874 [2023-12-15 17:31:54,658 INFO L226 Difference]: Without dead ends: 2871 [2023-12-15 17:31:54,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-15 17:31:54,659 INFO L413 NwaCegarLoop]: 4084 mSDtfsCounter, 4294 mSDsluCounter, 12093 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4317 SdHoareTripleChecker+Valid, 16177 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 17:31:54,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4317 Valid, 16177 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 17:31:54,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2023-12-15 17:31:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2851. [2023-12-15 17:31:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2704 states have (on average 1.7074704142011834) internal successors, (4617), 2712 states have internal predecessors, (4617), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2023-12-15 17:31:54,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 4788 transitions. [2023-12-15 17:31:54,766 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 4788 transitions. Word has length 125 [2023-12-15 17:31:54,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:31:54,767 INFO L495 AbstractCegarLoop]: Abstraction has 2851 states and 4788 transitions. [2023-12-15 17:31:54,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-15 17:31:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 4788 transitions. [2023-12-15 17:31:54,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-15 17:31:54,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:54,769 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:31:54,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 17:31:54,769 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:54,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:54,769 INFO L85 PathProgramCache]: Analyzing trace with hash -450479607, now seen corresponding path program 1 times [2023-12-15 17:31:54,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:54,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843580569] [2023-12-15 17:31:54,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:54,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 17:31:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 17:31:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-15 17:31:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 17:31:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 17:31:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 17:31:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 17:31:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 17:31:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-15 17:31:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 17:31:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 17:31:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-12-15 17:31:54,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 17:31:54,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843580569] [2023-12-15 17:31:54,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843580569] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 17:31:54,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 17:31:54,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 17:31:54,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090307240] [2023-12-15 17:31:54,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 17:31:54,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 17:31:54,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 17:31:54,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 17:31:54,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 17:31:54,816 INFO L87 Difference]: Start difference. First operand 2851 states and 4788 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 17:31:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 17:31:55,008 INFO L93 Difference]: Finished difference Result 3246 states and 5240 transitions. [2023-12-15 17:31:55,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 17:31:55,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 129 [2023-12-15 17:31:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 17:31:55,012 INFO L225 Difference]: With dead ends: 3246 [2023-12-15 17:31:55,012 INFO L226 Difference]: Without dead ends: 2881 [2023-12-15 17:31:55,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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-15 17:31:55,014 INFO L413 NwaCegarLoop]: 4045 mSDtfsCounter, 93 mSDsluCounter, 12027 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 16072 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 17:31:55,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 16072 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 17:31:55,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2023-12-15 17:31:55,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2853. [2023-12-15 17:31:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2706 states have (on average 1.7069475240206948) internal successors, (4619), 2714 states have internal predecessors, (4619), 84 states have call successors, (84), 58 states have call predecessors, (84), 61 states have return successors, (87), 81 states have call predecessors, (87), 83 states have call successors, (87) [2023-12-15 17:31:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4790 transitions. [2023-12-15 17:31:55,059 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4790 transitions. Word has length 129 [2023-12-15 17:31:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 17:31:55,059 INFO L495 AbstractCegarLoop]: Abstraction has 2853 states and 4790 transitions. [2023-12-15 17:31:55,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-15 17:31:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4790 transitions. [2023-12-15 17:31:55,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-15 17:31:55,060 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 17:31:55,061 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:31:55,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 17:31:55,061 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 17:31:55,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 17:31:55,061 INFO L85 PathProgramCache]: Analyzing trace with hash 149274242, now seen corresponding path program 1 times [2023-12-15 17:31:55,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 17:31:55,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160791573] [2023-12-15 17:31:55,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 17:31:55,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 17:31:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 17:31:55,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 17:31:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 17:31:55,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 17:31:55,102 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 17:31:55,103 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-15 17:31:55,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-15 17:31:55,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 17:31:55,106 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 17:31:55,109 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 17:31:55,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 05:31:55 BoogieIcfgContainer [2023-12-15 17:31:55,181 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 17:31:55,181 INFO L158 Benchmark]: Toolchain (without parser) took 21757.74ms. Allocated memory was 312.5MB in the beginning and 2.0GB in the end (delta: 1.7GB). Free memory was 221.7MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 332.5MB. Max. memory is 8.0GB. [2023-12-15 17:31:55,181 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 199.2MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 17:31:55,182 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2291.67ms. Allocated memory was 312.5MB in the beginning and 528.5MB in the end (delta: 216.0MB). Free memory was 221.2MB in the beginning and 425.5MB in the end (delta: -204.4MB). Peak memory consumption was 200.9MB. Max. memory is 8.0GB. [2023-12-15 17:31:55,182 INFO L158 Benchmark]: Boogie Procedure Inliner took 261.34ms. Allocated memory is still 528.5MB. Free memory was 425.5MB in the beginning and 349.0MB in the end (delta: 76.5MB). Peak memory consumption was 75.5MB. Max. memory is 8.0GB. [2023-12-15 17:31:55,182 INFO L158 Benchmark]: Boogie Preprocessor took 433.96ms. Allocated memory is still 528.5MB. Free memory was 349.0MB in the beginning and 345.3MB in the end (delta: 3.7MB). Peak memory consumption was 92.3MB. Max. memory is 8.0GB. [2023-12-15 17:31:55,182 INFO L158 Benchmark]: RCFGBuilder took 5453.93ms. Allocated memory was 528.5MB in the beginning and 1.3GB in the end (delta: 800.1MB). Free memory was 345.3MB in the beginning and 851.8MB in the end (delta: -506.5MB). Peak memory consumption was 369.1MB. Max. memory is 8.0GB. [2023-12-15 17:31:55,182 INFO L158 Benchmark]: TraceAbstraction took 13311.44ms. Allocated memory was 1.3GB in the beginning and 2.0GB in the end (delta: 650.1MB). Free memory was 851.2MB in the beginning and 1.6GB in the end (delta: -705.7MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 17:31:55,183 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 199.2MB. Free memory is still 145.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2291.67ms. Allocated memory was 312.5MB in the beginning and 528.5MB in the end (delta: 216.0MB). Free memory was 221.2MB in the beginning and 425.5MB in the end (delta: -204.4MB). Peak memory consumption was 200.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 261.34ms. Allocated memory is still 528.5MB. Free memory was 425.5MB in the beginning and 349.0MB in the end (delta: 76.5MB). Peak memory consumption was 75.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 433.96ms. Allocated memory is still 528.5MB. Free memory was 349.0MB in the beginning and 345.3MB in the end (delta: 3.7MB). Peak memory consumption was 92.3MB. Max. memory is 8.0GB. * RCFGBuilder took 5453.93ms. Allocated memory was 528.5MB in the beginning and 1.3GB in the end (delta: 800.1MB). Free memory was 345.3MB in the beginning and 851.8MB in the end (delta: -506.5MB). Peak memory consumption was 369.1MB. Max. memory is 8.0GB. * TraceAbstraction took 13311.44ms. Allocated memory was 1.3GB in the beginning and 2.0GB in the end (delta: 650.1MB). Free memory was 851.2MB in the beginning and 1.6GB in the end (delta: -705.7MB). There was no memory consumed. 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11429] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11434] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11439] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11457] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11462] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11467] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11593] COND TRUE 1 [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L11385-L11396] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE, EXPR \read(tmp_ndt_2) [L11404] EXPR t1_st = 1 [L11405] CALL, EXPR transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11405] RET, EXPR transmit1() [L11399-L11410] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE, EXPR \read(tmp_ndt_1) [L11390] EXPR m_st = 1 [L11391] CALL, EXPR master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=0] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L11391] RET, EXPR master() [L11385-L11396] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE, EXPR \read(tmp_ndt_2) [L11404] EXPR t1_st = 1 [L11405] CALL, EXPR transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11256] COND TRUE t1_pc == 1 [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11405] RET, EXPR transmit1() [L11399-L11410] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11350] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=1] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11222] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11227] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 11049]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2226 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46594 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46497 mSDsluCounter, 211879 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142148 mSDsCounter, 430 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4490 IncrementalHoareTripleChecker+Invalid, 4920 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 430 mSolverCounterUnsat, 69731 mSDtfsCounter, 4490 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1633 GetRequests, 1501 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10207occurred in iteration=9, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 2847 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3012 NumberOfCodeBlocks, 3012 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2855 ConstructedInterpolants, 0 QuantifiedInterpolants, 4370 SizeOfPredicates, 2 NumberOfNonLiveVariables, 4144 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 1310/1466 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-15 17:31:55,197 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...