/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_label46+token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-18 22:24:45,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-18 22:24:45,236 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-18 22:24:45,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-18 22:24:45,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-18 22:24:45,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-18 22:24:45,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-18 22:24:45,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-18 22:24:45,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-18 22:24:45,267 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-18 22:24:45,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-18 22:24:45,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-18 22:24:45,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-18 22:24:45,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-18 22:24:45,269 INFO L153 SettingsManager]: * Use SBE=true [2023-12-18 22:24:45,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-18 22:24:45,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-18 22:24:45,270 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-18 22:24:45,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-18 22:24:45,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-18 22:24:45,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-18 22:24:45,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-18 22:24:45,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-18 22:24:45,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-18 22:24:45,272 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-18 22:24:45,272 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-18 22:24:45,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-18 22:24:45,272 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-18 22:24:45,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-18 22:24:45,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-18 22:24:45,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-18 22:24:45,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-18 22:24:45,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 22:24:45,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-18 22:24:45,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-18 22:24:45,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-18 22:24:45,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-18 22:24:45,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-18 22:24:45,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-18 22:24:45,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-18 22:24:45,275 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-18 22:24:45,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-18 22:24:45,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-18 22:24:45,275 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-18 22:24:45,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-18 22:24:45,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-18 22:24:45,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-18 22:24:45,494 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-18 22:24:45,496 INFO L274 PluginConnector]: CDTParser initialized [2023-12-18 22:24:45,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/Problem05_label46+token_ring.01.cil-2.c [2023-12-18 22:24:46,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-18 22:24:47,029 INFO L384 CDTParser]: Found 1 translation units. [2023-12-18 22:24:47,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label46+token_ring.01.cil-2.c [2023-12-18 22:24:47,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5039cea63/67157c56e8614184923431247a2cf848/FLAG70b021782 [2023-12-18 22:24:47,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5039cea63/67157c56e8614184923431247a2cf848 [2023-12-18 22:24:47,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-18 22:24:47,095 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-18 22:24:47,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-18 22:24:47,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-18 22:24:47,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-18 22:24:47,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:24:47" (1/1) ... [2023-12-18 22:24:47,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4374ddbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:47, skipping insertion in model container [2023-12-18 22:24:47,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:24:47" (1/1) ... [2023-12-18 22:24:47,290 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-18 22:24:48,521 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_label46+token_ring.01.cil-2.c[382357,382370] [2023-12-18 22:24:48,544 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_label46+token_ring.01.cil-2.c[383339,383352] [2023-12-18 22:24:48,661 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 22:24:48,669 INFO L202 MainTranslator]: Completed pre-run [2023-12-18 22:24:49,251 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_label46+token_ring.01.cil-2.c[382357,382370] [2023-12-18 22:24:49,256 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_label46+token_ring.01.cil-2.c[383339,383352] [2023-12-18 22:24:49,274 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-18 22:24:49,314 INFO L206 MainTranslator]: Completed translation [2023-12-18 22:24:49,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:49 WrapperNode [2023-12-18 22:24:49,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-18 22:24:49,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-18 22:24:49,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-18 22:24:49,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-18 22:24:49,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:49" (1/1) ... [2023-12-18 22:24:49,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:49" (1/1) ... [2023-12-18 22:24:49,646 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12579 [2023-12-18 22:24:49,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-18 22:24:49,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-18 22:24:49,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-18 22:24:49,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-18 22:24:49,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:49" (1/1) ... [2023-12-18 22:24:49,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:49" (1/1) ... [2023-12-18 22:24:49,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:49" (1/1) ... [2023-12-18 22:24:49,854 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-18 22:24:49,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:49" (1/1) ... [2023-12-18 22:24:49,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:49" (1/1) ... [2023-12-18 22:24:49,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:49" (1/1) ... [2023-12-18 22:24:50,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:49" (1/1) ... [2023-12-18 22:24:50,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:49" (1/1) ... [2023-12-18 22:24:50,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:49" (1/1) ... [2023-12-18 22:24:50,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-18 22:24:50,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-18 22:24:50,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-18 22:24:50,178 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-18 22:24:50,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:49" (1/1) ... [2023-12-18 22:24:50,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-18 22:24:50,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:24:50,213 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-18 22:24:50,245 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-18 22:24:50,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-18 22:24:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-18 22:24:50,250 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-18 22:24:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-18 22:24:50,250 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-18 22:24:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-18 22:24:50,250 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-18 22:24:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-18 22:24:50,250 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-18 22:24:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-18 22:24:50,250 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-18 22:24:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-18 22:24:50,250 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-18 22:24:50,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-18 22:24:50,251 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-18 22:24:50,251 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-18 22:24:50,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-18 22:24:50,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-18 22:24:50,337 INFO L241 CfgBuilder]: Building ICFG [2023-12-18 22:24:50,338 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-18 22:24:55,872 INFO L282 CfgBuilder]: Performing block encoding [2023-12-18 22:24:55,938 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-18 22:24:55,939 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-18 22:24:55,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:24:55 BoogieIcfgContainer [2023-12-18 22:24:55,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-18 22:24:55,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-18 22:24:55,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-18 22:24:55,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-18 22:24:55,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:24:47" (1/3) ... [2023-12-18 22:24:55,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea4a554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:24:55, skipping insertion in model container [2023-12-18 22:24:55,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:24:49" (2/3) ... [2023-12-18 22:24:55,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea4a554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:24:55, skipping insertion in model container [2023-12-18 22:24:55,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:24:55" (3/3) ... [2023-12-18 22:24:55,944 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.01.cil-2.c [2023-12-18 22:24:55,956 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-18 22:24:55,957 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-18 22:24:56,009 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-18 22:24:56,013 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;@78a13d90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-18 22:24:56,014 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-18 22:24:56,023 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-18 22:24:56,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-18 22:24:56,030 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:24:56,031 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-18 22:24:56,031 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:24:56,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:24:56,035 INFO L85 PathProgramCache]: Analyzing trace with hash -365934265, now seen corresponding path program 1 times [2023-12-18 22:24:56,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:24:56,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502215640] [2023-12-18 22:24:56,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:24:56,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:24:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:56,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:24:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:56,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-18 22:24:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:56,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-18 22:24:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:56,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-18 22:24:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:56,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-18 22:24:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:56,299 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-18 22:24:56,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:24:56,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502215640] [2023-12-18 22:24:56,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502215640] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:24:56,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:24:56,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-18 22:24:56,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969264998] [2023-12-18 22:24:56,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:24:56,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-18 22:24:56,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:24:56,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-18 22:24:56,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:24:56,326 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-18 22:24:56,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:24:56,885 INFO L93 Difference]: Finished difference Result 4576 states and 8569 transitions. [2023-12-18 22:24:56,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-18 22:24:56,887 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-18 22:24:56,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:24:56,903 INFO L225 Difference]: With dead ends: 4576 [2023-12-18 22:24:56,903 INFO L226 Difference]: Without dead ends: 2351 [2023-12-18 22:24:56,909 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-18 22:24:56,911 INFO L413 NwaCegarLoop]: 4051 mSDtfsCounter, 4257 mSDsluCounter, 12127 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4265 SdHoareTripleChecker+Valid, 16178 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-18 22:24:56,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4265 Valid, 16178 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-18 22:24:56,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2023-12-18 22:24:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 2310. [2023-12-18 22:24:57,026 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-18 22:24:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 4237 transitions. [2023-12-18 22:24:57,036 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 4237 transitions. Word has length 52 [2023-12-18 22:24:57,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:24:57,036 INFO L495 AbstractCegarLoop]: Abstraction has 2310 states and 4237 transitions. [2023-12-18 22:24:57,037 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-18 22:24:57,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 4237 transitions. [2023-12-18 22:24:57,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-18 22:24:57,038 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:24:57,038 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-18 22:24:57,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-18 22:24:57,039 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:24:57,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:24:57,039 INFO L85 PathProgramCache]: Analyzing trace with hash 101066947, now seen corresponding path program 1 times [2023-12-18 22:24:57,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:24:57,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396811563] [2023-12-18 22:24:57,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:24:57,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:24:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:57,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:24:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:57,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-18 22:24:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:57,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-18 22:24:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:57,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-18 22:24:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:57,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-18 22:24:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:57,155 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-18 22:24:57,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:24:57,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396811563] [2023-12-18 22:24:57,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396811563] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:24:57,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:24:57,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-18 22:24:57,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42613373] [2023-12-18 22:24:57,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:24:57,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-18 22:24:57,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:24:57,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-18 22:24:57,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:24:57,159 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-18 22:24:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:24:57,853 INFO L93 Difference]: Finished difference Result 2639 states and 4723 transitions. [2023-12-18 22:24:57,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-18 22:24:57,854 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-18 22:24:57,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:24:57,882 INFO L225 Difference]: With dead ends: 2639 [2023-12-18 22:24:57,883 INFO L226 Difference]: Without dead ends: 2457 [2023-12-18 22:24:57,885 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-18 22:24:57,886 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-18 22:24:57,886 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-18 22:24:57,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2023-12-18 22:24:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2394. [2023-12-18 22:24:57,975 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-18 22:24:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 4358 transitions. [2023-12-18 22:24:57,983 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 4358 transitions. Word has length 52 [2023-12-18 22:24:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:24:57,984 INFO L495 AbstractCegarLoop]: Abstraction has 2394 states and 4358 transitions. [2023-12-18 22:24:57,984 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-18 22:24:57,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 4358 transitions. [2023-12-18 22:24:57,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-18 22:24:57,985 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:24:57,986 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-18 22:24:57,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-18 22:24:57,986 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:24:57,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:24:57,986 INFO L85 PathProgramCache]: Analyzing trace with hash 524713669, now seen corresponding path program 1 times [2023-12-18 22:24:57,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:24:57,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96087012] [2023-12-18 22:24:57,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:24:57,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:24:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:58,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:24:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:58,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-18 22:24:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:58,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-18 22:24:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:58,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-18 22:24:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:58,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-18 22:24:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:58,075 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-18 22:24:58,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:24:58,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96087012] [2023-12-18 22:24:58,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96087012] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:24:58,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:24:58,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-18 22:24:58,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761441723] [2023-12-18 22:24:58,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:24:58,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-18 22:24:58,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:24:58,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-18 22:24:58,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:24:58,077 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-18 22:24:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:24:58,833 INFO L93 Difference]: Finished difference Result 2964 states and 5194 transitions. [2023-12-18 22:24:58,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-18 22:24:58,833 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-18 22:24:58,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:24:58,842 INFO L225 Difference]: With dead ends: 2964 [2023-12-18 22:24:58,842 INFO L226 Difference]: Without dead ends: 2698 [2023-12-18 22:24:58,844 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-18 22:24:58,845 INFO L413 NwaCegarLoop]: 4109 mSDtfsCounter, 4288 mSDsluCounter, 16287 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2023-12-18 22:24:58,845 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.5s Time] [2023-12-18 22:24:58,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2023-12-18 22:24:58,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2559. [2023-12-18 22:24:58,887 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-18 22:24:58,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 4599 transitions. [2023-12-18 22:24:58,895 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 4599 transitions. Word has length 52 [2023-12-18 22:24:58,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:24:58,895 INFO L495 AbstractCegarLoop]: Abstraction has 2559 states and 4599 transitions. [2023-12-18 22:24:58,895 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-18 22:24:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 4599 transitions. [2023-12-18 22:24:58,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-18 22:24:58,897 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:24:58,897 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-18 22:24:58,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-18 22:24:58,897 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:24:58,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:24:58,897 INFO L85 PathProgramCache]: Analyzing trace with hash -847093629, now seen corresponding path program 1 times [2023-12-18 22:24:58,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:24:58,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879695908] [2023-12-18 22:24:58,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:24:58,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:24:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:58,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:24:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:58,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-18 22:24:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:58,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-18 22:24:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:58,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-18 22:24:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:58,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-18 22:24:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:58,969 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-18 22:24:58,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:24:58,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879695908] [2023-12-18 22:24:58,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879695908] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:24:58,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:24:58,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-18 22:24:58,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982247721] [2023-12-18 22:24:58,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:24:58,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-18 22:24:58,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:24:58,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-18 22:24:58,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:24:58,971 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-18 22:24:59,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:24:59,737 INFO L93 Difference]: Finished difference Result 3480 states and 5949 transitions. [2023-12-18 22:24:59,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-18 22:24:59,738 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-18 22:24:59,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:24:59,747 INFO L225 Difference]: With dead ends: 3480 [2023-12-18 22:24:59,747 INFO L226 Difference]: Without dead ends: 3049 [2023-12-18 22:24:59,749 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-18 22:24:59,749 INFO L413 NwaCegarLoop]: 4098 mSDtfsCounter, 4235 mSDsluCounter, 16272 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-18 22:24:59,750 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-18 22:24:59,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2023-12-18 22:24:59,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2840. [2023-12-18 22:24:59,813 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-18 22:24:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 5003 transitions. [2023-12-18 22:24:59,823 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 5003 transitions. Word has length 52 [2023-12-18 22:24:59,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:24:59,823 INFO L495 AbstractCegarLoop]: Abstraction has 2840 states and 5003 transitions. [2023-12-18 22:24:59,824 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-18 22:24:59,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 5003 transitions. [2023-12-18 22:24:59,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-18 22:24:59,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:24:59,825 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-18 22:24:59,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-18 22:24:59,825 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:24:59,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:24:59,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1602506501, now seen corresponding path program 1 times [2023-12-18 22:24:59,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:24:59,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744567540] [2023-12-18 22:24:59,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:24:59,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:24:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:59,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:24:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:59,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-18 22:24:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:59,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-18 22:24:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:59,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-18 22:24:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:59,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-18 22:24:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:24:59,881 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-18 22:24:59,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:24:59,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744567540] [2023-12-18 22:24:59,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744567540] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:24:59,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:24:59,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-18 22:24:59,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697779392] [2023-12-18 22:24:59,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:24:59,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-18 22:24:59,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:24:59,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-18 22:24:59,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:24:59,883 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-18 22:25:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:00,383 INFO L93 Difference]: Finished difference Result 4114 states and 6859 transitions. [2023-12-18 22:25:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-18 22:25:00,383 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-18 22:25:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:00,394 INFO L225 Difference]: With dead ends: 4114 [2023-12-18 22:25:00,394 INFO L226 Difference]: Without dead ends: 3403 [2023-12-18 22:25:00,397 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-18 22:25:00,398 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-18 22:25:00,398 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-18 22:25:00,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2023-12-18 22:25:00,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3212. [2023-12-18 22:25:00,481 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-18 22:25:00,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 5508 transitions. [2023-12-18 22:25:00,490 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 5508 transitions. Word has length 52 [2023-12-18 22:25:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:00,491 INFO L495 AbstractCegarLoop]: Abstraction has 3212 states and 5508 transitions. [2023-12-18 22:25:00,491 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-18 22:25:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 5508 transitions. [2023-12-18 22:25:00,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-18 22:25:00,493 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:00,493 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-18 22:25:00,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-18 22:25:00,494 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:00,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:00,494 INFO L85 PathProgramCache]: Analyzing trace with hash -179544944, now seen corresponding path program 1 times [2023-12-18 22:25:00,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:00,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023533457] [2023-12-18 22:25:00,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:00,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:00,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:00,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-18 22:25:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:00,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-18 22:25:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:00,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-18 22:25:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:00,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-18 22:25:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:00,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-18 22:25:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:00,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:00,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-18 22:25:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:00,637 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-18 22:25:00,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:00,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023533457] [2023-12-18 22:25:00,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023533457] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:00,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255932128] [2023-12-18 22:25:00,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:00,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:00,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:00,660 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-18 22:25:00,685 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-18 22:25:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:00,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:25:00,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:00,786 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-18 22:25:00,787 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:00,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255932128] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:00,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:00,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:25:00,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265482086] [2023-12-18 22:25:00,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:00,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:00,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:00,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:00,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:00,788 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-18 22:25:00,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:00,915 INFO L93 Difference]: Finished difference Result 5267 states and 8483 transitions. [2023-12-18 22:25:00,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:00,916 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-18 22:25:00,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:00,929 INFO L225 Difference]: With dead ends: 5267 [2023-12-18 22:25:00,930 INFO L226 Difference]: Without dead ends: 4185 [2023-12-18 22:25:00,934 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-18 22:25:00,935 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-18 22:25:00,935 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-18 22:25:00,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2023-12-18 22:25:01,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 4185. [2023-12-18 22:25:01,172 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-18 22:25:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 6885 transitions. [2023-12-18 22:25:01,197 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 6885 transitions. Word has length 84 [2023-12-18 22:25:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:01,199 INFO L495 AbstractCegarLoop]: Abstraction has 4185 states and 6885 transitions. [2023-12-18 22:25:01,199 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-18 22:25:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 6885 transitions. [2023-12-18 22:25:01,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-18 22:25:01,206 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:01,206 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-18 22:25:01,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-18 22:25:01,406 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-18 22:25:01,407 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:01,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:01,407 INFO L85 PathProgramCache]: Analyzing trace with hash 20714924, now seen corresponding path program 1 times [2023-12-18 22:25:01,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:01,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188739216] [2023-12-18 22:25:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:01,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:01,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:01,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-18 22:25:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:01,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-18 22:25:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:01,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-18 22:25:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:01,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-18 22:25:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:01,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-18 22:25:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:01,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:01,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-18 22:25:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:01,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:01,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-18 22:25:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:01,608 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-18 22:25:01,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:01,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188739216] [2023-12-18 22:25:01,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188739216] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:01,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769498811] [2023-12-18 22:25:01,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:01,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:01,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:01,609 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-18 22:25:01,612 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-18 22:25:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:01,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:25:01,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:01,780 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-18 22:25:01,780 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:01,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769498811] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:01,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:01,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-18 22:25:01,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029143032] [2023-12-18 22:25:01,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:01,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:01,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:01,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:01,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:01,783 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-18 22:25:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:01,928 INFO L93 Difference]: Finished difference Result 8169 states and 12572 transitions. [2023-12-18 22:25:01,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:01,929 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-18 22:25:01,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:01,960 INFO L225 Difference]: With dead ends: 8169 [2023-12-18 22:25:01,960 INFO L226 Difference]: Without dead ends: 6117 [2023-12-18 22:25:01,967 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-18 22:25:01,967 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-18 22:25:01,968 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-18 22:25:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6117 states. [2023-12-18 22:25:02,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6117 to 6085. [2023-12-18 22:25:02,119 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-18 22:25:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 9508 transitions. [2023-12-18 22:25:02,133 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 9508 transitions. Word has length 107 [2023-12-18 22:25:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:02,134 INFO L495 AbstractCegarLoop]: Abstraction has 6085 states and 9508 transitions. [2023-12-18 22:25:02,134 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-18 22:25:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 9508 transitions. [2023-12-18 22:25:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-18 22:25:02,145 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:02,146 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-18 22:25:02,154 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-18 22:25:02,352 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-18 22:25:02,352 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:02,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:02,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1514455832, now seen corresponding path program 1 times [2023-12-18 22:25:02,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:02,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386403734] [2023-12-18 22:25:02,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:02,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:02,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:02,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-18 22:25:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:02,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-18 22:25:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:02,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-18 22:25:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:02,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-18 22:25:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:02,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-18 22:25:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:02,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-18 22:25:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:02,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:02,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-18 22:25:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:02,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:02,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-18 22:25:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:02,429 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-18 22:25:02,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:02,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386403734] [2023-12-18 22:25:02,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386403734] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:02,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720066760] [2023-12-18 22:25:02,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:02,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:02,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:02,430 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-18 22:25:02,492 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-18 22:25:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:02,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-18 22:25:02,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:02,585 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-18 22:25:02,585 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:02,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720066760] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:02,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:02,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:25:02,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786549017] [2023-12-18 22:25:02,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:02,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:02,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:02,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:02,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:02,586 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-18 22:25:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:02,788 INFO L93 Difference]: Finished difference Result 9149 states and 13829 transitions. [2023-12-18 22:25:02,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:02,788 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-18 22:25:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:02,801 INFO L225 Difference]: With dead ends: 9149 [2023-12-18 22:25:02,802 INFO L226 Difference]: Without dead ends: 6373 [2023-12-18 22:25:02,807 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-18 22:25:02,807 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-18 22:25:02,808 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-18 22:25:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6373 states. [2023-12-18 22:25:02,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6373 to 6335. [2023-12-18 22:25:02,959 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-18 22:25:02,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 9760 transitions. [2023-12-18 22:25:02,972 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 9760 transitions. Word has length 122 [2023-12-18 22:25:02,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:02,972 INFO L495 AbstractCegarLoop]: Abstraction has 6335 states and 9760 transitions. [2023-12-18 22:25:02,972 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-18 22:25:02,972 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 9760 transitions. [2023-12-18 22:25:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-18 22:25:02,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:02,980 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-18 22:25:02,988 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-18 22:25:03,189 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-18 22:25:03,189 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:03,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:03,190 INFO L85 PathProgramCache]: Analyzing trace with hash -444169551, now seen corresponding path program 1 times [2023-12-18 22:25:03,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:03,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593814062] [2023-12-18 22:25:03,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:03,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:03,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:03,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-18 22:25:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:03,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-18 22:25:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:03,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-18 22:25:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:03,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-18 22:25:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:03,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-18 22:25:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:03,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:03,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-18 22:25:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:03,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-18 22:25:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:03,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:03,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-18 22:25:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:03,264 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-18 22:25:03,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:03,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593814062] [2023-12-18 22:25:03,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593814062] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:03,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128807185] [2023-12-18 22:25:03,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:03,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:03,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:03,266 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-18 22:25:03,292 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-18 22:25:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:03,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:25:03,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:03,372 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-18 22:25:03,372 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:03,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128807185] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:03,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:03,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:25:03,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716260987] [2023-12-18 22:25:03,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:03,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:03,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:03,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:03,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:03,373 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-18 22:25:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:03,602 INFO L93 Difference]: Finished difference Result 14423 states and 21066 transitions. [2023-12-18 22:25:03,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:03,602 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-18 22:25:03,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:03,713 INFO L225 Difference]: With dead ends: 14423 [2023-12-18 22:25:03,713 INFO L226 Difference]: Without dead ends: 10223 [2023-12-18 22:25:03,720 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-18 22:25:03,721 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-18 22:25:03,721 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-18 22:25:03,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10223 states. [2023-12-18 22:25:03,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10223 to 10207. [2023-12-18 22:25:04,001 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-18 22:25:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10207 states to 10207 states and 15120 transitions. [2023-12-18 22:25:04,053 INFO L78 Accepts]: Start accepts. Automaton has 10207 states and 15120 transitions. Word has length 123 [2023-12-18 22:25:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:04,053 INFO L495 AbstractCegarLoop]: Abstraction has 10207 states and 15120 transitions. [2023-12-18 22:25:04,054 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-18 22:25:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 10207 states and 15120 transitions. [2023-12-18 22:25:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-18 22:25:04,084 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:04,085 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-18 22:25:04,091 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-18 22:25:04,292 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-18 22:25:04,292 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:04,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:04,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1006490321, now seen corresponding path program 1 times [2023-12-18 22:25:04,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:04,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360819136] [2023-12-18 22:25:04,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:04,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:04,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:04,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-18 22:25:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:04,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-18 22:25:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:04,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-18 22:25:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:04,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-18 22:25:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:04,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-18 22:25:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:04,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-18 22:25:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:04,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:04,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-18 22:25:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:04,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:04,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-18 22:25:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:04,434 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-18 22:25:04,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:04,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360819136] [2023-12-18 22:25:04,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360819136] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:04,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106599722] [2023-12-18 22:25:04,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:04,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:04,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:04,435 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-18 22:25:04,461 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-18 22:25:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:04,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-18 22:25:04,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:04,554 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-18 22:25:04,554 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:04,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106599722] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:04,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:04,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:25:04,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255508945] [2023-12-18 22:25:04,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:04,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:04,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:04,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:04,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:04,555 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-18 22:25:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:04,804 INFO L93 Difference]: Finished difference Result 14381 states and 21212 transitions. [2023-12-18 22:25:04,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:04,804 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-18 22:25:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:04,836 INFO L225 Difference]: With dead ends: 14381 [2023-12-18 22:25:04,836 INFO L226 Difference]: Without dead ends: 10227 [2023-12-18 22:25:04,851 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-18 22:25:04,851 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-18 22:25:04,852 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-18 22:25:04,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10227 states. [2023-12-18 22:25:05,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10227 to 10183. [2023-12-18 22:25:05,348 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-18 22:25:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10183 states to 10183 states and 14964 transitions. [2023-12-18 22:25:05,371 INFO L78 Accepts]: Start accepts. Automaton has 10183 states and 14964 transitions. Word has length 124 [2023-12-18 22:25:05,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:05,371 INFO L495 AbstractCegarLoop]: Abstraction has 10183 states and 14964 transitions. [2023-12-18 22:25:05,371 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-18 22:25:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 10183 states and 14964 transitions. [2023-12-18 22:25:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-18 22:25:05,385 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:05,385 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-18 22:25:05,391 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-18 22:25:05,590 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-18 22:25:05,591 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:05,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:05,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1898602929, now seen corresponding path program 1 times [2023-12-18 22:25:05,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:05,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159678766] [2023-12-18 22:25:05,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:05,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:05,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:05,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-18 22:25:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:05,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-18 22:25:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:05,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-18 22:25:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:05,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-18 22:25:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:05,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-18 22:25:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:05,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-18 22:25:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:05,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:05,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-18 22:25:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:05,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:05,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-18 22:25:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:05,667 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-18 22:25:05,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:05,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159678766] [2023-12-18 22:25:05,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159678766] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:05,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202085831] [2023-12-18 22:25:05,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:05,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:05,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:05,668 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-18 22:25:05,671 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-18 22:25:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:05,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-18 22:25:05,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:05,795 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-18 22:25:05,795 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:05,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202085831] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:05,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:05,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-18 22:25:05,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46388648] [2023-12-18 22:25:05,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:05,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-18 22:25:05,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:05,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-18 22:25:05,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-18 22:25:05,796 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-18 22:25:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:06,081 INFO L93 Difference]: Finished difference Result 16127 states and 23370 transitions. [2023-12-18 22:25:06,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-18 22:25:06,082 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-18 22:25:06,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:06,108 INFO L225 Difference]: With dead ends: 16127 [2023-12-18 22:25:06,108 INFO L226 Difference]: Without dead ends: 9051 [2023-12-18 22:25:06,126 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-18 22:25:06,127 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-18 22:25:06,127 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-18 22:25:06,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9051 states. [2023-12-18 22:25:06,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9051 to 8643. [2023-12-18 22:25:06,361 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-18 22:25:06,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8643 states to 8643 states and 12438 transitions. [2023-12-18 22:25:06,378 INFO L78 Accepts]: Start accepts. Automaton has 8643 states and 12438 transitions. Word has length 124 [2023-12-18 22:25:06,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:06,378 INFO L495 AbstractCegarLoop]: Abstraction has 8643 states and 12438 transitions. [2023-12-18 22:25:06,378 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-18 22:25:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 8643 states and 12438 transitions. [2023-12-18 22:25:06,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-18 22:25:06,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:06,388 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-18 22:25:06,395 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-18 22:25:06,593 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-18 22:25:06,593 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:06,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:06,594 INFO L85 PathProgramCache]: Analyzing trace with hash -315841116, now seen corresponding path program 1 times [2023-12-18 22:25:06,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:06,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582996251] [2023-12-18 22:25:06,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:06,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:06,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:06,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-18 22:25:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:06,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-18 22:25:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:06,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-18 22:25:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:06,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-18 22:25:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:06,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-18 22:25:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:06,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-18 22:25:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:06,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:06,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-18 22:25:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:06,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:06,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-18 22:25:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:06,691 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-18 22:25:06,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:06,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582996251] [2023-12-18 22:25:06,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582996251] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:06,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539208345] [2023-12-18 22:25:06,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:06,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:06,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:06,700 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-18 22:25:06,730 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-18 22:25:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:06,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-18 22:25:06,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:06,874 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-18 22:25:06,874 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:06,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539208345] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:06,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:06,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-18 22:25:06,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106827639] [2023-12-18 22:25:06,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:06,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 22:25:06,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:06,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 22:25:06,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-18 22:25:06,876 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-18 22:25:07,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:07,129 INFO L93 Difference]: Finished difference Result 11183 states and 15869 transitions. [2023-12-18 22:25:07,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 22:25:07,130 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-18 22:25:07,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:07,147 INFO L225 Difference]: With dead ends: 11183 [2023-12-18 22:25:07,148 INFO L226 Difference]: Without dead ends: 6959 [2023-12-18 22:25:07,157 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-18 22:25:07,157 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-18 22:25:07,157 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-18 22:25:07,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6959 states. [2023-12-18 22:25:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6959 to 6935. [2023-12-18 22:25:07,338 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-18 22:25:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 10056 transitions. [2023-12-18 22:25:07,352 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 10056 transitions. Word has length 125 [2023-12-18 22:25:07,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:07,352 INFO L495 AbstractCegarLoop]: Abstraction has 6935 states and 10056 transitions. [2023-12-18 22:25:07,353 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-18 22:25:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 10056 transitions. [2023-12-18 22:25:07,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-18 22:25:07,359 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:07,359 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-18 22:25:07,369 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-18 22:25:07,567 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-18 22:25:07,567 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:07,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:07,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1934816030, now seen corresponding path program 1 times [2023-12-18 22:25:07,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:07,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480364347] [2023-12-18 22:25:07,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:07,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:07,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:07,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-18 22:25:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:07,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-18 22:25:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:07,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-18 22:25:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:07,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-18 22:25:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:07,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-18 22:25:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:07,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-18 22:25:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:07,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:07,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-18 22:25:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:07,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:07,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-18 22:25:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:07,639 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-18 22:25:07,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:07,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480364347] [2023-12-18 22:25:07,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480364347] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:07,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35276218] [2023-12-18 22:25:07,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:07,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:07,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:07,657 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-18 22:25:07,658 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-18 22:25:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:07,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-18 22:25:07,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:07,800 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-18 22:25:07,800 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:07,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35276218] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:07,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:07,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-18 22:25:07,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844611248] [2023-12-18 22:25:07,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:07,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 22:25:07,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:07,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 22:25:07,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-18 22:25:07,802 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-18 22:25:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:08,124 INFO L93 Difference]: Finished difference Result 10847 states and 15238 transitions. [2023-12-18 22:25:08,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-18 22:25:08,124 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-18 22:25:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:08,142 INFO L225 Difference]: With dead ends: 10847 [2023-12-18 22:25:08,143 INFO L226 Difference]: Without dead ends: 6579 [2023-12-18 22:25:08,153 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-18 22:25:08,154 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-18 22:25:08,154 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-18 22:25:08,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6579 states. [2023-12-18 22:25:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6579 to 4985. [2023-12-18 22:25:08,387 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-18 22:25:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4985 states to 4985 states and 7462 transitions. [2023-12-18 22:25:08,396 INFO L78 Accepts]: Start accepts. Automaton has 4985 states and 7462 transitions. Word has length 125 [2023-12-18 22:25:08,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:08,396 INFO L495 AbstractCegarLoop]: Abstraction has 4985 states and 7462 transitions. [2023-12-18 22:25:08,397 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-18 22:25:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 4985 states and 7462 transitions. [2023-12-18 22:25:08,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-18 22:25:08,399 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:08,400 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-18 22:25:08,407 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-18 22:25:08,604 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-18 22:25:08,605 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:08,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:08,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1476642276, now seen corresponding path program 1 times [2023-12-18 22:25:08,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:08,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067909896] [2023-12-18 22:25:08,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:08,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:08,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:08,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-18 22:25:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:08,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-18 22:25:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:08,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-18 22:25:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:08,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-18 22:25:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:08,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-18 22:25:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:08,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-18 22:25:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:08,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:08,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-18 22:25:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:08,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:08,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-18 22:25:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:08,693 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-18 22:25:08,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:08,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067909896] [2023-12-18 22:25:08,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067909896] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:08,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366402335] [2023-12-18 22:25:08,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:08,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:08,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:08,709 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-18 22:25:08,722 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-18 22:25:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:08,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-18 22:25:08,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:08,795 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-18 22:25:08,795 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:08,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366402335] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:08,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:08,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-18 22:25:08,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609667243] [2023-12-18 22:25:08,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:08,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 22:25:08,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:08,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 22:25:08,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:25:08,796 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-18 22:25:08,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:08,911 INFO L93 Difference]: Finished difference Result 6831 states and 9780 transitions. [2023-12-18 22:25:08,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 22:25:08,912 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-18 22:25:08,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:08,920 INFO L225 Difference]: With dead ends: 6831 [2023-12-18 22:25:08,920 INFO L226 Difference]: Without dead ends: 3978 [2023-12-18 22:25:08,926 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-18 22:25:08,926 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-18 22:25:08,926 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-18 22:25:08,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3978 states. [2023-12-18 22:25:09,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 3978. [2023-12-18 22:25:09,010 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-18 22:25:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 6155 transitions. [2023-12-18 22:25:09,017 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 6155 transitions. Word has length 125 [2023-12-18 22:25:09,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:09,017 INFO L495 AbstractCegarLoop]: Abstraction has 3978 states and 6155 transitions. [2023-12-18 22:25:09,017 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-18 22:25:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 6155 transitions. [2023-12-18 22:25:09,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-18 22:25:09,020 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:09,020 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-18 22:25:09,027 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-18 22:25:09,225 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-18 22:25:09,226 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:09,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:09,226 INFO L85 PathProgramCache]: Analyzing trace with hash -985130332, now seen corresponding path program 1 times [2023-12-18 22:25:09,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:09,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672854941] [2023-12-18 22:25:09,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:09,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-18 22:25:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-18 22:25:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-18 22:25:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-18 22:25:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-18 22:25:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-18 22:25:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-18 22:25:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-18 22:25:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,313 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-18 22:25:09,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:09,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672854941] [2023-12-18 22:25:09,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672854941] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-18 22:25:09,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759664681] [2023-12-18 22:25:09,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:09,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-18 22:25:09,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-18 22:25:09,327 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-18 22:25:09,356 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-18 22:25:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-18 22:25:09,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-18 22:25:09,426 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-18 22:25:09,427 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-18 22:25:09,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759664681] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:09,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-18 22:25:09,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-18 22:25:09,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203805511] [2023-12-18 22:25:09,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:09,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-18 22:25:09,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:09,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-18 22:25:09,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:25:09,428 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-18 22:25:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:09,514 INFO L93 Difference]: Finished difference Result 5069 states and 7465 transitions. [2023-12-18 22:25:09,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-18 22:25:09,514 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-18 22:25:09,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:09,519 INFO L225 Difference]: With dead ends: 5069 [2023-12-18 22:25:09,520 INFO L226 Difference]: Without dead ends: 2852 [2023-12-18 22:25:09,524 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-18 22:25:09,524 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-18 22:25:09,524 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-18 22:25:09,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2023-12-18 22:25:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2023-12-18 22:25:09,565 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-18 22:25:09,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4791 transitions. [2023-12-18 22:25:09,570 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4791 transitions. Word has length 125 [2023-12-18 22:25:09,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:09,570 INFO L495 AbstractCegarLoop]: Abstraction has 2852 states and 4791 transitions. [2023-12-18 22:25:09,570 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-18 22:25:09,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4791 transitions. [2023-12-18 22:25:09,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-18 22:25:09,571 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:09,571 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-18 22:25:09,579 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-18 22:25:09,780 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-18 22:25:09,780 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:09,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash -88102940, now seen corresponding path program 1 times [2023-12-18 22:25:09,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:09,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414676944] [2023-12-18 22:25:09,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:09,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-18 22:25:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-18 22:25:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-18 22:25:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-18 22:25:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-18 22:25:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-18 22:25:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-18 22:25:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-18 22:25:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:09,942 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-18 22:25:09,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:09,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414676944] [2023-12-18 22:25:09,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414676944] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:09,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:25:09,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-18 22:25:09,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135130134] [2023-12-18 22:25:09,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:09,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-18 22:25:09,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:09,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-18 22:25:09,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-18 22:25:09,957 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-18 22:25:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:10,488 INFO L93 Difference]: Finished difference Result 2874 states and 4812 transitions. [2023-12-18 22:25:10,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-18 22:25:10,504 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-18 22:25:10,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:10,510 INFO L225 Difference]: With dead ends: 2874 [2023-12-18 22:25:10,510 INFO L226 Difference]: Without dead ends: 2871 [2023-12-18 22:25:10,511 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-18 22:25:10,511 INFO L413 NwaCegarLoop]: 4084 mSDtfsCounter, 4294 mSDsluCounter, 12093 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4317 SdHoareTripleChecker+Valid, 16177 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-18 22:25:10,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4317 Valid, 16177 Invalid, 417 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-18 22:25:10,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2023-12-18 22:25:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2851. [2023-12-18 22:25:10,609 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-18 22:25:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 4788 transitions. [2023-12-18 22:25:10,628 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 4788 transitions. Word has length 125 [2023-12-18 22:25:10,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:10,628 INFO L495 AbstractCegarLoop]: Abstraction has 2851 states and 4788 transitions. [2023-12-18 22:25:10,628 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-18 22:25:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 4788 transitions. [2023-12-18 22:25:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-18 22:25:10,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:10,630 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-18 22:25:10,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-18 22:25:10,630 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:10,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:10,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1275818764, now seen corresponding path program 1 times [2023-12-18 22:25:10,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:10,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898112176] [2023-12-18 22:25:10,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:10,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:10,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-18 22:25:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:10,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-18 22:25:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:10,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-18 22:25:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:10,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-18 22:25:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:10,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-18 22:25:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:10,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-18 22:25:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:10,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-18 22:25:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:10,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:10,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-18 22:25:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:10,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-18 22:25:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:10,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-18 22:25:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-18 22:25:10,737 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-18 22:25:10,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-18 22:25:10,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898112176] [2023-12-18 22:25:10,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898112176] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-18 22:25:10,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-18 22:25:10,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-18 22:25:10,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005205018] [2023-12-18 22:25:10,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-18 22:25:10,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-18 22:25:10,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-18 22:25:10,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-18 22:25:10,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-18 22:25:10,753 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-18 22:25:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-18 22:25:11,010 INFO L93 Difference]: Finished difference Result 3246 states and 5240 transitions. [2023-12-18 22:25:11,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-18 22:25:11,010 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-18 22:25:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-18 22:25:11,015 INFO L225 Difference]: With dead ends: 3246 [2023-12-18 22:25:11,015 INFO L226 Difference]: Without dead ends: 2881 [2023-12-18 22:25:11,017 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-18 22:25:11,017 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.2s IncrementalHoareTripleChecker+Time [2023-12-18 22:25:11,017 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.2s Time] [2023-12-18 22:25:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2023-12-18 22:25:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2853. [2023-12-18 22:25:11,064 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-18 22:25:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4790 transitions. [2023-12-18 22:25:11,068 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4790 transitions. Word has length 129 [2023-12-18 22:25:11,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-18 22:25:11,068 INFO L495 AbstractCegarLoop]: Abstraction has 2853 states and 4790 transitions. [2023-12-18 22:25:11,068 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-18 22:25:11,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4790 transitions. [2023-12-18 22:25:11,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-18 22:25:11,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-18 22:25:11,070 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-18 22:25:11,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-18 22:25:11,071 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-18 22:25:11,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-18 22:25:11,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2124916191, now seen corresponding path program 1 times [2023-12-18 22:25:11,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-18 22:25:11,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143749336] [2023-12-18 22:25:11,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-18 22:25:11,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-18 22:25:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-18 22:25:11,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-18 22:25:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-18 22:25:11,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-18 22:25:11,126 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-18 22:25:11,126 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-18 22:25:11,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-18 22:25:11,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-18 22:25:11,131 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-18 22:25:11,135 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-18 22:25:11,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:25:11 BoogieIcfgContainer [2023-12-18 22:25:11,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-18 22:25:11,221 INFO L158 Benchmark]: Toolchain (without parser) took 24125.76ms. Allocated memory was 251.7MB in the beginning and 2.7GB in the end (delta: 2.4GB). Free memory was 174.9MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 964.5MB. Max. memory is 8.0GB. [2023-12-18 22:25:11,221 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 174.1MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-18 22:25:11,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2218.85ms. Allocated memory was 251.7MB in the beginning and 391.1MB in the end (delta: 139.5MB). Free memory was 174.9MB in the beginning and 207.9MB in the end (delta: -33.0MB). Peak memory consumption was 107.4MB. Max. memory is 8.0GB. [2023-12-18 22:25:11,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 330.12ms. Allocated memory is still 391.1MB. Free memory was 207.9MB in the beginning and 234.1MB in the end (delta: -26.2MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2023-12-18 22:25:11,223 INFO L158 Benchmark]: Boogie Preprocessor took 530.73ms. Allocated memory is still 391.1MB. Free memory was 234.1MB in the beginning and 224.2MB in the end (delta: 10.0MB). Peak memory consumption was 80.7MB. Max. memory is 8.0GB. [2023-12-18 22:25:11,223 INFO L158 Benchmark]: RCFGBuilder took 5760.95ms. Allocated memory was 391.1MB in the beginning and 1.2GB in the end (delta: 833.6MB). Free memory was 224.2MB in the beginning and 900.0MB in the end (delta: -675.8MB). Peak memory consumption was 302.5MB. Max. memory is 8.0GB. [2023-12-18 22:25:11,224 INFO L158 Benchmark]: TraceAbstraction took 15279.66ms. Allocated memory was 1.2GB in the beginning and 2.7GB in the end (delta: 1.4GB). Free memory was 899.5MB in the beginning and 1.6GB in the end (delta: -718.4MB). Peak memory consumption was 715.0MB. Max. memory is 8.0GB. [2023-12-18 22:25:11,228 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.12ms. Allocated memory is still 174.1MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2218.85ms. Allocated memory was 251.7MB in the beginning and 391.1MB in the end (delta: 139.5MB). Free memory was 174.9MB in the beginning and 207.9MB in the end (delta: -33.0MB). Peak memory consumption was 107.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 330.12ms. Allocated memory is still 391.1MB. Free memory was 207.9MB in the beginning and 234.1MB in the end (delta: -26.2MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 530.73ms. Allocated memory is still 391.1MB. Free memory was 234.1MB in the beginning and 224.2MB in the end (delta: 10.0MB). Peak memory consumption was 80.7MB. Max. memory is 8.0GB. * RCFGBuilder took 5760.95ms. Allocated memory was 391.1MB in the beginning and 1.2GB in the end (delta: 833.6MB). Free memory was 224.2MB in the beginning and 900.0MB in the end (delta: -675.8MB). Peak memory consumption was 302.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15279.66ms. Allocated memory was 1.2GB in the beginning and 2.7GB in the end (delta: 1.4GB). Free memory was 899.5MB in the beginning and 1.6GB in the end (delta: -718.4MB). Peak memory consumption was 715.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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: 11133]: 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: 15.2s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46594 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46497 mSDsluCounter, 211879 SdHoareTripleChecker+Invalid, 2.4s 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.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1633 GetRequests, 1501 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.8s 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.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 2847 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s 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-18 22:25:11,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...