/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/Problem05_label43+token_ring.02.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 11:23:32,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 11:23:32,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 11:23:32,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 11:23:32,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 11:23:32,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 11:23:32,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 11:23:32,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 11:23:32,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 11:23:32,584 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 11:23:32,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 11:23:32,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 11:23:32,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 11:23:32,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 11:23:32,587 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 11:23:32,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 11:23:32,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 11:23:32,587 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 11:23:32,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 11:23:32,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 11:23:32,587 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 11:23:32,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 11:23:32,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 11:23:32,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 11:23:32,588 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 11:23:32,588 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 11:23:32,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 11:23:32,588 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 11:23:32,589 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 11:23:32,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 11:23:32,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 11:23:32,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 11:23:32,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 11:23:32,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 11:23:32,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 11:23:32,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 11:23:32,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 11:23:32,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 11:23:32,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 11:23:32,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 11:23:32,591 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 11:23:32,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 11:23:32,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 11:23:32,591 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 11:23:32,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 11:23:32,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 11:23:32,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 11:23:32,781 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 11:23:32,781 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 11:23:32,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/Problem05_label43+token_ring.02.cil-2.c [2023-12-20 11:23:33,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 11:23:34,264 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 11:23:34,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label43+token_ring.02.cil-2.c [2023-12-20 11:23:34,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79c805f42/bcaa32bd832d45ce808967cd98a2cc9b/FLAG9a9ded410 [2023-12-20 11:23:34,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79c805f42/bcaa32bd832d45ce808967cd98a2cc9b [2023-12-20 11:23:34,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 11:23:34,322 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 11:23:34,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 11:23:34,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 11:23:34,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 11:23:34,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:23:34" (1/1) ... [2023-12-20 11:23:34,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b7ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:23:34, skipping insertion in model container [2023-12-20 11:23:34,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:23:34" (1/1) ... [2023-12-20 11:23:34,491 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 11:23:35,787 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_label43+token_ring.02.cil-2.c[381679,381692] [2023-12-20 11:23:35,813 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_label43+token_ring.02.cil-2.c[383339,383352] [2023-12-20 11:23:35,945 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 11:23:35,954 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 11:23:36,567 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_label43+token_ring.02.cil-2.c[381679,381692] [2023-12-20 11:23:36,571 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_label43+token_ring.02.cil-2.c[383339,383352] [2023-12-20 11:23:36,587 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 11:23:36,631 INFO L206 MainTranslator]: Completed translation [2023-12-20 11:23:36,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:23:36 WrapperNode [2023-12-20 11:23:36,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 11:23:36,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 11:23:36,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 11:23:36,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 11:23:36,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:23:36" (1/1) ... [2023-12-20 11:23:36,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:23:36" (1/1) ... [2023-12-20 11:23:37,025 INFO L138 Inliner]: procedures = 48, calls = 48, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 12639 [2023-12-20 11:23:37,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 11:23:37,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 11:23:37,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 11:23:37,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 11:23:37,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:23:36" (1/1) ... [2023-12-20 11:23:37,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:23:36" (1/1) ... [2023-12-20 11:23:37,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:23:36" (1/1) ... [2023-12-20 11:23:37,166 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 11:23:37,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:23:36" (1/1) ... [2023-12-20 11:23:37,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:23:36" (1/1) ... [2023-12-20 11:23:37,409 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:23:36" (1/1) ... [2023-12-20 11:23:37,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:23:36" (1/1) ... [2023-12-20 11:23:37,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:23:36" (1/1) ... [2023-12-20 11:23:37,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:23:36" (1/1) ... [2023-12-20 11:23:37,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 11:23:37,647 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 11:23:37,647 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 11:23:37,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 11:23:37,648 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:23:36" (1/1) ... [2023-12-20 11:23:37,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 11:23:37,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:23:37,681 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 11:23:37,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 11:23:37,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 11:23:37,706 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-20 11:23:37,706 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-20 11:23:37,707 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-20 11:23:37,707 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-20 11:23:37,707 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-20 11:23:37,708 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-20 11:23:37,708 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-20 11:23:37,708 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-20 11:23:37,708 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-20 11:23:37,708 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-20 11:23:37,708 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-20 11:23:37,708 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-20 11:23:37,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 11:23:37,708 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-20 11:23:37,708 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-20 11:23:37,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 11:23:37,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 11:23:37,799 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 11:23:37,801 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 11:23:43,114 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 11:23:43,229 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 11:23:43,229 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-20 11:23:43,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:23:43 BoogieIcfgContainer [2023-12-20 11:23:43,229 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 11:23:43,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 11:23:43,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 11:23:43,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 11:23:43,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 11:23:34" (1/3) ... [2023-12-20 11:23:43,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46857e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:23:43, skipping insertion in model container [2023-12-20 11:23:43,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:23:36" (2/3) ... [2023-12-20 11:23:43,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46857e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:23:43, skipping insertion in model container [2023-12-20 11:23:43,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:23:43" (3/3) ... [2023-12-20 11:23:43,236 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.02.cil-2.c [2023-12-20 11:23:43,248 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 11:23:43,248 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-20 11:23:43,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 11:23:43,323 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;@190bd90c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 11:23:43,323 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-20 11:23:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 2249 states, 2221 states have (on average 1.8860873480414229) internal successors, (4189), 2226 states have internal predecessors, (4189), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-20 11:23:43,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-20 11:23:43,345 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:23:43,346 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:23:43,346 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:23:43,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:23:43,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1931990387, now seen corresponding path program 1 times [2023-12-20 11:23:43,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:23:43,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393869831] [2023-12-20 11:23:43,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:43,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:23:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:43,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:23:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:43,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:23:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:43,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:23:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:43,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:23:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:43,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:23:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 11:23:43,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:23:43,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393869831] [2023-12-20 11:23:43,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393869831] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:23:43,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:23:43,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 11:23:43,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404812743] [2023-12-20 11:23:43,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:23:43,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 11:23:43,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:23:43,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 11:23:43,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:23:43,742 INFO L87 Difference]: Start difference. First operand has 2249 states, 2221 states have (on average 1.8860873480414229) internal successors, (4189), 2226 states have internal predecessors, (4189), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-20 11:23:44,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:23:44,448 INFO L93 Difference]: Finished difference Result 4665 states and 8728 transitions. [2023-12-20 11:23:44,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 11:23:44,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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 62 [2023-12-20 11:23:44,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:23:44,466 INFO L225 Difference]: With dead ends: 4665 [2023-12-20 11:23:44,467 INFO L226 Difference]: Without dead ends: 2418 [2023-12-20 11:23:44,473 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-20 11:23:44,475 INFO L413 NwaCegarLoop]: 4068 mSDtfsCounter, 4366 mSDsluCounter, 12180 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4375 SdHoareTripleChecker+Valid, 16248 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 11:23:44,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4375 Valid, 16248 Invalid, 704 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [76 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 11:23:44,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2023-12-20 11:23:44,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2357. [2023-12-20 11:23:44,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2313 states have (on average 1.8408992650237785) internal successors, (4258), 2317 states have internal predecessors, (4258), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2023-12-20 11:23:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 4317 transitions. [2023-12-20 11:23:44,566 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 4317 transitions. Word has length 62 [2023-12-20 11:23:44,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:23:44,567 INFO L495 AbstractCegarLoop]: Abstraction has 2357 states and 4317 transitions. [2023-12-20 11:23:44,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-20 11:23:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 4317 transitions. [2023-12-20 11:23:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-20 11:23:44,570 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:23:44,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:23:44,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 11:23:44,571 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:23:44,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:23:44,571 INFO L85 PathProgramCache]: Analyzing trace with hash -230609229, now seen corresponding path program 1 times [2023-12-20 11:23:44,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:23:44,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993668194] [2023-12-20 11:23:44,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:44,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:23:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:44,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:23:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:44,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:23:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:44,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:23:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:44,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:23:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:44,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:23:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 11:23:44,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:23:44,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993668194] [2023-12-20 11:23:44,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993668194] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:23:44,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:23:44,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 11:23:44,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405848006] [2023-12-20 11:23:44,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:23:44,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 11:23:44,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:23:44,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 11:23:44,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:23:44,709 INFO L87 Difference]: Start difference. First operand 2357 states and 4317 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-20 11:23:45,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:23:45,638 INFO L93 Difference]: Finished difference Result 2788 states and 4980 transitions. [2023-12-20 11:23:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 11:23:45,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 62 [2023-12-20 11:23:45,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:23:45,647 INFO L225 Difference]: With dead ends: 2788 [2023-12-20 11:23:45,648 INFO L226 Difference]: Without dead ends: 2560 [2023-12-20 11:23:45,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-20 11:23:45,650 INFO L413 NwaCegarLoop]: 4143 mSDtfsCounter, 4356 mSDsluCounter, 16397 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4365 SdHoareTripleChecker+Valid, 20540 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-20 11:23:45,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4365 Valid, 20540 Invalid, 1067 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-20 11:23:45,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2023-12-20 11:23:45,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2463. [2023-12-20 11:23:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2463 states, 2401 states have (on average 1.82923781757601) internal successors, (4392), 2406 states have internal predecessors, (4392), 40 states have call successors, (40), 19 states have call predecessors, (40), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2023-12-20 11:23:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 4475 transitions. [2023-12-20 11:23:45,782 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 4475 transitions. Word has length 62 [2023-12-20 11:23:45,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:23:45,783 INFO L495 AbstractCegarLoop]: Abstraction has 2463 states and 4475 transitions. [2023-12-20 11:23:45,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-20 11:23:45,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 4475 transitions. [2023-12-20 11:23:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-20 11:23:45,785 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:23:45,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:23:45,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 11:23:45,785 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:23:45,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:23:45,785 INFO L85 PathProgramCache]: Analyzing trace with hash -711689487, now seen corresponding path program 1 times [2023-12-20 11:23:45,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:23:45,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602921451] [2023-12-20 11:23:45,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:45,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:23:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:45,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:23:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:45,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:23:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:45,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:23:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:45,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:23:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:45,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:23:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 11:23:45,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:23:45,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602921451] [2023-12-20 11:23:45,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602921451] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:23:45,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:23:45,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 11:23:45,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574699542] [2023-12-20 11:23:45,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:23:45,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 11:23:45,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:23:45,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 11:23:45,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:23:45,866 INFO L87 Difference]: Start difference. First operand 2463 states and 4475 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-20 11:23:46,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:23:46,567 INFO L93 Difference]: Finished difference Result 3161 states and 5546 transitions. [2023-12-20 11:23:46,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 11:23:46,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 62 [2023-12-20 11:23:46,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:23:46,576 INFO L225 Difference]: With dead ends: 3161 [2023-12-20 11:23:46,577 INFO L226 Difference]: Without dead ends: 2827 [2023-12-20 11:23:46,578 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-20 11:23:46,579 INFO L413 NwaCegarLoop]: 4073 mSDtfsCounter, 4394 mSDsluCounter, 16214 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4403 SdHoareTripleChecker+Valid, 20287 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 11:23:46,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4403 Valid, 20287 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 11:23:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2023-12-20 11:23:46,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2676. [2023-12-20 11:23:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2676 states, 2578 states have (on average 1.8079906904577192) internal successors, (4661), 2585 states have internal predecessors, (4661), 62 states have call successors, (62), 31 states have call predecessors, (62), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2023-12-20 11:23:46,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 4796 transitions. [2023-12-20 11:23:46,695 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 4796 transitions. Word has length 62 [2023-12-20 11:23:46,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:23:46,695 INFO L495 AbstractCegarLoop]: Abstraction has 2676 states and 4796 transitions. [2023-12-20 11:23:46,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-20 11:23:46,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 4796 transitions. [2023-12-20 11:23:46,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-20 11:23:46,697 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:23:46,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:23:46,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 11:23:46,698 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:23:46,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:23:46,699 INFO L85 PathProgramCache]: Analyzing trace with hash -727208205, now seen corresponding path program 1 times [2023-12-20 11:23:46,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:23:46,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121620378] [2023-12-20 11:23:46,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:46,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:23:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:46,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:23:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:46,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:23:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:46,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:23:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:46,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:23:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:46,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:23:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 11:23:46,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:23:46,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121620378] [2023-12-20 11:23:46,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121620378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:23:46,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:23:46,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 11:23:46,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666649088] [2023-12-20 11:23:46,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:23:46,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 11:23:46,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:23:46,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 11:23:46,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:23:46,778 INFO L87 Difference]: Start difference. First operand 2676 states and 4796 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-20 11:23:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:23:47,635 INFO L93 Difference]: Finished difference Result 3963 states and 6765 transitions. [2023-12-20 11:23:47,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 11:23:47,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 62 [2023-12-20 11:23:47,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:23:47,647 INFO L225 Difference]: With dead ends: 3963 [2023-12-20 11:23:47,647 INFO L226 Difference]: Without dead ends: 3416 [2023-12-20 11:23:47,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-20 11:23:47,650 INFO L413 NwaCegarLoop]: 4138 mSDtfsCounter, 4364 mSDsluCounter, 16389 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4372 SdHoareTripleChecker+Valid, 20527 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-20 11:23:47,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4372 Valid, 20527 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-20 11:23:47,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2023-12-20 11:23:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3060. [2023-12-20 11:23:47,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 2894 states have (on average 1.7736696613683482) internal successors, (5133), 2905 states have internal predecessors, (5133), 102 states have call successors, (102), 55 states have call predecessors, (102), 62 states have return successors, (135), 107 states have call predecessors, (135), 100 states have call successors, (135) [2023-12-20 11:23:47,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 5370 transitions. [2023-12-20 11:23:47,719 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 5370 transitions. Word has length 62 [2023-12-20 11:23:47,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:23:47,719 INFO L495 AbstractCegarLoop]: Abstraction has 3060 states and 5370 transitions. [2023-12-20 11:23:47,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-20 11:23:47,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 5370 transitions. [2023-12-20 11:23:47,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-20 11:23:47,721 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:23:47,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:23:47,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 11:23:47,721 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:23:47,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:23:47,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1080296587, now seen corresponding path program 1 times [2023-12-20 11:23:47,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:23:47,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414192886] [2023-12-20 11:23:47,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:47,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:23:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:47,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:23:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:47,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:23:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:47,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:23:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:47,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:23:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:47,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:23:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 11:23:47,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:23:47,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414192886] [2023-12-20 11:23:47,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414192886] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:23:47,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:23:47,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 11:23:47,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79730735] [2023-12-20 11:23:47,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:23:47,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 11:23:47,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:23:47,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 11:23:47,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:23:47,796 INFO L87 Difference]: Start difference. First operand 3060 states and 5370 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-20 11:23:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:23:48,622 INFO L93 Difference]: Finished difference Result 5261 states and 8705 transitions. [2023-12-20 11:23:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 11:23:48,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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 62 [2023-12-20 11:23:48,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:23:48,637 INFO L225 Difference]: With dead ends: 5261 [2023-12-20 11:23:48,637 INFO L226 Difference]: Without dead ends: 4330 [2023-12-20 11:23:48,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-20 11:23:48,641 INFO L413 NwaCegarLoop]: 4139 mSDtfsCounter, 4364 mSDsluCounter, 16392 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4376 SdHoareTripleChecker+Valid, 20531 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-20 11:23:48,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4376 Valid, 20531 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-20 11:23:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2023-12-20 11:23:48,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 3865. [2023-12-20 11:23:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3865 states, 3567 states have (on average 1.7244182786655453) internal successors, (6151), 3586 states have internal predecessors, (6151), 178 states have call successors, (178), 103 states have call predecessors, (178), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2023-12-20 11:23:48,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3865 states to 3865 states and 6602 transitions. [2023-12-20 11:23:48,734 INFO L78 Accepts]: Start accepts. Automaton has 3865 states and 6602 transitions. Word has length 62 [2023-12-20 11:23:48,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:23:48,734 INFO L495 AbstractCegarLoop]: Abstraction has 3865 states and 6602 transitions. [2023-12-20 11:23:48,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 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-20 11:23:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3865 states and 6602 transitions. [2023-12-20 11:23:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-20 11:23:48,736 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:23:48,736 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:23:48,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 11:23:48,737 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:23:48,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:23:48,737 INFO L85 PathProgramCache]: Analyzing trace with hash 847976115, now seen corresponding path program 1 times [2023-12-20 11:23:48,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:23:48,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118758978] [2023-12-20 11:23:48,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:48,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:23:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:48,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:23:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:48,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:23:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:48,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:23:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:48,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:23:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:48,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:23:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 11:23:48,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:23:48,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118758978] [2023-12-20 11:23:48,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118758978] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:23:48,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:23:48,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 11:23:48,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136079238] [2023-12-20 11:23:48,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:23:48,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 11:23:48,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:23:48,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 11:23:48,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:23:48,793 INFO L87 Difference]: Start difference. First operand 3865 states and 6602 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-20 11:23:49,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:23:49,449 INFO L93 Difference]: Finished difference Result 7007 states and 11395 transitions. [2023-12-20 11:23:49,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 11:23:49,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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 62 [2023-12-20 11:23:49,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:23:49,465 INFO L225 Difference]: With dead ends: 7007 [2023-12-20 11:23:49,466 INFO L226 Difference]: Without dead ends: 5272 [2023-12-20 11:23:49,470 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-20 11:23:49,471 INFO L413 NwaCegarLoop]: 4153 mSDtfsCounter, 4486 mSDsluCounter, 12194 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4511 SdHoareTripleChecker+Valid, 16347 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 11:23:49,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4511 Valid, 16347 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 11:23:49,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5272 states. [2023-12-20 11:23:49,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5272 to 4737. [2023-12-20 11:23:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4737 states, 4281 states have (on average 1.6783461807988789) internal successors, (7185), 4317 states have internal predecessors, (7185), 274 states have call successors, (274), 157 states have call predecessors, (274), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2023-12-20 11:23:49,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4737 states to 4737 states and 7856 transitions. [2023-12-20 11:23:49,582 INFO L78 Accepts]: Start accepts. Automaton has 4737 states and 7856 transitions. Word has length 62 [2023-12-20 11:23:49,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:23:49,582 INFO L495 AbstractCegarLoop]: Abstraction has 4737 states and 7856 transitions. [2023-12-20 11:23:49,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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-20 11:23:49,582 INFO L276 IsEmpty]: Start isEmpty. Operand 4737 states and 7856 transitions. [2023-12-20 11:23:49,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-20 11:23:49,587 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:23:49,587 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, 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-20 11:23:49,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 11:23:49,587 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:23:49,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:23:49,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1849177786, now seen corresponding path program 1 times [2023-12-20 11:23:49,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:23:49,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416196405] [2023-12-20 11:23:49,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:49,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:23:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:49,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:23:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:49,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:23:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:49,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:23:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:23:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:49,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:23:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:49,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 11:23:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:49,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:23:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:49,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 11:23:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-20 11:23:49,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:23:49,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416196405] [2023-12-20 11:23:49,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416196405] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:23:49,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97951669] [2023-12-20 11:23:49,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:49,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:23:49,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:23:49,668 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:23:49,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 11:23:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:49,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 11:23:49,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:23:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-20 11:23:49,822 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:23:49,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97951669] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:23:49,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:23:49,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-20 11:23:49,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927720768] [2023-12-20 11:23:49,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:23:49,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:23:49,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:23:49,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:23:49,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:23:49,824 INFO L87 Difference]: Start difference. First operand 4737 states and 7856 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-20 11:23:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:23:50,077 INFO L93 Difference]: Finished difference Result 9834 states and 15520 transitions. [2023-12-20 11:23:50,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:23:50,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2023-12-20 11:23:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:23:50,106 INFO L225 Difference]: With dead ends: 9834 [2023-12-20 11:23:50,106 INFO L226 Difference]: Without dead ends: 7227 [2023-12-20 11:23:50,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 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-20 11:23:50,115 INFO L413 NwaCegarLoop]: 4126 mSDtfsCounter, 4104 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4104 SdHoareTripleChecker+Valid, 4278 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:23:50,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4104 Valid, 4278 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:23:50,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7227 states. [2023-12-20 11:23:50,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7227 to 7197. [2023-12-20 11:23:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7197 states, 6327 states have (on average 1.6146672988778252) internal successors, (10216), 6396 states have internal predecessors, (10216), 512 states have call successors, (512), 309 states have call predecessors, (512), 356 states have return successors, (745), 507 states have call predecessors, (745), 510 states have call successors, (745) [2023-12-20 11:23:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7197 states to 7197 states and 11473 transitions. [2023-12-20 11:23:50,354 INFO L78 Accepts]: Start accepts. Automaton has 7197 states and 11473 transitions. Word has length 100 [2023-12-20 11:23:50,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:23:50,355 INFO L495 AbstractCegarLoop]: Abstraction has 7197 states and 11473 transitions. [2023-12-20 11:23:50,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-20 11:23:50,355 INFO L276 IsEmpty]: Start isEmpty. Operand 7197 states and 11473 transitions. [2023-12-20 11:23:50,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-20 11:23:50,362 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:23:50,363 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, 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-20 11:23:50,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-20 11:23:50,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:23:50,568 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:23:50,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:23:50,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1616599654, now seen corresponding path program 1 times [2023-12-20 11:23:50,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:23:50,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295878075] [2023-12-20 11:23:50,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:50,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:23:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:50,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:23:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:50,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:23:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:50,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:23:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:50,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:23:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:50,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:23:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:50,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 11:23:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:50,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:23:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:50,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 11:23:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-20 11:23:50,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:23:50,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295878075] [2023-12-20 11:23:50,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295878075] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:23:50,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357579458] [2023-12-20 11:23:50,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:50,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:23:50,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:23:50,721 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:23:50,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 11:23:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:50,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 11:23:50,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:23:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-20 11:23:50,860 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:23:50,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357579458] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:23:50,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:23:50,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 11:23:50,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439884132] [2023-12-20 11:23:50,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:23:50,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:23:50,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:23:50,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:23:50,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:23:50,863 INFO L87 Difference]: Start difference. First operand 7197 states and 11473 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-20 11:23:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:23:51,284 INFO L93 Difference]: Finished difference Result 16951 states and 26175 transitions. [2023-12-20 11:23:51,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:23:51,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 100 [2023-12-20 11:23:51,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:23:51,333 INFO L225 Difference]: With dead ends: 16951 [2023-12-20 11:23:51,334 INFO L226 Difference]: Without dead ends: 11885 [2023-12-20 11:23:51,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 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-20 11:23:51,353 INFO L413 NwaCegarLoop]: 4267 mSDtfsCounter, 145 mSDsluCounter, 4126 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 8393 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:23:51,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 8393 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:23:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11885 states. [2023-12-20 11:23:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11885 to 11885. [2023-12-20 11:23:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11885 states, 10202 states have (on average 1.5544991178200354) internal successors, (15859), 10320 states have internal predecessors, (15859), 977 states have call successors, (977), 609 states have call predecessors, (977), 704 states have return successors, (1596), 987 states have call predecessors, (1596), 975 states have call successors, (1596) [2023-12-20 11:23:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11885 states to 11885 states and 18432 transitions. [2023-12-20 11:23:51,859 INFO L78 Accepts]: Start accepts. Automaton has 11885 states and 18432 transitions. Word has length 100 [2023-12-20 11:23:51,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:23:51,860 INFO L495 AbstractCegarLoop]: Abstraction has 11885 states and 18432 transitions. [2023-12-20 11:23:51,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-20 11:23:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 11885 states and 18432 transitions. [2023-12-20 11:23:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-20 11:23:51,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:23:51,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:23:51,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-20 11:23:52,085 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,SelfDestructingSolverStorable7 [2023-12-20 11:23:52,086 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:23:52,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:23:52,086 INFO L85 PathProgramCache]: Analyzing trace with hash -443554109, now seen corresponding path program 1 times [2023-12-20 11:23:52,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:23:52,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890558035] [2023-12-20 11:23:52,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:52,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:23:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:52,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:23:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:52,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:23:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:52,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:23:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:52,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:23:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:23:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 11:23:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:23:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:52,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 11:23:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:23:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:52,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-20 11:23:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-20 11:23:52,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:23:52,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890558035] [2023-12-20 11:23:52,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890558035] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:23:52,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456128289] [2023-12-20 11:23:52,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:52,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:23:52,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:23:52,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:23:52,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 11:23:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:52,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 11:23:52,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:23:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-20 11:23:52,432 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:23:52,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456128289] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:23:52,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:23:52,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-20 11:23:52,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746989674] [2023-12-20 11:23:52,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:23:52,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:23:52,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:23:52,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:23:52,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:23:52,434 INFO L87 Difference]: Start difference. First operand 11885 states and 18432 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-20 11:23:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:23:53,015 INFO L93 Difference]: Finished difference Result 31009 states and 47101 transitions. [2023-12-20 11:23:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:23:53,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 128 [2023-12-20 11:23:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:23:53,079 INFO L225 Difference]: With dead ends: 31009 [2023-12-20 11:23:53,079 INFO L226 Difference]: Without dead ends: 21259 [2023-12-20 11:23:53,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 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-20 11:23:53,106 INFO L413 NwaCegarLoop]: 4147 mSDtfsCounter, 4065 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4065 SdHoareTripleChecker+Valid, 4299 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:23:53,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4065 Valid, 4299 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:23:53,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21259 states. [2023-12-20 11:23:53,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21259 to 21151. [2023-12-20 11:23:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21151 states, 17888 states have (on average 1.5120192307692308) internal successors, (27047), 18120 states have internal predecessors, (27047), 1871 states have call successors, (1871), 1199 states have call predecessors, (1871), 1390 states have return successors, (3038), 1863 states have call predecessors, (3038), 1869 states have call successors, (3038) [2023-12-20 11:23:53,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21151 states to 21151 states and 31956 transitions. [2023-12-20 11:23:53,686 INFO L78 Accepts]: Start accepts. Automaton has 21151 states and 31956 transitions. Word has length 128 [2023-12-20 11:23:53,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:23:53,687 INFO L495 AbstractCegarLoop]: Abstraction has 21151 states and 31956 transitions. [2023-12-20 11:23:53,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-20 11:23:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 21151 states and 31956 transitions. [2023-12-20 11:23:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-20 11:23:53,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:23:53,729 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:23:53,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-20 11:23:53,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:23:53,938 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:23:53,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:23:53,939 INFO L85 PathProgramCache]: Analyzing trace with hash -36945596, now seen corresponding path program 1 times [2023-12-20 11:23:53,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:23:53,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276112005] [2023-12-20 11:23:53,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:53,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:23:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:53,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:23:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:54,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:23:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:54,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:23:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:54,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:23:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:54,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:23:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:54,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 11:23:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:54,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 11:23:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:54,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:23:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:54,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-20 11:23:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:54,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:23:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:54,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 11:23:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-20 11:23:54,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:23:54,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276112005] [2023-12-20 11:23:54,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276112005] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:23:54,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449673994] [2023-12-20 11:23:54,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:54,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:23:54,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:23:54,062 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:23:54,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-20 11:23:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:54,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 11:23:54,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:23:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-20 11:23:54,249 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:23:54,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449673994] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:23:54,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:23:54,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 11:23:54,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082508461] [2023-12-20 11:23:54,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:23:54,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:23:54,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:23:54,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:23:54,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:23:54,251 INFO L87 Difference]: Start difference. First operand 21151 states and 31956 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 11:23:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:23:54,740 INFO L93 Difference]: Finished difference Result 42211 states and 63898 transitions. [2023-12-20 11:23:54,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:23:54,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 144 [2023-12-20 11:23:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:23:54,805 INFO L225 Difference]: With dead ends: 42211 [2023-12-20 11:23:54,806 INFO L226 Difference]: Without dead ends: 23193 [2023-12-20 11:23:54,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 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-20 11:23:54,853 INFO L413 NwaCegarLoop]: 4123 mSDtfsCounter, 4082 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4082 SdHoareTripleChecker+Valid, 4151 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:23:54,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4082 Valid, 4151 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:23:54,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23193 states. [2023-12-20 11:23:55,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23193 to 23193. [2023-12-20 11:23:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23193 states, 19718 states have (on average 1.4555735875849478) internal successors, (28701), 19950 states have internal predecessors, (28701), 1925 states have call successors, (1925), 1357 states have call predecessors, (1925), 1548 states have return successors, (3106), 1917 states have call predecessors, (3106), 1923 states have call successors, (3106) [2023-12-20 11:23:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23193 states to 23193 states and 33732 transitions. [2023-12-20 11:23:55,666 INFO L78 Accepts]: Start accepts. Automaton has 23193 states and 33732 transitions. Word has length 144 [2023-12-20 11:23:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:23:55,667 INFO L495 AbstractCegarLoop]: Abstraction has 23193 states and 33732 transitions. [2023-12-20 11:23:55,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 11:23:55,668 INFO L276 IsEmpty]: Start isEmpty. Operand 23193 states and 33732 transitions. [2023-12-20 11:23:55,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-20 11:23:55,711 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:23:55,711 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:23:55,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-20 11:23:55,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:23:55,925 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:23:55,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:23:55,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1547018971, now seen corresponding path program 1 times [2023-12-20 11:23:55,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:23:55,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950499809] [2023-12-20 11:23:55,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:55,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:23:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:55,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:23:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:55,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:23:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:55,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:23:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:56,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:23:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:56,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:23:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:56,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 11:23:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:56,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 11:23:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:56,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:23:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:56,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-20 11:23:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:56,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:23:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:56,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 11:23:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:56,052 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-20 11:23:56,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:23:56,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950499809] [2023-12-20 11:23:56,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950499809] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:23:56,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773792308] [2023-12-20 11:23:56,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:56,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:23:56,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:23:56,070 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:23:56,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-20 11:23:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:56,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 11:23:56,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:23:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-20 11:23:56,243 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:23:56,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773792308] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:23:56,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:23:56,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 11:23:56,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007081401] [2023-12-20 11:23:56,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:23:56,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:23:56,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:23:56,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:23:56,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:23:56,247 INFO L87 Difference]: Start difference. First operand 23193 states and 33732 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-20 11:23:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:23:56,980 INFO L93 Difference]: Finished difference Result 39048 states and 56092 transitions. [2023-12-20 11:23:56,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:23:56,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 144 [2023-12-20 11:23:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:23:57,060 INFO L225 Difference]: With dead ends: 39048 [2023-12-20 11:23:57,060 INFO L226 Difference]: Without dead ends: 24517 [2023-12-20 11:23:57,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 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-20 11:23:57,100 INFO L413 NwaCegarLoop]: 4155 mSDtfsCounter, 4079 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4079 SdHoareTripleChecker+Valid, 4312 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:23:57,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4079 Valid, 4312 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:23:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24517 states. [2023-12-20 11:23:57,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24517 to 24377. [2023-12-20 11:23:57,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24377 states, 20790 states have (on average 1.431120731120731) internal successors, (29753), 21022 states have internal predecessors, (29753), 1945 states have call successors, (1945), 1449 states have call predecessors, (1945), 1640 states have return successors, (3218), 1937 states have call predecessors, (3218), 1943 states have call successors, (3218) [2023-12-20 11:23:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24377 states to 24377 states and 34916 transitions. [2023-12-20 11:23:57,939 INFO L78 Accepts]: Start accepts. Automaton has 24377 states and 34916 transitions. Word has length 144 [2023-12-20 11:23:57,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:23:57,940 INFO L495 AbstractCegarLoop]: Abstraction has 24377 states and 34916 transitions. [2023-12-20 11:23:57,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-20 11:23:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 24377 states and 34916 transitions. [2023-12-20 11:23:58,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-20 11:23:58,000 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:23:58,001 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:23:58,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-20 11:23:58,205 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,SelfDestructingSolverStorable10 [2023-12-20 11:23:58,206 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:23:58,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:23:58,206 INFO L85 PathProgramCache]: Analyzing trace with hash 557859153, now seen corresponding path program 1 times [2023-12-20 11:23:58,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:23:58,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347927952] [2023-12-20 11:23:58,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:58,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:23:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:58,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:23:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:58,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:23:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:58,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:23:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:58,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:23:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:58,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:23:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:58,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 11:23:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:58,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:23:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:58,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 11:23:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:58,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-20 11:23:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:58,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:23:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:58,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 11:23:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:58,303 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-20 11:23:58,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:23:58,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347927952] [2023-12-20 11:23:58,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347927952] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:23:58,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452804209] [2023-12-20 11:23:58,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:23:58,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:23:58,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:23:58,304 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:23:58,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-20 11:23:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:23:58,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 11:23:58,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:23:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-20 11:23:58,415 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:23:58,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452804209] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:23:58,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:23:58,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 11:23:58,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520424243] [2023-12-20 11:23:58,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:23:58,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:23:58,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:23:58,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:23:58,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:23:58,417 INFO L87 Difference]: Start difference. First operand 24377 states and 34916 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-20 11:23:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:23:59,362 INFO L93 Difference]: Finished difference Result 67691 states and 96134 transitions. [2023-12-20 11:23:59,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:23:59,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 145 [2023-12-20 11:23:59,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:23:59,473 INFO L225 Difference]: With dead ends: 67691 [2023-12-20 11:23:59,473 INFO L226 Difference]: Without dead ends: 45451 [2023-12-20 11:23:59,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 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-20 11:23:59,514 INFO L413 NwaCegarLoop]: 4274 mSDtfsCounter, 155 mSDsluCounter, 4121 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 8395 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:23:59,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 8395 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:23:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45451 states. [2023-12-20 11:24:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45451 to 45407. [2023-12-20 11:24:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45407 states, 38406 states have (on average 1.3971514867468624) internal successors, (53659), 38868 states have internal predecessors, (53659), 3775 states have call successors, (3775), 2841 states have call predecessors, (3775), 3224 states have return successors, (7134), 3761 states have call predecessors, (7134), 3773 states have call successors, (7134) [2023-12-20 11:24:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45407 states to 45407 states and 64568 transitions. [2023-12-20 11:24:00,924 INFO L78 Accepts]: Start accepts. Automaton has 45407 states and 64568 transitions. Word has length 145 [2023-12-20 11:24:00,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:24:00,924 INFO L495 AbstractCegarLoop]: Abstraction has 45407 states and 64568 transitions. [2023-12-20 11:24:00,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-20 11:24:00,924 INFO L276 IsEmpty]: Start isEmpty. Operand 45407 states and 64568 transitions. [2023-12-20 11:24:00,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-20 11:24:00,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:24:00,993 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:24:01,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-20 11:24:01,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:01,198 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:24:01,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:24:01,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2138110948, now seen corresponding path program 1 times [2023-12-20 11:24:01,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:24:01,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620515779] [2023-12-20 11:24:01,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:01,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:24:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:01,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:24:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:01,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:24:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:01,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:24:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:01,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:24:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:01,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:24:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:01,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 11:24:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:01,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:01,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 11:24:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:01,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-20 11:24:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:01,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:01,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 11:24:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-12-20 11:24:01,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:24:01,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620515779] [2023-12-20 11:24:01,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620515779] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:24:01,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464772647] [2023-12-20 11:24:01,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:01,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:01,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:24:01,498 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:24:01,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-20 11:24:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:01,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 11:24:01,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:24:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-20 11:24:01,662 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:24:01,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464772647] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:24:01,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:24:01,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 11:24:01,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477054187] [2023-12-20 11:24:01,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:24:01,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:24:01,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:24:01,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:24:01,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:24:01,664 INFO L87 Difference]: Start difference. First operand 45407 states and 64568 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 11:24:02,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:24:02,769 INFO L93 Difference]: Finished difference Result 73407 states and 105859 transitions. [2023-12-20 11:24:02,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:24:02,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 145 [2023-12-20 11:24:02,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:24:02,897 INFO L225 Difference]: With dead ends: 73407 [2023-12-20 11:24:02,897 INFO L226 Difference]: Without dead ends: 38659 [2023-12-20 11:24:02,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 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-20 11:24:02,946 INFO L413 NwaCegarLoop]: 4120 mSDtfsCounter, 4077 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4077 SdHoareTripleChecker+Valid, 4147 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:24:02,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4077 Valid, 4147 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:24:02,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38659 states. [2023-12-20 11:24:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38659 to 28179. [2023-12-20 11:24:03,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28179 states, 24002 states have (on average 1.3733438880093325) internal successors, (32963), 24244 states have internal predecessors, (32963), 2255 states have call successors, (2255), 1729 states have call predecessors, (2255), 1920 states have return successors, (3778), 2237 states have call predecessors, (3778), 2253 states have call successors, (3778) [2023-12-20 11:24:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28179 states to 28179 states and 38996 transitions. [2023-12-20 11:24:04,052 INFO L78 Accepts]: Start accepts. Automaton has 28179 states and 38996 transitions. Word has length 145 [2023-12-20 11:24:04,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:24:04,052 INFO L495 AbstractCegarLoop]: Abstraction has 28179 states and 38996 transitions. [2023-12-20 11:24:04,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 11:24:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 28179 states and 38996 transitions. [2023-12-20 11:24:04,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-20 11:24:04,090 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:24:04,090 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:24:04,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-20 11:24:04,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:04,295 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:24:04,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:24:04,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1382369957, now seen corresponding path program 1 times [2023-12-20 11:24:04,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:24:04,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211675991] [2023-12-20 11:24:04,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:04,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:24:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:04,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:24:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:04,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:24:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:04,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:24:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:04,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:24:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:04,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:24:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:04,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 11:24:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:04,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:04,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 11:24:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:04,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-20 11:24:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:04,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:04,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-20 11:24:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-20 11:24:04,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:24:04,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211675991] [2023-12-20 11:24:04,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211675991] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:24:04,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073317507] [2023-12-20 11:24:04,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:04,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:04,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:24:04,405 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:24:04,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-20 11:24:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:04,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 11:24:04,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:24:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-20 11:24:04,543 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:24:04,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073317507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:24:04,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:24:04,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 11:24:04,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521988935] [2023-12-20 11:24:04,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:24:04,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:24:04,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:24:04,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:24:04,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:24:04,544 INFO L87 Difference]: Start difference. First operand 28179 states and 38996 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-20 11:24:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:24:05,995 INFO L93 Difference]: Finished difference Result 76319 states and 105000 transitions. [2023-12-20 11:24:05,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:24:05,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 145 [2023-12-20 11:24:05,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:24:06,223 INFO L225 Difference]: With dead ends: 76319 [2023-12-20 11:24:06,224 INFO L226 Difference]: Without dead ends: 50287 [2023-12-20 11:24:06,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 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-20 11:24:06,263 INFO L413 NwaCegarLoop]: 4268 mSDtfsCounter, 143 mSDsluCounter, 4117 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 8385 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:24:06,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 8385 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:24:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50287 states. [2023-12-20 11:24:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50287 to 50283. [2023-12-20 11:24:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50283 states, 42414 states have (on average 1.3403828924411751) internal successors, (56851), 42896 states have internal predecessors, (56851), 4267 states have call successors, (4267), 3217 states have call predecessors, (4267), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2023-12-20 11:24:08,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50283 states to 50283 states and 69318 transitions. [2023-12-20 11:24:08,212 INFO L78 Accepts]: Start accepts. Automaton has 50283 states and 69318 transitions. Word has length 145 [2023-12-20 11:24:08,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:24:08,212 INFO L495 AbstractCegarLoop]: Abstraction has 50283 states and 69318 transitions. [2023-12-20 11:24:08,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-20 11:24:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 50283 states and 69318 transitions. [2023-12-20 11:24:08,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-20 11:24:08,263 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:24:08,263 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:24:08,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-20 11:24:08,468 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,SelfDestructingSolverStorable13 [2023-12-20 11:24:08,468 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:24:08,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:24:08,469 INFO L85 PathProgramCache]: Analyzing trace with hash 96420286, now seen corresponding path program 1 times [2023-12-20 11:24:08,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:24:08,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428079915] [2023-12-20 11:24:08,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:08,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:24:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:08,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:24:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:08,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:24:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:08,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:24:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:08,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:24:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:08,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:24:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:08,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 11:24:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:08,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-20 11:24:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:08,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:08,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-20 11:24:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:08,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:08,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-20 11:24:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-20 11:24:08,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:24:08,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428079915] [2023-12-20 11:24:08,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428079915] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:24:08,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345108803] [2023-12-20 11:24:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:08,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:08,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:24:08,560 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:24:08,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-20 11:24:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:08,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 11:24:08,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:24:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-20 11:24:08,694 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:24:08,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345108803] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:24:08,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:24:08,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 11:24:08,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558499317] [2023-12-20 11:24:08,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:24:08,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:24:08,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:24:08,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:24:08,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:24:08,696 INFO L87 Difference]: Start difference. First operand 50283 states and 69318 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-20 11:24:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:24:10,462 INFO L93 Difference]: Finished difference Result 88239 states and 121052 transitions. [2023-12-20 11:24:10,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:24:10,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 146 [2023-12-20 11:24:10,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:24:10,602 INFO L225 Difference]: With dead ends: 88239 [2023-12-20 11:24:10,603 INFO L226 Difference]: Without dead ends: 51007 [2023-12-20 11:24:10,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 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-20 11:24:10,666 INFO L413 NwaCegarLoop]: 4148 mSDtfsCounter, 4096 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4096 SdHoareTripleChecker+Valid, 4299 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:24:10,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4096 Valid, 4299 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:24:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51007 states. [2023-12-20 11:24:12,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51007 to 50283. [2023-12-20 11:24:12,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50283 states, 42414 states have (on average 1.3318951289668506) internal successors, (56491), 42896 states have internal predecessors, (56491), 4267 states have call successors, (4267), 3217 states have call predecessors, (4267), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2023-12-20 11:24:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50283 states to 50283 states and 68958 transitions. [2023-12-20 11:24:12,841 INFO L78 Accepts]: Start accepts. Automaton has 50283 states and 68958 transitions. Word has length 146 [2023-12-20 11:24:12,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:24:12,841 INFO L495 AbstractCegarLoop]: Abstraction has 50283 states and 68958 transitions. [2023-12-20 11:24:12,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-20 11:24:12,841 INFO L276 IsEmpty]: Start isEmpty. Operand 50283 states and 68958 transitions. [2023-12-20 11:24:12,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-20 11:24:12,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:24:12,887 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:24:12,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-20 11:24:13,092 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,SelfDestructingSolverStorable14 [2023-12-20 11:24:13,094 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:24:13,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:24:13,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1662299722, now seen corresponding path program 1 times [2023-12-20 11:24:13,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:24:13,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870786611] [2023-12-20 11:24:13,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:13,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:24:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:13,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:24:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:13,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:24:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:13,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:24:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:13,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:24:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:13,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:24:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:13,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 11:24:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:13,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-20 11:24:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:13,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:13,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 11:24:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:13,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:13,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-20 11:24:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-12-20 11:24:13,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:24:13,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870786611] [2023-12-20 11:24:13,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870786611] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:24:13,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435690751] [2023-12-20 11:24:13,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:13,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:13,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:24:13,198 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:24:13,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-20 11:24:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:13,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 11:24:13,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:24:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-20 11:24:13,339 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:24:13,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435690751] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:24:13,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:24:13,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 11:24:13,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102447903] [2023-12-20 11:24:13,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:24:13,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:24:13,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:24:13,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:24:13,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:24:13,340 INFO L87 Difference]: Start difference. First operand 50283 states and 68958 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (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-20 11:24:15,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:24:15,138 INFO L93 Difference]: Finished difference Result 87915 states and 120128 transitions. [2023-12-20 11:24:15,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:24:15,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (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 146 [2023-12-20 11:24:15,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:24:15,284 INFO L225 Difference]: With dead ends: 87915 [2023-12-20 11:24:15,284 INFO L226 Difference]: Without dead ends: 51455 [2023-12-20 11:24:15,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 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-20 11:24:15,343 INFO L413 NwaCegarLoop]: 4157 mSDtfsCounter, 4098 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4098 SdHoareTripleChecker+Valid, 4310 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:24:15,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4098 Valid, 4310 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:24:15,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51455 states. [2023-12-20 11:24:17,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51455 to 50163. [2023-12-20 11:24:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50163 states, 42294 states have (on average 1.3243249633517757) internal successors, (56011), 42776 states have internal predecessors, (56011), 4267 states have call successors, (4267), 3217 states have call predecessors, (4267), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2023-12-20 11:24:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50163 states to 50163 states and 68478 transitions. [2023-12-20 11:24:17,310 INFO L78 Accepts]: Start accepts. Automaton has 50163 states and 68478 transitions. Word has length 146 [2023-12-20 11:24:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:24:17,310 INFO L495 AbstractCegarLoop]: Abstraction has 50163 states and 68478 transitions. [2023-12-20 11:24:17,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (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-20 11:24:17,310 INFO L276 IsEmpty]: Start isEmpty. Operand 50163 states and 68478 transitions. [2023-12-20 11:24:17,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-20 11:24:17,362 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:24:17,362 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:24:17,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-20 11:24:17,568 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,SelfDestructingSolverStorable15 [2023-12-20 11:24:17,568 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:24:17,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:24:17,569 INFO L85 PathProgramCache]: Analyzing trace with hash -983657282, now seen corresponding path program 1 times [2023-12-20 11:24:17,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:24:17,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095339013] [2023-12-20 11:24:17,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:17,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:24:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:17,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:24:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:17,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:24:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:17,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:24:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:17,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:24:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:17,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:24:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:17,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 11:24:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:17,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-20 11:24:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:17,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:17,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-20 11:24:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:17,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:17,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-20 11:24:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-12-20 11:24:17,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:24:17,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095339013] [2023-12-20 11:24:17,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095339013] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:24:17,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:24:17,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 11:24:17,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867555886] [2023-12-20 11:24:17,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:24:17,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 11:24:17,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:24:17,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 11:24:17,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 11:24:17,625 INFO L87 Difference]: Start difference. First operand 50163 states and 68478 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), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-20 11:24:19,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:24:19,248 INFO L93 Difference]: Finished difference Result 95865 states and 128803 transitions. [2023-12-20 11:24:19,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 11:24:19,249 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), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 146 [2023-12-20 11:24:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:24:19,382 INFO L225 Difference]: With dead ends: 95865 [2023-12-20 11:24:19,382 INFO L226 Difference]: Without dead ends: 47845 [2023-12-20 11:24:19,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-20 11:24:19,449 INFO L413 NwaCegarLoop]: 4070 mSDtfsCounter, 287 mSDsluCounter, 11992 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 16062 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 11:24:19,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 16062 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 11:24:19,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47845 states. [2023-12-20 11:24:21,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47845 to 45155. [2023-12-20 11:24:21,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45155 states, 38370 states have (on average 1.3295543393275997) internal successors, (51015), 39264 states have internal predecessors, (51015), 3255 states have call successors, (3255), 2473 states have call predecessors, (3255), 3528 states have return successors, (6773), 3449 states have call predecessors, (6773), 3253 states have call successors, (6773) [2023-12-20 11:24:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45155 states to 45155 states and 61043 transitions. [2023-12-20 11:24:21,209 INFO L78 Accepts]: Start accepts. Automaton has 45155 states and 61043 transitions. Word has length 146 [2023-12-20 11:24:21,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:24:21,209 INFO L495 AbstractCegarLoop]: Abstraction has 45155 states and 61043 transitions. [2023-12-20 11:24:21,209 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), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-20 11:24:21,209 INFO L276 IsEmpty]: Start isEmpty. Operand 45155 states and 61043 transitions. [2023-12-20 11:24:21,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-20 11:24:21,244 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:24:21,244 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:24:21,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-20 11:24:21,244 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:24:21,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:24:21,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1413843700, now seen corresponding path program 1 times [2023-12-20 11:24:21,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:24:21,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637813315] [2023-12-20 11:24:21,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:21,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:24:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:21,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:24:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:21,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:24:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:21,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:24:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:21,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:24:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:21,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:24:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:21,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 11:24:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:21,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-20 11:24:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:21,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:21,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 11:24:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:21,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:21,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-20 11:24:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:21,303 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-20 11:24:21,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:24:21,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637813315] [2023-12-20 11:24:21,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637813315] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:24:21,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:24:21,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 11:24:21,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210036275] [2023-12-20 11:24:21,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:24:21,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 11:24:21,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:24:21,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 11:24:21,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 11:24:21,305 INFO L87 Difference]: Start difference. First operand 45155 states and 61043 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-20 11:24:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:24:22,616 INFO L93 Difference]: Finished difference Result 80117 states and 107182 transitions. [2023-12-20 11:24:22,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 11:24:22,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 146 [2023-12-20 11:24:22,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:24:22,707 INFO L225 Difference]: With dead ends: 80117 [2023-12-20 11:24:22,707 INFO L226 Difference]: Without dead ends: 37097 [2023-12-20 11:24:22,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-20 11:24:22,759 INFO L413 NwaCegarLoop]: 4069 mSDtfsCounter, 287 mSDsluCounter, 11991 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 16060 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 11:24:22,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 16060 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 11:24:22,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37097 states. [2023-12-20 11:24:23,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37097 to 34547. [2023-12-20 11:24:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34547 states, 29508 states have (on average 1.3484817676562288) internal successors, (39791), 30146 states have internal predecessors, (39791), 2429 states have call successors, (2429), 1857 states have call predecessors, (2429), 2608 states have return successors, (4799), 2559 states have call predecessors, (4799), 2427 states have call successors, (4799) [2023-12-20 11:24:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34547 states to 34547 states and 47019 transitions. [2023-12-20 11:24:24,080 INFO L78 Accepts]: Start accepts. Automaton has 34547 states and 47019 transitions. Word has length 146 [2023-12-20 11:24:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:24:24,080 INFO L495 AbstractCegarLoop]: Abstraction has 34547 states and 47019 transitions. [2023-12-20 11:24:24,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-20 11:24:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 34547 states and 47019 transitions. [2023-12-20 11:24:24,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-20 11:24:24,109 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:24:24,109 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:24:24,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-20 11:24:24,109 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:24:24,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:24:24,109 INFO L85 PathProgramCache]: Analyzing trace with hash 884976712, now seen corresponding path program 1 times [2023-12-20 11:24:24,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:24:24,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134629394] [2023-12-20 11:24:24,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:24,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:24:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:24,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:24:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:24,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:24:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:24,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:24:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:24,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:24:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:24,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:24:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:24,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 11:24:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:24,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 11:24:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:24,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:24,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 11:24:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:24,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:24,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-20 11:24:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-20 11:24:24,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:24:24,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134629394] [2023-12-20 11:24:24,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134629394] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:24:24,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136887859] [2023-12-20 11:24:24,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:24,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:24,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:24:24,184 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:24:24,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-20 11:24:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:24,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 11:24:24,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:24:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-20 11:24:24,346 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:24:24,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136887859] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:24:24,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:24:24,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 11:24:24,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118536871] [2023-12-20 11:24:24,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:24:24,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:24:24,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:24:24,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:24:24,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:24:24,350 INFO L87 Difference]: Start difference. First operand 34547 states and 47019 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-20 11:24:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:24:25,483 INFO L93 Difference]: Finished difference Result 56595 states and 78589 transitions. [2023-12-20 11:24:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:24:25,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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 150 [2023-12-20 11:24:25,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:24:25,557 INFO L225 Difference]: With dead ends: 56595 [2023-12-20 11:24:25,557 INFO L226 Difference]: Without dead ends: 34635 [2023-12-20 11:24:25,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 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-20 11:24:25,593 INFO L413 NwaCegarLoop]: 4210 mSDtfsCounter, 134 mSDsluCounter, 4106 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 8316 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:24:25,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 8316 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:24:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34635 states. [2023-12-20 11:24:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34635 to 34547. [2023-12-20 11:24:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34547 states, 29508 states have (on average 1.3250982784329672) internal successors, (39101), 30146 states have internal predecessors, (39101), 2429 states have call successors, (2429), 1857 states have call predecessors, (2429), 2608 states have return successors, (4799), 2559 states have call predecessors, (4799), 2427 states have call successors, (4799) [2023-12-20 11:24:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34547 states to 34547 states and 46329 transitions. [2023-12-20 11:24:26,893 INFO L78 Accepts]: Start accepts. Automaton has 34547 states and 46329 transitions. Word has length 150 [2023-12-20 11:24:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:24:26,894 INFO L495 AbstractCegarLoop]: Abstraction has 34547 states and 46329 transitions. [2023-12-20 11:24:26,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-20 11:24:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 34547 states and 46329 transitions. [2023-12-20 11:24:26,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-20 11:24:26,922 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:24:26,922 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:24:26,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-20 11:24:27,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:27,127 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:24:27,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:24:27,127 INFO L85 PathProgramCache]: Analyzing trace with hash -743401018, now seen corresponding path program 1 times [2023-12-20 11:24:27,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:24:27,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035776628] [2023-12-20 11:24:27,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:27,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:24:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:27,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:24:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:27,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:24:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:27,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:24:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:27,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:24:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:27,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:24:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:27,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 11:24:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:27,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 11:24:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:27,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:27,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 11:24:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:27,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:27,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-20 11:24:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:27,200 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-20 11:24:27,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:24:27,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035776628] [2023-12-20 11:24:27,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035776628] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:24:27,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478930874] [2023-12-20 11:24:27,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:27,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:27,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:24:27,202 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:24:27,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-20 11:24:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:27,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 11:24:27,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:24:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-20 11:24:27,329 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:24:27,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478930874] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:24:27,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:24:27,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 11:24:27,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523235716] [2023-12-20 11:24:27,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:24:27,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:24:27,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:24:27,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:24:27,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:24:27,330 INFO L87 Difference]: Start difference. First operand 34547 states and 46329 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-20 11:24:28,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:24:28,291 INFO L93 Difference]: Finished difference Result 59540 states and 80626 transitions. [2023-12-20 11:24:28,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:24:28,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 150 [2023-12-20 11:24:28,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:24:28,359 INFO L225 Difference]: With dead ends: 59540 [2023-12-20 11:24:28,359 INFO L226 Difference]: Without dead ends: 29432 [2023-12-20 11:24:28,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 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-20 11:24:28,400 INFO L413 NwaCegarLoop]: 4122 mSDtfsCounter, 4112 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4112 SdHoareTripleChecker+Valid, 4148 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:24:28,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4112 Valid, 4148 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:24:28,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29432 states. [2023-12-20 11:24:29,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29432 to 28318. [2023-12-20 11:24:29,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28318 states, 24319 states have (on average 1.3000534561454007) internal successors, (31616), 24814 states have internal predecessors, (31616), 1933 states have call successors, (1933), 1481 states have call predecessors, (1933), 2064 states have return successors, (3537), 2030 states have call predecessors, (3537), 1931 states have call successors, (3537) [2023-12-20 11:24:29,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28318 states to 28318 states and 37086 transitions. [2023-12-20 11:24:29,397 INFO L78 Accepts]: Start accepts. Automaton has 28318 states and 37086 transitions. Word has length 150 [2023-12-20 11:24:29,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:24:29,397 INFO L495 AbstractCegarLoop]: Abstraction has 28318 states and 37086 transitions. [2023-12-20 11:24:29,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-20 11:24:29,397 INFO L276 IsEmpty]: Start isEmpty. Operand 28318 states and 37086 transitions. [2023-12-20 11:24:29,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-20 11:24:29,413 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:24:29,413 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:24:29,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-20 11:24:29,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:29,618 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:24:29,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:24:29,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1568094184, now seen corresponding path program 1 times [2023-12-20 11:24:29,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:24:29,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524358698] [2023-12-20 11:24:29,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:29,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:24:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:29,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:24:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:29,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:24:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:29,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:24:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:29,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:24:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:29,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:24:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:29,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 11:24:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:29,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 11:24:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:29,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:29,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-20 11:24:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:29,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:29,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-12-20 11:24:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-20 11:24:29,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:24:29,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524358698] [2023-12-20 11:24:29,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524358698] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:24:29,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295937244] [2023-12-20 11:24:29,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:29,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:29,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:24:29,742 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:24:29,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-20 11:24:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:29,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 11:24:29,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:24:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-20 11:24:29,878 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:24:29,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295937244] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:24:29,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:24:29,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 11:24:29,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586506507] [2023-12-20 11:24:29,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:24:29,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:24:29,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:24:29,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:24:29,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:24:29,880 INFO L87 Difference]: Start difference. First operand 28318 states and 37086 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-20 11:24:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:24:30,697 INFO L93 Difference]: Finished difference Result 46898 states and 62316 transitions. [2023-12-20 11:24:30,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:24:30,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 150 [2023-12-20 11:24:30,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:24:30,763 INFO L225 Difference]: With dead ends: 46898 [2023-12-20 11:24:30,763 INFO L226 Difference]: Without dead ends: 28390 [2023-12-20 11:24:30,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 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-20 11:24:30,799 INFO L413 NwaCegarLoop]: 4252 mSDtfsCounter, 129 mSDsluCounter, 4105 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 8357 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:24:30,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 8357 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:24:30,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28390 states. [2023-12-20 11:24:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28390 to 28318. [2023-12-20 11:24:31,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28318 states, 24319 states have (on average 1.2725029812081088) internal successors, (30946), 24814 states have internal predecessors, (30946), 1933 states have call successors, (1933), 1481 states have call predecessors, (1933), 2064 states have return successors, (3537), 2030 states have call predecessors, (3537), 1931 states have call successors, (3537) [2023-12-20 11:24:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28318 states to 28318 states and 36416 transitions. [2023-12-20 11:24:31,830 INFO L78 Accepts]: Start accepts. Automaton has 28318 states and 36416 transitions. Word has length 150 [2023-12-20 11:24:31,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:24:31,830 INFO L495 AbstractCegarLoop]: Abstraction has 28318 states and 36416 transitions. [2023-12-20 11:24:31,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-20 11:24:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 28318 states and 36416 transitions. [2023-12-20 11:24:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-20 11:24:31,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:24:31,846 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:24:31,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-20 11:24:32,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-20 11:24:32,051 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:24:32,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:24:32,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1798513045, now seen corresponding path program 1 times [2023-12-20 11:24:32,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:24:32,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392386804] [2023-12-20 11:24:32,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:32,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:24:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:32,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:24:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:32,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:24:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:32,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:24:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:32,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:24:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:32,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:24:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:32,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 11:24:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:32,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 11:24:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:32,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:32,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 11:24:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:32,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-12-20 11:24:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-20 11:24:32,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:24:32,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392386804] [2023-12-20 11:24:32,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392386804] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:24:32,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324375206] [2023-12-20 11:24:32,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:32,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:32,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:24:32,153 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:24:32,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-20 11:24:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:32,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 11:24:32,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:24:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-20 11:24:32,270 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:24:32,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324375206] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:24:32,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:24:32,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-12-20 11:24:32,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034491667] [2023-12-20 11:24:32,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:24:32,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 11:24:32,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:24:32,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 11:24:32,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:24:32,272 INFO L87 Difference]: Start difference. First operand 28318 states and 36416 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-20 11:24:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:24:33,058 INFO L93 Difference]: Finished difference Result 41138 states and 53439 transitions. [2023-12-20 11:24:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 11:24:33,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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 151 [2023-12-20 11:24:33,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:24:33,114 INFO L225 Difference]: With dead ends: 41138 [2023-12-20 11:24:33,114 INFO L226 Difference]: Without dead ends: 28366 [2023-12-20 11:24:33,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 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-20 11:24:33,140 INFO L413 NwaCegarLoop]: 4231 mSDtfsCounter, 147 mSDsluCounter, 4094 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 8325 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:24:33,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 8325 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:24:33,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28366 states. [2023-12-20 11:24:33,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28366 to 28318. [2023-12-20 11:24:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28318 states, 24319 states have (on average 1.262058472799046) internal successors, (30692), 24814 states have internal predecessors, (30692), 1933 states have call successors, (1933), 1481 states have call predecessors, (1933), 2064 states have return successors, (3537), 2030 states have call predecessors, (3537), 1931 states have call successors, (3537) [2023-12-20 11:24:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28318 states to 28318 states and 36162 transitions. [2023-12-20 11:24:34,241 INFO L78 Accepts]: Start accepts. Automaton has 28318 states and 36162 transitions. Word has length 151 [2023-12-20 11:24:34,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:24:34,241 INFO L495 AbstractCegarLoop]: Abstraction has 28318 states and 36162 transitions. [2023-12-20 11:24:34,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-20 11:24:34,242 INFO L276 IsEmpty]: Start isEmpty. Operand 28318 states and 36162 transitions. [2023-12-20 11:24:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-20 11:24:34,256 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:24:34,256 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:24:34,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-20 11:24:34,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:34,461 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:24:34,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:24:34,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1582730188, now seen corresponding path program 1 times [2023-12-20 11:24:34,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:24:34,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072294968] [2023-12-20 11:24:34,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:34,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:24:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:34,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:24:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:34,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:24:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:34,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:24:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:34,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:24:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:34,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:24:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:34,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 11:24:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:34,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 11:24:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:34,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:34,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 11:24:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:34,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:34,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-20 11:24:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-20 11:24:34,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:24:34,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072294968] [2023-12-20 11:24:34,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072294968] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:24:34,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154360507] [2023-12-20 11:24:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:34,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:34,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:24:34,598 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:24:34,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-20 11:24:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:34,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 11:24:34,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:24:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-20 11:24:34,766 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:24:34,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154360507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:24:34,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:24:34,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2023-12-20 11:24:34,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133599238] [2023-12-20 11:24:34,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:24:34,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 11:24:34,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:24:34,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 11:24:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-20 11:24:34,767 INFO L87 Difference]: Start difference. First operand 28318 states and 36162 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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-20 11:24:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:24:35,599 INFO L93 Difference]: Finished difference Result 38032 states and 48443 transitions. [2023-12-20 11:24:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 11:24:35,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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 152 [2023-12-20 11:24:35,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:24:35,638 INFO L225 Difference]: With dead ends: 38032 [2023-12-20 11:24:35,638 INFO L226 Difference]: Without dead ends: 20889 [2023-12-20 11:24:35,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 171 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-20 11:24:35,657 INFO L413 NwaCegarLoop]: 4060 mSDtfsCounter, 4135 mSDsluCounter, 8070 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4144 SdHoareTripleChecker+Valid, 12130 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 11:24:35,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4144 Valid, 12130 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 11:24:35,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20889 states. [2023-12-20 11:24:36,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20889 to 20829. [2023-12-20 11:24:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20829 states, 17990 states have (on average 1.2656475819899944) internal successors, (22769), 18318 states have internal predecessors, (22769), 1389 states have call successors, (1389), 1057 states have call predecessors, (1389), 1448 states have return successors, (2451), 1457 states have call predecessors, (2451), 1387 states have call successors, (2451) [2023-12-20 11:24:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20829 states to 20829 states and 26609 transitions. [2023-12-20 11:24:36,310 INFO L78 Accepts]: Start accepts. Automaton has 20829 states and 26609 transitions. Word has length 152 [2023-12-20 11:24:36,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:24:36,310 INFO L495 AbstractCegarLoop]: Abstraction has 20829 states and 26609 transitions. [2023-12-20 11:24:36,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 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-20 11:24:36,310 INFO L276 IsEmpty]: Start isEmpty. Operand 20829 states and 26609 transitions. [2023-12-20 11:24:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-20 11:24:36,319 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:24:36,319 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:24:36,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-20 11:24:36,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:36,523 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:24:36,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:24:36,523 INFO L85 PathProgramCache]: Analyzing trace with hash 144414774, now seen corresponding path program 1 times [2023-12-20 11:24:36,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:24:36,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829741225] [2023-12-20 11:24:36,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:36,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:24:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:36,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:24:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:36,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:24:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:36,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:24:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:36,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:24:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:36,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:24:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:36,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 11:24:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:36,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 11:24:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:36,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:36,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 11:24:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:36,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:36,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-20 11:24:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-20 11:24:36,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:24:36,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829741225] [2023-12-20 11:24:36,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829741225] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:24:36,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387553416] [2023-12-20 11:24:36,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:36,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:36,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:24:36,721 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:24:36,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-20 11:24:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:36,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 11:24:36,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:24:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-20 11:24:36,887 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:24:36,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387553416] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:24:36,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:24:36,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-20 11:24:36,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439756334] [2023-12-20 11:24:36,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:24:36,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 11:24:36,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:24:36,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 11:24:36,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:24:36,888 INFO L87 Difference]: Start difference. First operand 20829 states and 26609 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-20 11:24:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:24:37,442 INFO L93 Difference]: Finished difference Result 33378 states and 42274 transitions. [2023-12-20 11:24:37,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 11:24:37,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 152 [2023-12-20 11:24:37,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:24:37,472 INFO L225 Difference]: With dead ends: 33378 [2023-12-20 11:24:37,472 INFO L226 Difference]: Without dead ends: 14679 [2023-12-20 11:24:37,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 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-20 11:24:37,500 INFO L413 NwaCegarLoop]: 4114 mSDtfsCounter, 20 mSDsluCounter, 8220 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 12334 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:24:37,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 12334 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:24:37,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14679 states. [2023-12-20 11:24:38,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14679 to 14407. [2023-12-20 11:24:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14407 states, 12459 states have (on average 1.2823661610081065) internal successors, (15977), 12670 states have internal predecessors, (15977), 958 states have call successors, (958), 737 states have call predecessors, (958), 988 states have return successors, (1535), 1001 states have call predecessors, (1535), 956 states have call successors, (1535) [2023-12-20 11:24:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14407 states to 14407 states and 18470 transitions. [2023-12-20 11:24:38,046 INFO L78 Accepts]: Start accepts. Automaton has 14407 states and 18470 transitions. Word has length 152 [2023-12-20 11:24:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:24:38,047 INFO L495 AbstractCegarLoop]: Abstraction has 14407 states and 18470 transitions. [2023-12-20 11:24:38,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-20 11:24:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 14407 states and 18470 transitions. [2023-12-20 11:24:38,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-20 11:24:38,052 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:24:38,052 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:24:38,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-12-20 11:24:38,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-20 11:24:38,257 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:24:38,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:24:38,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1639614776, now seen corresponding path program 1 times [2023-12-20 11:24:38,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:24:38,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399569797] [2023-12-20 11:24:38,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:38,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:24:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:38,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:24:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:38,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:24:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:38,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:24:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:38,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:24:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:38,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:24:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:38,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 11:24:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:38,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 11:24:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:38,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:38,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 11:24:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:38,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:38,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-20 11:24:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-20 11:24:38,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:24:38,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399569797] [2023-12-20 11:24:38,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399569797] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:24:38,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288020209] [2023-12-20 11:24:38,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:38,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:38,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:24:38,322 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:24:38,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-20 11:24:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:38,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 11:24:38,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:24:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-20 11:24:38,421 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:24:38,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288020209] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:24:38,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:24:38,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-20 11:24:38,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528310938] [2023-12-20 11:24:38,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:24:38,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 11:24:38,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:24:38,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 11:24:38,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:24:38,423 INFO L87 Difference]: Start difference. First operand 14407 states and 18470 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-20 11:24:38,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:24:38,779 INFO L93 Difference]: Finished difference Result 24567 states and 30849 transitions. [2023-12-20 11:24:38,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 11:24:38,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 152 [2023-12-20 11:24:38,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:24:38,804 INFO L225 Difference]: With dead ends: 24567 [2023-12-20 11:24:38,804 INFO L226 Difference]: Without dead ends: 12290 [2023-12-20 11:24:38,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 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-20 11:24:38,822 INFO L413 NwaCegarLoop]: 4113 mSDtfsCounter, 11 mSDsluCounter, 8220 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12333 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:24:38,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12333 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:24:38,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12290 states. [2023-12-20 11:24:39,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12290 to 12266. [2023-12-20 11:24:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12266 states, 10627 states have (on average 1.2867224992942505) internal successors, (13674), 10788 states have internal predecessors, (13674), 815 states have call successors, (815), 621 states have call predecessors, (815), 822 states have return successors, (1201), 858 states have call predecessors, (1201), 813 states have call successors, (1201) [2023-12-20 11:24:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12266 states to 12266 states and 15690 transitions. [2023-12-20 11:24:39,380 INFO L78 Accepts]: Start accepts. Automaton has 12266 states and 15690 transitions. Word has length 152 [2023-12-20 11:24:39,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:24:39,380 INFO L495 AbstractCegarLoop]: Abstraction has 12266 states and 15690 transitions. [2023-12-20 11:24:39,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-20 11:24:39,381 INFO L276 IsEmpty]: Start isEmpty. Operand 12266 states and 15690 transitions. [2023-12-20 11:24:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-20 11:24:39,385 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:24:39,386 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:24:39,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-12-20 11:24:39,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:39,593 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:24:39,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:24:39,593 INFO L85 PathProgramCache]: Analyzing trace with hash -75876666, now seen corresponding path program 1 times [2023-12-20 11:24:39,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:24:39,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688191994] [2023-12-20 11:24:39,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:39,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:24:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:39,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:24:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:39,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:24:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:39,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:24:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:39,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:24:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:39,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:24:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:39,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 11:24:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:39,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 11:24:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:39,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:39,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 11:24:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:39,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:39,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-20 11:24:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-12-20 11:24:39,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:24:39,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688191994] [2023-12-20 11:24:39,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688191994] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 11:24:39,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231551012] [2023-12-20 11:24:39,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:39,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:39,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 11:24:39,692 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 11:24:39,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-20 11:24:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:39,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 11:24:39,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 11:24:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2023-12-20 11:24:39,779 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 11:24:39,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231551012] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:24:39,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 11:24:39,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-12-20 11:24:39,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255105516] [2023-12-20 11:24:39,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:24:39,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 11:24:39,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:24:39,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 11:24:39,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:24:39,780 INFO L87 Difference]: Start difference. First operand 12266 states and 15690 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (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-20 11:24:39,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:24:39,983 INFO L93 Difference]: Finished difference Result 17195 states and 21461 transitions. [2023-12-20 11:24:39,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 11:24:39,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (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 152 [2023-12-20 11:24:39,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:24:39,990 INFO L225 Difference]: With dead ends: 17195 [2023-12-20 11:24:39,990 INFO L226 Difference]: Without dead ends: 5187 [2023-12-20 11:24:40,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 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-20 11:24:40,001 INFO L413 NwaCegarLoop]: 4113 mSDtfsCounter, 2 mSDsluCounter, 8221 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12334 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 11:24:40,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12334 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 11:24:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5187 states. [2023-12-20 11:24:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5187 to 5187. [2023-12-20 11:24:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5187 states, 4691 states have (on average 1.4523555745043701) internal successors, (6813), 4714 states have internal predecessors, (6813), 278 states have call successors, (278), 201 states have call predecessors, (278), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2023-12-20 11:24:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5187 states to 5187 states and 7392 transitions. [2023-12-20 11:24:40,131 INFO L78 Accepts]: Start accepts. Automaton has 5187 states and 7392 transitions. Word has length 152 [2023-12-20 11:24:40,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:24:40,131 INFO L495 AbstractCegarLoop]: Abstraction has 5187 states and 7392 transitions. [2023-12-20 11:24:40,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (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-20 11:24:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 5187 states and 7392 transitions. [2023-12-20 11:24:40,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-12-20 11:24:40,133 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:24:40,134 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:24:40,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-12-20 11:24:40,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 11:24:40,338 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:24:40,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:24:40,338 INFO L85 PathProgramCache]: Analyzing trace with hash -633536807, now seen corresponding path program 1 times [2023-12-20 11:24:40,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:24:40,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779341023] [2023-12-20 11:24:40,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:40,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:24:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:40,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:24:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:40,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:24:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:40,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:24:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:40,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:24:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:40,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:24:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:40,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 11:24:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:40,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 11:24:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:40,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:40,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 11:24:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:40,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:40,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 11:24:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:40,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:40,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 11:24:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:40,480 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-20 11:24:40,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:24:40,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779341023] [2023-12-20 11:24:40,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779341023] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:24:40,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:24:40,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 11:24:40,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498500203] [2023-12-20 11:24:40,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:24:40,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 11:24:40,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:24:40,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 11:24:40,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-20 11:24:40,482 INFO L87 Difference]: Start difference. First operand 5187 states and 7392 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-20 11:24:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:24:41,279 INFO L93 Difference]: Finished difference Result 5405 states and 7617 transitions. [2023-12-20 11:24:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 11:24:41,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 184 [2023-12-20 11:24:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:24:41,285 INFO L225 Difference]: With dead ends: 5405 [2023-12-20 11:24:41,286 INFO L226 Difference]: Without dead ends: 5402 [2023-12-20 11:24:41,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-12-20 11:24:41,286 INFO L413 NwaCegarLoop]: 4152 mSDtfsCounter, 4609 mSDsluCounter, 16304 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4642 SdHoareTripleChecker+Valid, 20456 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-20 11:24:41,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4642 Valid, 20456 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-20 11:24:41,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2023-12-20 11:24:41,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5186. [2023-12-20 11:24:41,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 4691 states have (on average 1.4515028778512045) internal successors, (6809), 4713 states have internal predecessors, (6809), 277 states have call successors, (277), 201 states have call predecessors, (277), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2023-12-20 11:24:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7387 transitions. [2023-12-20 11:24:41,422 INFO L78 Accepts]: Start accepts. Automaton has 5186 states and 7387 transitions. Word has length 184 [2023-12-20 11:24:41,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:24:41,423 INFO L495 AbstractCegarLoop]: Abstraction has 5186 states and 7387 transitions. [2023-12-20 11:24:41,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 5 states have internal predecessors, (104), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-20 11:24:41,423 INFO L276 IsEmpty]: Start isEmpty. Operand 5186 states and 7387 transitions. [2023-12-20 11:24:41,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-12-20 11:24:41,425 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:24:41,425 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:24:41,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-20 11:24:41,426 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:24:41,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:24:41,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1918634495, now seen corresponding path program 1 times [2023-12-20 11:24:41,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:24:41,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750386136] [2023-12-20 11:24:41,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:41,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:24:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:41,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 11:24:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:41,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-20 11:24:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:41,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 11:24:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:41,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 11:24:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:41,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 11:24:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:41,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 11:24:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:41,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 11:24:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:41,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:41,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 11:24:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:41,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:41,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-12-20 11:24:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:41,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-12-20 11:24:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:41,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 11:24:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 11:24:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-20 11:24:41,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 11:24:41,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750386136] [2023-12-20 11:24:41,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750386136] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 11:24:41,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 11:24:41,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 11:24:41,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677692577] [2023-12-20 11:24:41,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 11:24:41,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 11:24:41,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 11:24:41,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 11:24:41,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 11:24:41,484 INFO L87 Difference]: Start difference. First operand 5186 states and 7387 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-20 11:24:41,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 11:24:41,814 INFO L93 Difference]: Finished difference Result 6694 states and 9047 transitions. [2023-12-20 11:24:41,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 11:24:41,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 188 [2023-12-20 11:24:41,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 11:24:41,822 INFO L225 Difference]: With dead ends: 6694 [2023-12-20 11:24:41,822 INFO L226 Difference]: Without dead ends: 5422 [2023-12-20 11:24:41,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-20 11:24:41,824 INFO L413 NwaCegarLoop]: 4061 mSDtfsCounter, 133 mSDsluCounter, 12059 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 16120 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 11:24:41,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 16120 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 11:24:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5422 states. [2023-12-20 11:24:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5422 to 5190. [2023-12-20 11:24:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 4695 states have (on average 1.4511182108626197) internal successors, (6813), 4717 states have internal predecessors, (6813), 277 states have call successors, (277), 201 states have call predecessors, (277), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2023-12-20 11:24:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 7391 transitions. [2023-12-20 11:24:41,965 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 7391 transitions. Word has length 188 [2023-12-20 11:24:41,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 11:24:41,966 INFO L495 AbstractCegarLoop]: Abstraction has 5190 states and 7391 transitions. [2023-12-20 11:24:41,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-20 11:24:41,966 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 7391 transitions. [2023-12-20 11:24:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-12-20 11:24:41,968 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 11:24:41,968 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 11:24:41,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-20 11:24:41,969 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 11:24:41,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 11:24:41,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1881060228, now seen corresponding path program 1 times [2023-12-20 11:24:41,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 11:24:41,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640617629] [2023-12-20 11:24:41,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 11:24:41,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 11:24:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 11:24:41,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 11:24:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 11:24:42,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 11:24:42,035 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 11:24:42,036 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-20 11:24:42,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-20 11:24:42,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-20 11:24:42,039 INFO L445 BasicCegarLoop]: Path program 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] [2023-12-20 11:24:42,041 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 11:24:42,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 11:24:42 BoogieIcfgContainer [2023-12-20 11:24:42,128 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 11:24:42,128 INFO L158 Benchmark]: Toolchain (without parser) took 67806.03ms. Allocated memory was 317.7MB in the beginning and 7.4GB in the end (delta: 7.1GB). Free memory was 240.4MB in the beginning and 4.8GB in the end (delta: -4.6GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2023-12-20 11:24:42,128 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 249.6MB. Free memory is still 200.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 11:24:42,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2308.24ms. Allocated memory is still 317.7MB. Free memory was 240.4MB in the beginning and 157.6MB in the end (delta: 82.8MB). Peak memory consumption was 122.3MB. Max. memory is 8.0GB. [2023-12-20 11:24:42,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 392.97ms. Allocated memory was 317.7MB in the beginning and 597.7MB in the end (delta: 280.0MB). Free memory was 157.6MB in the beginning and 444.9MB in the end (delta: -287.3MB). Peak memory consumption was 72.4MB. Max. memory is 8.0GB. [2023-12-20 11:24:42,128 INFO L158 Benchmark]: Boogie Preprocessor took 619.09ms. Allocated memory is still 597.7MB. Free memory was 444.9MB in the beginning and 432.3MB in the end (delta: 12.6MB). Peak memory consumption was 83.9MB. Max. memory is 8.0GB. [2023-12-20 11:24:42,129 INFO L158 Benchmark]: RCFGBuilder took 5582.84ms. Allocated memory was 597.7MB in the beginning and 1.8GB in the end (delta: 1.2GB). Free memory was 432.3MB in the beginning and 1.5GB in the end (delta: -1.1GB). Peak memory consumption was 341.8MB. Max. memory is 8.0GB. [2023-12-20 11:24:42,129 INFO L158 Benchmark]: TraceAbstraction took 58896.58ms. Allocated memory was 1.8GB in the beginning and 7.4GB in the end (delta: 5.6GB). Free memory was 1.5GB in the beginning and 4.8GB in the end (delta: -3.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2023-12-20 11:24:42,129 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 249.6MB. Free memory is still 200.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2308.24ms. Allocated memory is still 317.7MB. Free memory was 240.4MB in the beginning and 157.6MB in the end (delta: 82.8MB). Peak memory consumption was 122.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 392.97ms. Allocated memory was 317.7MB in the beginning and 597.7MB in the end (delta: 280.0MB). Free memory was 157.6MB in the beginning and 444.9MB in the end (delta: -287.3MB). Peak memory consumption was 72.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 619.09ms. Allocated memory is still 597.7MB. Free memory was 444.9MB in the beginning and 432.3MB in the end (delta: 12.6MB). Peak memory consumption was 83.9MB. Max. memory is 8.0GB. * RCFGBuilder took 5582.84ms. Allocated memory was 597.7MB in the beginning and 1.8GB in the end (delta: 1.2GB). Free memory was 432.3MB in the beginning and 1.5GB in the end (delta: -1.1GB). Peak memory consumption was 341.8MB. Max. memory is 8.0GB. * TraceAbstraction took 58896.58ms. Allocated memory was 1.8GB in the beginning and 7.4GB in the end (delta: 5.6GB). Free memory was 1.5GB in the beginning and 4.8GB in the end (delta: -3.3GB). Peak memory consumption was 2.3GB. 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 t2_pc = 0; [L11180] int m_st ; [L11181] int t1_st ; [L11182] int t2_st ; [L11183] int m_i ; [L11184] int t1_i ; [L11185] int t2_i ; [L11186] int M_E = 2; [L11187] int T1_E = 2; [L11188] int T2_E = 2; [L11189] int E_M = 2; [L11190] int E_1 = 2; [L11191] int E_2 = 2; [L11196] int token ; [L11198] int local ; [L11776] COND FALSE !(__VERIFIER_nondet_int()) [L11779] CALL main2() [L11763] int __retres1 ; [L11767] CALL init_model() [L11677] m_i = 1 [L11678] t1_i = 1 [L11679] t2_i = 1 [L11767] RET init_model() [L11768] CALL start_simulation() [L11704] int kernel_st ; [L11705] int tmp ; [L11706] int tmp___0 ; [L11710] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11711] FCALL update_channels() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11712] CALL init_threads() [L11396] COND TRUE m_i == 1 [L11397] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11401] COND TRUE t1_i == 1 [L11402] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11406] COND TRUE t2_i == 1 [L11407] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11712] RET init_threads() [L11713] CALL fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11509] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11514] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11519] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11524] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11529] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11534] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11713] RET fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11714] CALL activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11341] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11343] return (__retres1); [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11350] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11360] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11362] return (__retres1); [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11369] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11379] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11381] return (__retres1); [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_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, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L11714] RET activate_threads() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11715] CALL reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11547] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11552] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11557] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11562] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11567] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11572] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11715] RET reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11718] COND TRUE 1 [L11721] kernel_st = 1 [L11722] CALL eval() [L11442] int tmp ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11446] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11416] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11437] return (__retres1); [L11449] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L11456-L11467] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE, EXPR \read(tmp_ndt_2) [L11475] EXPR t1_st = 1 [L11476] CALL, EXPR transmit1() [L11259] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11270] COND TRUE 1 [L11272] t1_pc = 1 [L11273] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, token=0] [L11476] RET, EXPR transmit1() [L11470-L11481] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE, EXPR \read(tmp_ndt_3) [L11489] EXPR t2_st = 1 [L11490] CALL, EXPR transmit2() [L11295] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=0, t2_st=1, token=0] [L11306] COND TRUE 1 [L11308] t2_pc = 1 [L11309] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11490] RET, EXPR transmit2() [L11484-L11495] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L11446] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L11449] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11416] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11437] return (__retres1); [L11449] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE, EXPR \read(tmp_ndt_1) [L11461] EXPR m_st = 1 [L11462] CALL, EXPR master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11214] COND TRUE 1 [L11217] token = __VERIFIER_nondet_int() [L11218] local = token [L11219] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11220] CALL immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11620] CALL activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11331] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11341] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11343] return (__retres1); [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11350] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11351] COND TRUE E_1 == 1 [L11352] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11362] return (__retres1); [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND TRUE \read(tmp___0) [L11599] t1_st = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11369] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11370] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11379] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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=0, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11381] return (__retres1); [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L11620] RET activate_threads() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_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, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11220] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11221] E_1 = 2 [L11222] m_pc = 1 [L11223] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L11462] RET, EXPR master() [L11456-L11467] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=0] [L11470] COND TRUE t1_st == 0 [L11471] int tmp_ndt_2; [L11472] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11473] COND TRUE, EXPR \read(tmp_ndt_2) [L11475] EXPR t1_st = 1 [L11476] CALL, EXPR transmit1() [L11259] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, token=0] [L11262] COND TRUE t1_pc == 1 [L11278] token += 1 [L11279] E_2 = 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11280] CALL immediate_notify() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11620] CALL activate_threads() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11331] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11332] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11341] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11343] return (__retres1); [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11350] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11351] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11360] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11362] return (__retres1); [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11369] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11370] COND TRUE E_2 == 1 [L11371] __retres1 = 1 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, token=1] [L11381] return (__retres1); [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND TRUE \read(tmp___1) [L11607] t2_st = 0 VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L11620] RET activate_threads() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_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=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11280] RET immediate_notify() VAL [E_1=2, E_2=1, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11281] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11270] COND TRUE 1 [L11272] t1_pc = 1 [L11273] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L11476] RET, EXPR transmit1() [L11470-L11481] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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=2, t2_i=1, t2_pc=1, t2_st=0, tmp=1, token=1] [L11484] COND TRUE t2_st == 0 [L11485] int tmp_ndt_3; [L11486] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L11487] COND TRUE, EXPR \read(tmp_ndt_3) [L11489] EXPR t2_st = 1 [L11490] CALL, EXPR transmit2() [L11295] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L11298] COND TRUE t2_pc == 1 [L11314] token += 1 [L11315] E_M = 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_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=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11316] CALL immediate_notify() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_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=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11620] CALL activate_threads() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_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=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11582] int tmp ; [L11583] int tmp___0 ; [L11584] int tmp___1 ; [L11588] CALL, EXPR is_master_triggered() [L11328] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_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=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11331] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_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=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11332] COND TRUE E_M == 1 [L11333] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_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=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11343] return (__retres1); [L11588] RET, EXPR is_master_triggered() [L11588] tmp = is_master_triggered() [L11590] COND TRUE \read(tmp) [L11591] m_st = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_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=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L11596] CALL, EXPR is_transmit1_triggered() [L11347] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_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=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11350] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_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=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11351] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_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=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11360] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_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=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11362] return (__retres1); [L11596] RET, EXPR is_transmit1_triggered() [L11596] tmp___0 = is_transmit1_triggered() [L11598] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_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=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L11604] CALL, EXPR is_transmit2_triggered() [L11366] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_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=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11369] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_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=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11370] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_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=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11379] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_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=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11381] return (__retres1); [L11604] RET, EXPR is_transmit2_triggered() [L11604] tmp___1 = is_transmit2_triggered() [L11606] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_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=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L11620] RET activate_threads() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_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=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11316] RET immediate_notify() VAL [E_1=2, E_2=2, E_M=1, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11317] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=1, token=2] [L11306] COND TRUE 1 [L11308] t2_pc = 1 [L11309] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11490] RET, EXPR transmit2() [L11484-L11495] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L11446] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L11449] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11416] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11419] COND TRUE m_st == 0 [L11420] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11437] return (__retres1); [L11449] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L11449] tmp = exists_runnable_thread() [L11451] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp=1, token=2] [L11456] COND TRUE m_st == 0 [L11457] int tmp_ndt_1; [L11458] tmp_ndt_1 = __VERIFIER_nondet_int() [L11459] COND TRUE \read(tmp_ndt_1) [L11461] m_st = 1 [L11462] CALL master() [L11201] int tmp_var = __VERIFIER_nondet_int(); [L11203] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11206] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11228] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11239] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11240] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11241] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L11242] CALL error() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, token=2] [L11173] reach_error() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_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, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 11118]: 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, 2249 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 58.8s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.6s, AutomataDifference: 26.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69527 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69380 mSDsluCounter, 316424 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200358 mSDsCounter, 603 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7889 IncrementalHoareTripleChecker+Invalid, 8492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 603 mSolverCounterUnsat, 116066 mSDtfsCounter, 7889 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3304 GetRequests, 3107 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50283occurred in iteration=14, InterpolantAutomatonStates: 168, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 21853 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 6329 NumberOfCodeBlocks, 6329 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 6094 ConstructedInterpolants, 0 QuantifiedInterpolants, 9640 SizeOfPredicates, 3 NumberOfNonLiveVariables, 9227 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 46 InterpolantComputations, 28 PerfectInterpolantSequences, 3042/3482 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-20 11:24:42,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...