/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/systemc/bist_cell.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 00:33:18,449 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 00:33:18,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 00:33:18,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 00:33:18,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 00:33:18,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 00:33:18,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 00:33:18,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 00:33:18,540 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 00:33:18,543 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 00:33:18,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 00:33:18,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 00:33:18,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 00:33:18,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 00:33:18,546 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 00:33:18,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 00:33:18,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 00:33:18,546 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 00:33:18,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 00:33:18,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 00:33:18,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 00:33:18,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 00:33:18,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 00:33:18,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 00:33:18,547 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 00:33:18,547 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 00:33:18,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 00:33:18,548 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 00:33:18,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 00:33:18,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 00:33:18,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 00:33:18,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 00:33:18,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 00:33:18,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 00:33:18,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 00:33:18,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 00:33:18,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 00:33:18,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 00:33:18,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 00:33:18,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 00:33:18,550 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 00:33:18,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 00:33:18,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 00:33:18,550 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-20 00:33:18,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 00:33:18,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 00:33:18,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 00:33:18,735 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 00:33:18,736 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 00:33:18,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/bist_cell.cil.c [2023-12-20 00:33:19,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 00:33:19,941 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 00:33:19,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c [2023-12-20 00:33:19,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f28b40bba/2ed738a649ef4035bc77d545e0d5d718/FLAG25422aaf6 [2023-12-20 00:33:19,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f28b40bba/2ed738a649ef4035bc77d545e0d5d718 [2023-12-20 00:33:19,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 00:33:19,967 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 00:33:19,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 00:33:19,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 00:33:19,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 00:33:19,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:33:19" (1/1) ... [2023-12-20 00:33:19,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391fd4c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:33:19, skipping insertion in model container [2023-12-20 00:33:19,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 12:33:19" (1/1) ... [2023-12-20 00:33:19,999 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 00:33:20,094 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c[639,652] [2023-12-20 00:33:20,124 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 00:33:20,131 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 00:33:20,138 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c[639,652] [2023-12-20 00:33:20,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 00:33:20,165 INFO L206 MainTranslator]: Completed translation [2023-12-20 00:33:20,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:33:20 WrapperNode [2023-12-20 00:33:20,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 00:33:20,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 00:33:20,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 00:33:20,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 00:33:20,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:33:20" (1/1) ... [2023-12-20 00:33:20,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:33:20" (1/1) ... [2023-12-20 00:33:20,192 INFO L138 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 229 [2023-12-20 00:33:20,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 00:33:20,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 00:33:20,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 00:33:20,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 00:33:20,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:33:20" (1/1) ... [2023-12-20 00:33:20,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:33:20" (1/1) ... [2023-12-20 00:33:20,201 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:33:20" (1/1) ... [2023-12-20 00:33:20,210 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 00:33:20,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:33:20" (1/1) ... [2023-12-20 00:33:20,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:33:20" (1/1) ... [2023-12-20 00:33:20,214 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:33:20" (1/1) ... [2023-12-20 00:33:20,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:33:20" (1/1) ... [2023-12-20 00:33:20,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:33:20" (1/1) ... [2023-12-20 00:33:20,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:33:20" (1/1) ... [2023-12-20 00:33:20,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 00:33:20,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 00:33:20,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 00:33:20,221 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 00:33:20,222 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:33:20" (1/1) ... [2023-12-20 00:33:20,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 00:33:20,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:20,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 00:33:20,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 00:33:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 00:33:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-20 00:33:20,270 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-20 00:33:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-20 00:33:20,270 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-20 00:33:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-20 00:33:20,270 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-20 00:33:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-20 00:33:20,271 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-20 00:33:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 00:33:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-20 00:33:20,271 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-20 00:33:20,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 00:33:20,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 00:33:20,368 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 00:33:20,370 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 00:33:20,566 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 00:33:20,599 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 00:33:20,599 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-20 00:33:20,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:33:20 BoogieIcfgContainer [2023-12-20 00:33:20,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 00:33:20,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 00:33:20,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 00:33:20,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 00:33:20,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 12:33:19" (1/3) ... [2023-12-20 00:33:20,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6516ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:33:20, skipping insertion in model container [2023-12-20 00:33:20,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 12:33:20" (2/3) ... [2023-12-20 00:33:20,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a6516ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 12:33:20, skipping insertion in model container [2023-12-20 00:33:20,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 12:33:20" (3/3) ... [2023-12-20 00:33:20,605 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2023-12-20 00:33:20,616 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 00:33:20,616 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 00:33:20,644 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 00:33:20,648 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;@4d8f01c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 00:33:20,649 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 00:33:20,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 71 states have (on average 1.676056338028169) internal successors, (119), 73 states have internal predecessors, (119), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-20 00:33:20,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-20 00:33:20,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:20,657 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] [2023-12-20 00:33:20,657 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:20,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1929751186, now seen corresponding path program 1 times [2023-12-20 00:33:20,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:20,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693956410] [2023-12-20 00:33:20,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:20,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:20,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:20,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 00:33:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:20,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:33:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:21,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 00:33:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 00:33:21,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:21,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693956410] [2023-12-20 00:33:21,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693956410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:21,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:33:21,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 00:33:21,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639029255] [2023-12-20 00:33:21,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:21,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 00:33:21,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:21,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 00:33:21,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-20 00:33:21,066 INFO L87 Difference]: Start difference. First operand has 88 states, 71 states have (on average 1.676056338028169) internal successors, (119), 73 states have internal predecessors, (119), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-20 00:33:21,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:21,694 INFO L93 Difference]: Finished difference Result 246 states and 393 transitions. [2023-12-20 00:33:21,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 00:33:21,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2023-12-20 00:33:21,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:21,702 INFO L225 Difference]: With dead ends: 246 [2023-12-20 00:33:21,702 INFO L226 Difference]: Without dead ends: 158 [2023-12-20 00:33:21,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-12-20 00:33:21,707 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 303 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:21,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 295 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 00:33:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-12-20 00:33:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 101. [2023-12-20 00:33:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.5952380952380953) internal successors, (134), 85 states have internal predecessors, (134), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-20 00:33:21,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2023-12-20 00:33:21,756 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 39 [2023-12-20 00:33:21,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:21,757 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2023-12-20 00:33:21,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-20 00:33:21,757 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2023-12-20 00:33:21,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-20 00:33:21,760 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:21,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:21,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 00:33:21,760 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:21,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:21,761 INFO L85 PathProgramCache]: Analyzing trace with hash -609134686, now seen corresponding path program 1 times [2023-12-20 00:33:21,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:21,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128808304] [2023-12-20 00:33:21,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:21,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:21,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:21,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:33:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:21,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 00:33:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:21,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 00:33:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:21,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 00:33:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:21,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 00:33:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:21,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-20 00:33:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:21,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 00:33:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:21,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 00:33:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:21,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 00:33:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-20 00:33:21,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:21,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128808304] [2023-12-20 00:33:21,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128808304] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:21,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032229250] [2023-12-20 00:33:21,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:21,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:21,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:21,948 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:21,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 00:33:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:22,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 00:33:22,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-20 00:33:22,115 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:22,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032229250] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:22,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:22,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-12-20 00:33:22,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510536752] [2023-12-20 00:33:22,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:22,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:33:22,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:22,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:33:22,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-20 00:33:22,117 INFO L87 Difference]: Start difference. First operand 101 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:22,158 INFO L93 Difference]: Finished difference Result 194 states and 298 transitions. [2023-12-20 00:33:22,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:33:22,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2023-12-20 00:33:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:22,159 INFO L225 Difference]: With dead ends: 194 [2023-12-20 00:33:22,160 INFO L226 Difference]: Without dead ends: 101 [2023-12-20 00:33:22,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-20 00:33:22,161 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:22,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 119 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:33:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-20 00:33:22,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-12-20 00:33:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.5833333333333333) internal successors, (133), 85 states have internal predecessors, (133), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-20 00:33:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 154 transitions. [2023-12-20 00:33:22,170 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 154 transitions. Word has length 92 [2023-12-20 00:33:22,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:22,170 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 154 transitions. [2023-12-20 00:33:22,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 154 transitions. [2023-12-20 00:33:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-20 00:33:22,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:22,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:22,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-20 00:33:22,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:22,378 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:22,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:22,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1751637152, now seen corresponding path program 1 times [2023-12-20 00:33:22,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:22,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411525352] [2023-12-20 00:33:22,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:22,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:22,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:22,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:33:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:22,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 00:33:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:22,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 00:33:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:22,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 00:33:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:22,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 00:33:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:22,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-20 00:33:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:22,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 00:33:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:22,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 00:33:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:22,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 00:33:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-20 00:33:22,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:22,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411525352] [2023-12-20 00:33:22,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411525352] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:22,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215892968] [2023-12-20 00:33:22,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:22,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:22,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:22,569 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:22,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-20 00:33:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:22,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 00:33:22,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-20 00:33:22,738 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:22,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215892968] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:22,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:22,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-12-20 00:33:22,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49811957] [2023-12-20 00:33:22,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:22,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:33:22,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:22,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:33:22,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:33:22,753 INFO L87 Difference]: Start difference. First operand 101 states and 154 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:22,903 INFO L93 Difference]: Finished difference Result 302 states and 471 transitions. [2023-12-20 00:33:22,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 00:33:22,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2023-12-20 00:33:22,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:22,909 INFO L225 Difference]: With dead ends: 302 [2023-12-20 00:33:22,909 INFO L226 Difference]: Without dead ends: 211 [2023-12-20 00:33:22,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-20 00:33:22,915 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 218 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:22,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 322 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:33:22,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-12-20 00:33:22,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 198. [2023-12-20 00:33:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 165 states have (on average 1.5757575757575757) internal successors, (260), 168 states have internal predecessors, (260), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (27), 20 states have call predecessors, (27), 19 states have call successors, (27) [2023-12-20 00:33:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 306 transitions. [2023-12-20 00:33:22,947 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 306 transitions. Word has length 92 [2023-12-20 00:33:22,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:22,948 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 306 transitions. [2023-12-20 00:33:22,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:22,948 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 306 transitions. [2023-12-20 00:33:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-20 00:33:22,953 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:22,953 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:22,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-20 00:33:23,158 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,SelfDestructingSolverStorable2 [2023-12-20 00:33:23,163 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:23,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:23,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1617302816, now seen corresponding path program 1 times [2023-12-20 00:33:23,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:23,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754330784] [2023-12-20 00:33:23,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:23,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:33:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 00:33:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 00:33:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 00:33:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 00:33:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-20 00:33:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 00:33:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 00:33:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 00:33:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,297 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-20 00:33:23,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:23,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754330784] [2023-12-20 00:33:23,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754330784] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:23,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7942060] [2023-12-20 00:33:23,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:23,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:23,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:23,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:23,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-20 00:33:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 00:33:23,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-20 00:33:23,449 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:23,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7942060] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:23,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:23,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-12-20 00:33:23,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140351201] [2023-12-20 00:33:23,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:23,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:33:23,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:23,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:33:23,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:33:23,452 INFO L87 Difference]: Start difference. First operand 198 states and 306 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:23,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:23,587 INFO L93 Difference]: Finished difference Result 593 states and 936 transitions. [2023-12-20 00:33:23,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 00:33:23,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2023-12-20 00:33:23,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:23,590 INFO L225 Difference]: With dead ends: 593 [2023-12-20 00:33:23,590 INFO L226 Difference]: Without dead ends: 409 [2023-12-20 00:33:23,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-20 00:33:23,593 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 215 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:23,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 314 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:33:23,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-12-20 00:33:23,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 395. [2023-12-20 00:33:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 328 states have (on average 1.5609756097560976) internal successors, (512), 337 states have internal predecessors, (512), 37 states have call successors, (37), 21 states have call predecessors, (37), 29 states have return successors, (71), 40 states have call predecessors, (71), 37 states have call successors, (71) [2023-12-20 00:33:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 620 transitions. [2023-12-20 00:33:23,635 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 620 transitions. Word has length 92 [2023-12-20 00:33:23,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:23,635 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 620 transitions. [2023-12-20 00:33:23,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:23,635 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 620 transitions. [2023-12-20 00:33:23,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-20 00:33:23,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:23,638 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:23,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:23,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:23,843 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:23,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:23,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1468221796, now seen corresponding path program 1 times [2023-12-20 00:33:23,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:23,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632537070] [2023-12-20 00:33:23,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:23,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:33:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 00:33:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 00:33:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 00:33:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 00:33:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-20 00:33:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 00:33:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:23,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 00:33:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:24,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 00:33:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-20 00:33:24,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:24,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632537070] [2023-12-20 00:33:24,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632537070] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:24,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362603731] [2023-12-20 00:33:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:24,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:24,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:24,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:24,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-20 00:33:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:24,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 00:33:24,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-20 00:33:24,165 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:24,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362603731] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:24,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:24,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-12-20 00:33:24,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5410535] [2023-12-20 00:33:24,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:24,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:33:24,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:24,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:33:24,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:33:24,167 INFO L87 Difference]: Start difference. First operand 395 states and 620 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:24,352 INFO L93 Difference]: Finished difference Result 1308 states and 2136 transitions. [2023-12-20 00:33:24,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 00:33:24,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2023-12-20 00:33:24,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:24,360 INFO L225 Difference]: With dead ends: 1308 [2023-12-20 00:33:24,360 INFO L226 Difference]: Without dead ends: 935 [2023-12-20 00:33:24,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-20 00:33:24,362 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 233 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:24,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 355 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:33:24,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2023-12-20 00:33:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 863. [2023-12-20 00:33:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 722 states have (on average 1.5401662049861495) internal successors, (1112), 749 states have internal predecessors, (1112), 73 states have call successors, (73), 41 states have call predecessors, (73), 67 states have return successors, (201), 80 states have call predecessors, (201), 73 states have call successors, (201) [2023-12-20 00:33:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1386 transitions. [2023-12-20 00:33:24,404 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1386 transitions. Word has length 92 [2023-12-20 00:33:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:24,404 INFO L495 AbstractCegarLoop]: Abstraction has 863 states and 1386 transitions. [2023-12-20 00:33:24,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1386 transitions. [2023-12-20 00:33:24,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-20 00:33:24,407 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:24,407 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] [2023-12-20 00:33:24,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:24,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:24,612 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:24,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:24,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2131635018, now seen corresponding path program 1 times [2023-12-20 00:33:24,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:24,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177371943] [2023-12-20 00:33:24,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:24,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:24,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:24,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:33:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:24,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 00:33:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:24,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:33:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:24,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 00:33:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:24,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 00:33:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:24,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 00:33:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:24,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-20 00:33:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:24,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 00:33:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:24,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 00:33:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-20 00:33:24,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:24,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177371943] [2023-12-20 00:33:24,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177371943] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:24,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072316963] [2023-12-20 00:33:24,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:24,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:24,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:24,706 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:24,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-20 00:33:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:24,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 00:33:24,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-20 00:33:24,845 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:24,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072316963] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:24,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:24,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-12-20 00:33:24,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909895544] [2023-12-20 00:33:24,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:24,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:33:24,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:24,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:33:24,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:33:24,847 INFO L87 Difference]: Start difference. First operand 863 states and 1386 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:25,008 INFO L93 Difference]: Finished difference Result 2816 states and 4760 transitions. [2023-12-20 00:33:25,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 00:33:25,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2023-12-20 00:33:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:25,029 INFO L225 Difference]: With dead ends: 2816 [2023-12-20 00:33:25,029 INFO L226 Difference]: Without dead ends: 1993 [2023-12-20 00:33:25,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-20 00:33:25,031 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 223 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:25,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 332 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:33:25,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2023-12-20 00:33:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1885. [2023-12-20 00:33:25,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1578 states have (on average 1.5158428390367553) internal successors, (2392), 1659 states have internal predecessors, (2392), 145 states have call successors, (145), 81 states have call predecessors, (145), 161 states have return successors, (611), 160 states have call predecessors, (611), 145 states have call successors, (611) [2023-12-20 00:33:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 3148 transitions. [2023-12-20 00:33:25,109 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 3148 transitions. Word has length 94 [2023-12-20 00:33:25,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:25,109 INFO L495 AbstractCegarLoop]: Abstraction has 1885 states and 3148 transitions. [2023-12-20 00:33:25,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 3148 transitions. [2023-12-20 00:33:25,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-20 00:33:25,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:25,116 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] [2023-12-20 00:33:25,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:25,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:25,321 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:25,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:25,321 INFO L85 PathProgramCache]: Analyzing trace with hash -86155466, now seen corresponding path program 1 times [2023-12-20 00:33:25,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:25,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838750350] [2023-12-20 00:33:25,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:25,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:25,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:25,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:33:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:25,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 00:33:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:25,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:33:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:25,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 00:33:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:25,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 00:33:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:25,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 00:33:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:25,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-20 00:33:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:25,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 00:33:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:25,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 00:33:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-20 00:33:25,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:25,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838750350] [2023-12-20 00:33:25,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838750350] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:25,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362461022] [2023-12-20 00:33:25,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:25,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:25,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:25,411 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:25,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-20 00:33:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:25,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-20 00:33:25,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 00:33:25,510 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:25,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362461022] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:25,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:25,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-12-20 00:33:25,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436549439] [2023-12-20 00:33:25,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:25,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 00:33:25,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:25,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 00:33:25,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-12-20 00:33:25,511 INFO L87 Difference]: Start difference. First operand 1885 states and 3148 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:25,599 INFO L93 Difference]: Finished difference Result 4002 states and 6653 transitions. [2023-12-20 00:33:25,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 00:33:25,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2023-12-20 00:33:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:25,606 INFO L225 Difference]: With dead ends: 4002 [2023-12-20 00:33:25,606 INFO L226 Difference]: Without dead ends: 2221 [2023-12-20 00:33:25,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-12-20 00:33:25,610 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 28 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:25,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 597 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:33:25,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2023-12-20 00:33:25,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 1949. [2023-12-20 00:33:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1626 states have (on average 1.5006150061500616) internal successors, (2440), 1707 states have internal predecessors, (2440), 145 states have call successors, (145), 81 states have call predecessors, (145), 177 states have return successors, (643), 176 states have call predecessors, (643), 145 states have call successors, (643) [2023-12-20 00:33:25,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 3228 transitions. [2023-12-20 00:33:25,708 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 3228 transitions. Word has length 94 [2023-12-20 00:33:25,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:25,708 INFO L495 AbstractCegarLoop]: Abstraction has 1949 states and 3228 transitions. [2023-12-20 00:33:25,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 3228 transitions. [2023-12-20 00:33:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-20 00:33:25,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:25,714 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:25,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:25,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:25,919 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:25,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1452184564, now seen corresponding path program 1 times [2023-12-20 00:33:25,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:25,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797442745] [2023-12-20 00:33:25,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:25,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:25,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:33:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 00:33:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:33:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 00:33:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 00:33:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 00:33:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-20 00:33:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 00:33:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 00:33:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,033 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-20 00:33:26,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:26,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797442745] [2023-12-20 00:33:26,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797442745] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:26,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058055319] [2023-12-20 00:33:26,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:26,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:26,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:26,034 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:26,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-20 00:33:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 00:33:26,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-20 00:33:26,144 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:26,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058055319] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:26,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:26,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-12-20 00:33:26,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340952826] [2023-12-20 00:33:26,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:26,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:33:26,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:26,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:33:26,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-20 00:33:26,145 INFO L87 Difference]: Start difference. First operand 1949 states and 3228 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 00:33:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:26,223 INFO L93 Difference]: Finished difference Result 4258 states and 7036 transitions. [2023-12-20 00:33:26,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:33:26,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 94 [2023-12-20 00:33:26,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:26,233 INFO L225 Difference]: With dead ends: 4258 [2023-12-20 00:33:26,233 INFO L226 Difference]: Without dead ends: 2413 [2023-12-20 00:33:26,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-20 00:33:26,236 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 56 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:26,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 228 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:33:26,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2023-12-20 00:33:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2233. [2023-12-20 00:33:26,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2233 states, 1814 states have (on average 1.456449834619625) internal successors, (2642), 1895 states have internal predecessors, (2642), 209 states have call successors, (209), 113 states have call predecessors, (209), 209 states have return successors, (788), 256 states have call predecessors, (788), 209 states have call successors, (788) [2023-12-20 00:33:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 3639 transitions. [2023-12-20 00:33:26,348 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 3639 transitions. Word has length 94 [2023-12-20 00:33:26,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:26,349 INFO L495 AbstractCegarLoop]: Abstraction has 2233 states and 3639 transitions. [2023-12-20 00:33:26,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 00:33:26,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 3639 transitions. [2023-12-20 00:33:26,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-20 00:33:26,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:26,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:26,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-20 00:33:26,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:26,560 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:26,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:26,560 INFO L85 PathProgramCache]: Analyzing trace with hash 236030838, now seen corresponding path program 1 times [2023-12-20 00:33:26,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:26,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112546214] [2023-12-20 00:33:26,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:26,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:33:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 00:33:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 00:33:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 00:33:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 00:33:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 00:33:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-20 00:33:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 00:33:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 00:33:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-20 00:33:26,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:26,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112546214] [2023-12-20 00:33:26,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112546214] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:26,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083917982] [2023-12-20 00:33:26,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:26,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:26,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:26,646 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:26,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-20 00:33:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:26,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-20 00:33:26,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-20 00:33:26,741 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:26,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083917982] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:26,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:26,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-12-20 00:33:26,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545556026] [2023-12-20 00:33:26,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:26,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:33:26,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:26,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:33:26,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:33:26,743 INFO L87 Difference]: Start difference. First operand 2233 states and 3639 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:26,834 INFO L93 Difference]: Finished difference Result 4334 states and 7049 transitions. [2023-12-20 00:33:26,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:33:26,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2023-12-20 00:33:26,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:26,842 INFO L225 Difference]: With dead ends: 4334 [2023-12-20 00:33:26,842 INFO L226 Difference]: Without dead ends: 2297 [2023-12-20 00:33:26,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:33:26,846 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:26,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 349 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:33:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2023-12-20 00:33:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2265. [2023-12-20 00:33:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 1846 states have (on average 1.448537378114843) internal successors, (2674), 1927 states have internal predecessors, (2674), 209 states have call successors, (209), 113 states have call predecessors, (209), 209 states have return successors, (788), 256 states have call predecessors, (788), 209 states have call successors, (788) [2023-12-20 00:33:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 3671 transitions. [2023-12-20 00:33:26,946 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 3671 transitions. Word has length 94 [2023-12-20 00:33:26,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:26,946 INFO L495 AbstractCegarLoop]: Abstraction has 2265 states and 3671 transitions. [2023-12-20 00:33:26,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 3671 transitions. [2023-12-20 00:33:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-20 00:33:26,953 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:26,953 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:26,972 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 00:33:27,158 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,SelfDestructingSolverStorable8 [2023-12-20 00:33:27,158 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:27,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:27,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1971241955, now seen corresponding path program 1 times [2023-12-20 00:33:27,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:27,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430599579] [2023-12-20 00:33:27,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:27,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:33:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 00:33:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-20 00:33:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:33:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-20 00:33:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 00:33:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-20 00:33:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 00:33:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 00:33:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-20 00:33:27,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:27,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430599579] [2023-12-20 00:33:27,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430599579] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:27,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129450356] [2023-12-20 00:33:27,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:27,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:27,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:27,261 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:27,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-20 00:33:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 00:33:27,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:27,355 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-20 00:33:27,355 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:27,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129450356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:27,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:27,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-12-20 00:33:27,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84467631] [2023-12-20 00:33:27,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:27,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:33:27,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:27,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:33:27,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-20 00:33:27,357 INFO L87 Difference]: Start difference. First operand 2265 states and 3671 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 00:33:27,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:27,429 INFO L93 Difference]: Finished difference Result 4634 states and 7890 transitions. [2023-12-20 00:33:27,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:33:27,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 96 [2023-12-20 00:33:27,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:27,463 INFO L225 Difference]: With dead ends: 4634 [2023-12-20 00:33:27,463 INFO L226 Difference]: Without dead ends: 2549 [2023-12-20 00:33:27,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-20 00:33:27,468 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 18 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:27,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 231 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:33:27,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2023-12-20 00:33:27,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2549. [2023-12-20 00:33:27,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2549 states, 2034 states have (on average 1.4267453294001966) internal successors, (2902), 2115 states have internal predecessors, (2902), 273 states have call successors, (273), 145 states have call predecessors, (273), 241 states have return successors, (1046), 320 states have call predecessors, (1046), 273 states have call successors, (1046) [2023-12-20 00:33:27,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 4221 transitions. [2023-12-20 00:33:27,556 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 4221 transitions. Word has length 96 [2023-12-20 00:33:27,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:27,556 INFO L495 AbstractCegarLoop]: Abstraction has 2549 states and 4221 transitions. [2023-12-20 00:33:27,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 00:33:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 4221 transitions. [2023-12-20 00:33:27,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-20 00:33:27,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:27,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:27,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:27,768 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,SelfDestructingSolverStorable9 [2023-12-20 00:33:27,768 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:27,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:27,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1181222875, now seen corresponding path program 1 times [2023-12-20 00:33:27,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:27,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956897744] [2023-12-20 00:33:27,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:27,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:33:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 00:33:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-20 00:33:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:33:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-20 00:33:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 00:33:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-20 00:33:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 00:33:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 00:33:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,855 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-20 00:33:27,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:27,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956897744] [2023-12-20 00:33:27,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956897744] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:27,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806351841] [2023-12-20 00:33:27,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:27,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:27,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:27,857 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:27,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-20 00:33:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:27,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 00:33:27,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 00:33:27,990 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:27,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806351841] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:27,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:27,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-20 00:33:27,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676765731] [2023-12-20 00:33:27,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:27,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:33:27,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:27,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:33:27,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:33:27,991 INFO L87 Difference]: Start difference. First operand 2549 states and 4221 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 00:33:28,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:28,283 INFO L93 Difference]: Finished difference Result 7898 states and 13749 transitions. [2023-12-20 00:33:28,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 00:33:28,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 96 [2023-12-20 00:33:28,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:28,310 INFO L225 Difference]: With dead ends: 7898 [2023-12-20 00:33:28,310 INFO L226 Difference]: Without dead ends: 5577 [2023-12-20 00:33:28,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-20 00:33:28,317 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 183 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:28,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 576 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:33:28,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5577 states. [2023-12-20 00:33:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5577 to 5493. [2023-12-20 00:33:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5493 states, 4456 states have (on average 1.4254937163375225) internal successors, (6352), 4723 states have internal predecessors, (6352), 481 states have call successors, (481), 257 states have call predecessors, (481), 555 states have return successors, (2556), 576 states have call predecessors, (2556), 481 states have call successors, (2556) [2023-12-20 00:33:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5493 states to 5493 states and 9389 transitions. [2023-12-20 00:33:28,683 INFO L78 Accepts]: Start accepts. Automaton has 5493 states and 9389 transitions. Word has length 96 [2023-12-20 00:33:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:28,684 INFO L495 AbstractCegarLoop]: Abstraction has 5493 states and 9389 transitions. [2023-12-20 00:33:28,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 00:33:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5493 states and 9389 transitions. [2023-12-20 00:33:28,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-20 00:33:28,710 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:28,710 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:28,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:28,916 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,SelfDestructingSolverStorable10 [2023-12-20 00:33:28,917 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:28,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:28,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1860495129, now seen corresponding path program 1 times [2023-12-20 00:33:28,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:28,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135157355] [2023-12-20 00:33:28,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:28,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:28,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:29,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 00:33:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:29,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 00:33:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:29,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-20 00:33:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:29,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 00:33:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:29,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-20 00:33:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:29,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-20 00:33:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:29,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-20 00:33:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:29,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 00:33:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:29,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 00:33:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-20 00:33:29,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:29,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135157355] [2023-12-20 00:33:29,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135157355] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:29,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615480174] [2023-12-20 00:33:29,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:29,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:29,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:29,049 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:29,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-20 00:33:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:29,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 00:33:29,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-20 00:33:29,169 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:29,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615480174] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:29,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:29,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-12-20 00:33:29,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131894436] [2023-12-20 00:33:29,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:29,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:33:29,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:29,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:33:29,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:33:29,171 INFO L87 Difference]: Start difference. First operand 5493 states and 9389 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:29,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:29,472 INFO L93 Difference]: Finished difference Result 11994 states and 20213 transitions. [2023-12-20 00:33:29,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 00:33:29,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96 [2023-12-20 00:33:29,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:29,508 INFO L225 Difference]: With dead ends: 11994 [2023-12-20 00:33:29,508 INFO L226 Difference]: Without dead ends: 6727 [2023-12-20 00:33:29,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-20 00:33:29,521 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 61 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:29,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 304 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:33:29,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6727 states. [2023-12-20 00:33:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6727 to 5493. [2023-12-20 00:33:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5493 states, 4456 states have (on average 1.4252692998204668) internal successors, (6351), 4723 states have internal predecessors, (6351), 481 states have call successors, (481), 257 states have call predecessors, (481), 555 states have return successors, (2556), 576 states have call predecessors, (2556), 481 states have call successors, (2556) [2023-12-20 00:33:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5493 states to 5493 states and 9388 transitions. [2023-12-20 00:33:29,813 INFO L78 Accepts]: Start accepts. Automaton has 5493 states and 9388 transitions. Word has length 96 [2023-12-20 00:33:29,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:29,813 INFO L495 AbstractCegarLoop]: Abstraction has 5493 states and 9388 transitions. [2023-12-20 00:33:29,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:29,814 INFO L276 IsEmpty]: Start isEmpty. Operand 5493 states and 9388 transitions. [2023-12-20 00:33:29,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-20 00:33:29,833 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:29,834 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:29,846 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 00:33:30,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-20 00:33:30,040 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:30,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:30,041 INFO L85 PathProgramCache]: Analyzing trace with hash -315091207, now seen corresponding path program 1 times [2023-12-20 00:33:30,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:30,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503246270] [2023-12-20 00:33:30,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:30,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:30,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:30,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 00:33:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:30,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 00:33:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:30,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:33:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:30,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-20 00:33:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:30,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 00:33:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:30,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-20 00:33:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:30,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 00:33:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:30,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-20 00:33:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:30,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 00:33:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:30,137 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-20 00:33:30,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:30,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503246270] [2023-12-20 00:33:30,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503246270] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:30,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830997390] [2023-12-20 00:33:30,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:30,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:30,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:30,139 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:30,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-20 00:33:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:30,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 00:33:30,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-20 00:33:30,226 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:30,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830997390] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:30,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:30,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-12-20 00:33:30,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535710542] [2023-12-20 00:33:30,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:30,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:33:30,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:30,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:33:30,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-20 00:33:30,228 INFO L87 Difference]: Start difference. First operand 5493 states and 9388 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 00:33:30,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:30,409 INFO L93 Difference]: Finished difference Result 10940 states and 19073 transitions. [2023-12-20 00:33:30,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:33:30,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 97 [2023-12-20 00:33:30,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:30,437 INFO L225 Difference]: With dead ends: 10940 [2023-12-20 00:33:30,437 INFO L226 Difference]: Without dead ends: 5853 [2023-12-20 00:33:30,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-20 00:33:30,454 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 15 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:30,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 236 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:33:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5853 states. [2023-12-20 00:33:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5853 to 5853. [2023-12-20 00:33:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5853 states, 4680 states have (on average 1.416025641025641) internal successors, (6627), 4939 states have internal predecessors, (6627), 577 states have call successors, (577), 305 states have call predecessors, (577), 595 states have return successors, (2916), 672 states have call predecessors, (2916), 577 states have call successors, (2916) [2023-12-20 00:33:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 10120 transitions. [2023-12-20 00:33:30,799 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 10120 transitions. Word has length 97 [2023-12-20 00:33:30,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:30,799 INFO L495 AbstractCegarLoop]: Abstraction has 5853 states and 10120 transitions. [2023-12-20 00:33:30,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 00:33:30,800 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 10120 transitions. [2023-12-20 00:33:30,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-20 00:33:30,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:30,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:30,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:31,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-20 00:33:31,023 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:31,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:31,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1457593673, now seen corresponding path program 1 times [2023-12-20 00:33:31,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:31,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047951710] [2023-12-20 00:33:31,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:31,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:31,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:31,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 00:33:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:31,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 00:33:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:31,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 00:33:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:31,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-20 00:33:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:31,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 00:33:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:31,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-20 00:33:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:31,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 00:33:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:31,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-20 00:33:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:31,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 00:33:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:31,122 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-20 00:33:31,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:31,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047951710] [2023-12-20 00:33:31,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047951710] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:31,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935512879] [2023-12-20 00:33:31,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:31,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:31,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:31,123 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:31,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-20 00:33:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:31,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 00:33:31,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-20 00:33:31,233 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:31,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935512879] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:31,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:31,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-12-20 00:33:31,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162197473] [2023-12-20 00:33:31,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:31,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:33:31,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:31,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:33:31,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:33:31,234 INFO L87 Difference]: Start difference. First operand 5853 states and 10120 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:31,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:31,446 INFO L93 Difference]: Finished difference Result 12398 states and 21091 transitions. [2023-12-20 00:33:31,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 00:33:31,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2023-12-20 00:33:31,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:31,505 INFO L225 Difference]: With dead ends: 12398 [2023-12-20 00:33:31,505 INFO L226 Difference]: Without dead ends: 6807 [2023-12-20 00:33:31,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-20 00:33:31,518 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 77 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:31,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 230 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:33:31,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6807 states. [2023-12-20 00:33:31,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6807 to 5853. [2023-12-20 00:33:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5853 states, 4680 states have (on average 1.4151709401709403) internal successors, (6623), 4939 states have internal predecessors, (6623), 577 states have call successors, (577), 305 states have call predecessors, (577), 595 states have return successors, (2916), 672 states have call predecessors, (2916), 577 states have call successors, (2916) [2023-12-20 00:33:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 10116 transitions. [2023-12-20 00:33:31,825 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 10116 transitions. Word has length 97 [2023-12-20 00:33:31,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:31,825 INFO L495 AbstractCegarLoop]: Abstraction has 5853 states and 10116 transitions. [2023-12-20 00:33:31,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 10116 transitions. [2023-12-20 00:33:31,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-20 00:33:31,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:31,840 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:31,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-20 00:33:32,045 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,SelfDestructingSolverStorable13 [2023-12-20 00:33:32,045 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:32,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1091145433, now seen corresponding path program 1 times [2023-12-20 00:33:32,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:32,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636202412] [2023-12-20 00:33:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:32,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:32,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:32,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 00:33:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:32,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-20 00:33:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:32,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 00:33:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 00:33:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:32,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-20 00:33:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:32,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 00:33:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:32,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 00:33:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:32,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-20 00:33:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 00:33:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-20 00:33:32,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:32,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636202412] [2023-12-20 00:33:32,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636202412] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:32,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276233558] [2023-12-20 00:33:32,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:32,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:32,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:32,154 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:32,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-20 00:33:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:32,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 00:33:32,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-20 00:33:32,241 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:32,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276233558] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:32,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:32,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-12-20 00:33:32,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323939842] [2023-12-20 00:33:32,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:32,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:33:32,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:32,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:33:32,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-20 00:33:32,242 INFO L87 Difference]: Start difference. First operand 5853 states and 10116 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 00:33:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:32,465 INFO L93 Difference]: Finished difference Result 11856 states and 20687 transitions. [2023-12-20 00:33:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:33:32,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 99 [2023-12-20 00:33:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:32,482 INFO L225 Difference]: With dead ends: 11856 [2023-12-20 00:33:32,482 INFO L226 Difference]: Without dead ends: 6465 [2023-12-20 00:33:32,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-20 00:33:32,493 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 20 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:32,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 235 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:33:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6465 states. [2023-12-20 00:33:32,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6465 to 6465. [2023-12-20 00:33:32,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6465 states, 5076 states have (on average 1.3977541371158393) internal successors, (7095), 5335 states have internal predecessors, (7095), 721 states have call successors, (721), 377 states have call predecessors, (721), 667 states have return successors, (3444), 816 states have call predecessors, (3444), 721 states have call successors, (3444) [2023-12-20 00:33:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6465 states to 6465 states and 11260 transitions. [2023-12-20 00:33:32,742 INFO L78 Accepts]: Start accepts. Automaton has 6465 states and 11260 transitions. Word has length 99 [2023-12-20 00:33:32,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:32,743 INFO L495 AbstractCegarLoop]: Abstraction has 6465 states and 11260 transitions. [2023-12-20 00:33:32,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 00:33:32,743 INFO L276 IsEmpty]: Start isEmpty. Operand 6465 states and 11260 transitions. [2023-12-20 00:33:32,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-20 00:33:32,759 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:32,759 INFO L195 NwaCegarLoop]: trace histogram [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 00:33:32,764 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 00:33:32,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:32,964 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:32,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:32,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1930179095, now seen corresponding path program 1 times [2023-12-20 00:33:32,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:32,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789794734] [2023-12-20 00:33:32,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:32,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:33,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:33,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 00:33:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:33,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-20 00:33:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:33,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 00:33:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:33,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 00:33:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:33,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-20 00:33:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:33,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 00:33:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:33,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 00:33:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:33,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-20 00:33:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:33,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 00:33:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-20 00:33:33,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:33,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789794734] [2023-12-20 00:33:33,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789794734] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:33,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37391490] [2023-12-20 00:33:33,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:33,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:33,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:33,046 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:33,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-20 00:33:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:33,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 00:33:33,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 00:33:33,235 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:33,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37391490] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:33,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:33,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-20 00:33:33,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008187386] [2023-12-20 00:33:33,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:33,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:33:33,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:33,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:33:33,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:33:33,236 INFO L87 Difference]: Start difference. First operand 6465 states and 11260 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 00:33:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:33,513 INFO L93 Difference]: Finished difference Result 12480 states and 20997 transitions. [2023-12-20 00:33:33,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 00:33:33,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2023-12-20 00:33:33,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:33,530 INFO L225 Difference]: With dead ends: 12480 [2023-12-20 00:33:33,530 INFO L226 Difference]: Without dead ends: 6565 [2023-12-20 00:33:33,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-20 00:33:33,542 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 178 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:33,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 547 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:33:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6565 states. [2023-12-20 00:33:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6565 to 6561. [2023-12-20 00:33:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6561 states, 5148 states have (on average 1.385975135975136) internal successors, (7135), 5431 states have internal predecessors, (7135), 721 states have call successors, (721), 377 states have call predecessors, (721), 691 states have return successors, (3016), 816 states have call predecessors, (3016), 721 states have call successors, (3016) [2023-12-20 00:33:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 10872 transitions. [2023-12-20 00:33:33,871 INFO L78 Accepts]: Start accepts. Automaton has 6561 states and 10872 transitions. Word has length 99 [2023-12-20 00:33:33,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:33,871 INFO L495 AbstractCegarLoop]: Abstraction has 6561 states and 10872 transitions. [2023-12-20 00:33:33,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 00:33:33,871 INFO L276 IsEmpty]: Start isEmpty. Operand 6561 states and 10872 transitions. [2023-12-20 00:33:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-20 00:33:33,886 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:33,886 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:33,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:34,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-20 00:33:34,092 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:34,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash -96433003, now seen corresponding path program 2 times [2023-12-20 00:33:34,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:34,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806691238] [2023-12-20 00:33:34,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:34,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:34,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:34,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 00:33:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:34,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-20 00:33:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:34,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 00:33:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:34,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 00:33:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:34,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-20 00:33:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:34,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 00:33:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:34,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 00:33:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:34,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-20 00:33:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:34,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 00:33:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-20 00:33:34,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:34,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806691238] [2023-12-20 00:33:34,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806691238] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:34,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039537460] [2023-12-20 00:33:34,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-20 00:33:34,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:34,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:34,195 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:34,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-20 00:33:34,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-20 00:33:34,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 00:33:34,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 00:33:34,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:34,265 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-20 00:33:34,265 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:34,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039537460] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:34,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:34,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-12-20 00:33:34,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770736657] [2023-12-20 00:33:34,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:34,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 00:33:34,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:34,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 00:33:34,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:33:34,268 INFO L87 Difference]: Start difference. First operand 6561 states and 10872 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 00:33:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:34,457 INFO L93 Difference]: Finished difference Result 8221 states and 15175 transitions. [2023-12-20 00:33:34,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 00:33:34,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 99 [2023-12-20 00:33:34,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:34,483 INFO L225 Difference]: With dead ends: 8221 [2023-12-20 00:33:34,483 INFO L226 Difference]: Without dead ends: 8217 [2023-12-20 00:33:34,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:33:34,488 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 37 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 447 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 00:33:34,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 447 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:33:34,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2023-12-20 00:33:34,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 6689. [2023-12-20 00:33:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6689 states, 5276 states have (on average 1.3766110689916604) internal successors, (7263), 5559 states have internal predecessors, (7263), 721 states have call successors, (721), 377 states have call predecessors, (721), 691 states have return successors, (3016), 816 states have call predecessors, (3016), 721 states have call successors, (3016) [2023-12-20 00:33:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 11000 transitions. [2023-12-20 00:33:34,908 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 11000 transitions. Word has length 99 [2023-12-20 00:33:34,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:34,909 INFO L495 AbstractCegarLoop]: Abstraction has 6689 states and 11000 transitions. [2023-12-20 00:33:34,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 00:33:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 11000 transitions. [2023-12-20 00:33:34,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-20 00:33:34,926 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:34,927 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:34,939 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 00:33:35,131 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,SelfDestructingSolverStorable16 [2023-12-20 00:33:35,132 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:35,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:35,133 INFO L85 PathProgramCache]: Analyzing trace with hash -39174701, now seen corresponding path program 1 times [2023-12-20 00:33:35,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:35,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333343875] [2023-12-20 00:33:35,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:35,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:35,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:35,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 00:33:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:35,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-20 00:33:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:35,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 00:33:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:35,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 00:33:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:35,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-20 00:33:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:35,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 00:33:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:35,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 00:33:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:35,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-20 00:33:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:35,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 00:33:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-20 00:33:35,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:35,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333343875] [2023-12-20 00:33:35,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333343875] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:35,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294214658] [2023-12-20 00:33:35,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:35,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:35,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:35,236 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:35,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-20 00:33:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:35,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-20 00:33:35,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-12-20 00:33:35,351 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:35,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294214658] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:35,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:35,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-12-20 00:33:35,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022526427] [2023-12-20 00:33:35,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:35,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 00:33:35,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:35,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 00:33:35,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-12-20 00:33:35,353 INFO L87 Difference]: Start difference. First operand 6689 states and 11000 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 00:33:35,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:35,613 INFO L93 Difference]: Finished difference Result 12748 states and 20399 transitions. [2023-12-20 00:33:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 00:33:35,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 99 [2023-12-20 00:33:35,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:35,631 INFO L225 Difference]: With dead ends: 12748 [2023-12-20 00:33:35,632 INFO L226 Difference]: Without dead ends: 6625 [2023-12-20 00:33:35,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-12-20 00:33:35,643 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:35,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 584 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:33:35,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2023-12-20 00:33:35,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 6625. [2023-12-20 00:33:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6625 states, 5212 states have (on average 1.3689562547966232) internal successors, (7135), 5495 states have internal predecessors, (7135), 721 states have call successors, (721), 377 states have call predecessors, (721), 691 states have return successors, (3016), 816 states have call predecessors, (3016), 721 states have call successors, (3016) [2023-12-20 00:33:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 10872 transitions. [2023-12-20 00:33:36,004 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 10872 transitions. Word has length 99 [2023-12-20 00:33:36,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:36,005 INFO L495 AbstractCegarLoop]: Abstraction has 6625 states and 10872 transitions. [2023-12-20 00:33:36,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-20 00:33:36,005 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 10872 transitions. [2023-12-20 00:33:36,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-20 00:33:36,020 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:36,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:36,040 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 00:33:36,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-20 00:33:36,225 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:36,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:36,226 INFO L85 PathProgramCache]: Analyzing trace with hash 871855670, now seen corresponding path program 1 times [2023-12-20 00:33:36,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:36,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618361865] [2023-12-20 00:33:36,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:36,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:36,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:36,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 00:33:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:36,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-20 00:33:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:36,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 00:33:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:36,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 00:33:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:36,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-20 00:33:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:36,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 00:33:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:36,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 00:33:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:36,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-20 00:33:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:36,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 00:33:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:36,315 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-20 00:33:36,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:36,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618361865] [2023-12-20 00:33:36,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618361865] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:36,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291776279] [2023-12-20 00:33:36,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:36,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:36,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:36,326 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:36,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-20 00:33:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:36,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 00:33:36,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 00:33:36,490 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:36,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291776279] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:36,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:36,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-12-20 00:33:36,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825771966] [2023-12-20 00:33:36,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:36,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:33:36,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:36,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:33:36,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:33:36,492 INFO L87 Difference]: Start difference. First operand 6625 states and 10872 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 00:33:36,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:36,779 INFO L93 Difference]: Finished difference Result 12940 states and 20614 transitions. [2023-12-20 00:33:36,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 00:33:36,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 102 [2023-12-20 00:33:36,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:36,797 INFO L225 Difference]: With dead ends: 12940 [2023-12-20 00:33:36,797 INFO L226 Difference]: Without dead ends: 6845 [2023-12-20 00:33:36,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-20 00:33:36,810 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 192 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:36,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 570 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:33:36,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6845 states. [2023-12-20 00:33:37,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6845 to 6841. [2023-12-20 00:33:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6841 states, 5392 states have (on average 1.3492210682492582) internal successors, (7275), 5711 states have internal predecessors, (7275), 721 states have call successors, (721), 377 states have call predecessors, (721), 727 states have return successors, (2656), 816 states have call predecessors, (2656), 721 states have call successors, (2656) [2023-12-20 00:33:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 10652 transitions. [2023-12-20 00:33:37,082 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 10652 transitions. Word has length 102 [2023-12-20 00:33:37,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:37,083 INFO L495 AbstractCegarLoop]: Abstraction has 6841 states and 10652 transitions. [2023-12-20 00:33:37,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 00:33:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 10652 transitions. [2023-12-20 00:33:37,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-20 00:33:37,099 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:37,099 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, 1, 1] [2023-12-20 00:33:37,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-20 00:33:37,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:37,306 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:37,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:37,307 INFO L85 PathProgramCache]: Analyzing trace with hash -814324168, now seen corresponding path program 1 times [2023-12-20 00:33:37,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:37,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541561107] [2023-12-20 00:33:37,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:37,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:37,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:37,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 00:33:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:37,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-20 00:33:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:37,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 00:33:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:37,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 00:33:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:37,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-20 00:33:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:37,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 00:33:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:37,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 00:33:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:37,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-20 00:33:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:37,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 00:33:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-20 00:33:37,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:37,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541561107] [2023-12-20 00:33:37,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541561107] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:37,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728806069] [2023-12-20 00:33:37,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:37,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:37,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:37,403 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:37,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-20 00:33:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:37,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 00:33:37,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-20 00:33:37,547 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:37,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728806069] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:37,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:37,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2023-12-20 00:33:37,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914328817] [2023-12-20 00:33:37,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:37,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:33:37,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:37,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:33:37,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-20 00:33:37,548 INFO L87 Difference]: Start difference. First operand 6841 states and 10652 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:37,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:37,806 INFO L93 Difference]: Finished difference Result 14070 states and 21801 transitions. [2023-12-20 00:33:37,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 00:33:37,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 102 [2023-12-20 00:33:37,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:37,825 INFO L225 Difference]: With dead ends: 14070 [2023-12-20 00:33:37,825 INFO L226 Difference]: Without dead ends: 7543 [2023-12-20 00:33:37,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:33:37,835 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 76 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:37,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 222 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:33:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7543 states. [2023-12-20 00:33:38,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7543 to 6841. [2023-12-20 00:33:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6841 states, 5392 states have (on average 1.3477373887240356) internal successors, (7267), 5711 states have internal predecessors, (7267), 721 states have call successors, (721), 377 states have call predecessors, (721), 727 states have return successors, (2656), 816 states have call predecessors, (2656), 721 states have call successors, (2656) [2023-12-20 00:33:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 10644 transitions. [2023-12-20 00:33:38,113 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 10644 transitions. Word has length 102 [2023-12-20 00:33:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:38,113 INFO L495 AbstractCegarLoop]: Abstraction has 6841 states and 10644 transitions. [2023-12-20 00:33:38,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:38,114 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 10644 transitions. [2023-12-20 00:33:38,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-20 00:33:38,129 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:38,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:38,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:38,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:38,334 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:38,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:38,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1864122538, now seen corresponding path program 1 times [2023-12-20 00:33:38,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:38,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655060405] [2023-12-20 00:33:38,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:38,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:38,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:38,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:33:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:38,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 00:33:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:38,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 00:33:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:38,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 00:33:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:38,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-20 00:33:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:38,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-20 00:33:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:38,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 00:33:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:38,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-20 00:33:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:38,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-20 00:33:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-20 00:33:38,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:38,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655060405] [2023-12-20 00:33:38,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655060405] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:38,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41407470] [2023-12-20 00:33:38,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:38,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:38,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:38,430 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:38,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-20 00:33:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:38,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 00:33:38,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-20 00:33:38,518 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:38,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41407470] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:38,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:38,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-12-20 00:33:38,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923043878] [2023-12-20 00:33:38,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:38,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:33:38,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:38,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:33:38,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-20 00:33:38,519 INFO L87 Difference]: Start difference. First operand 6841 states and 10644 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 00:33:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:38,766 INFO L93 Difference]: Finished difference Result 14110 states and 21908 transitions. [2023-12-20 00:33:38,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:33:38,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 104 [2023-12-20 00:33:38,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:38,785 INFO L225 Difference]: With dead ends: 14110 [2023-12-20 00:33:38,785 INFO L226 Difference]: Without dead ends: 7803 [2023-12-20 00:33:38,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-20 00:33:38,795 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 22 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:38,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 237 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:33:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7803 states. [2023-12-20 00:33:39,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7803 to 7803. [2023-12-20 00:33:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7803 states, 6030 states have (on average 1.3203980099502488) internal successors, (7962), 6349 states have internal predecessors, (7962), 937 states have call successors, (937), 485 states have call predecessors, (937), 835 states have return successors, (3180), 1032 states have call predecessors, (3180), 937 states have call successors, (3180) [2023-12-20 00:33:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7803 states to 7803 states and 12079 transitions. [2023-12-20 00:33:39,116 INFO L78 Accepts]: Start accepts. Automaton has 7803 states and 12079 transitions. Word has length 104 [2023-12-20 00:33:39,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:39,116 INFO L495 AbstractCegarLoop]: Abstraction has 7803 states and 12079 transitions. [2023-12-20 00:33:39,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 00:33:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 7803 states and 12079 transitions. [2023-12-20 00:33:39,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-20 00:33:39,133 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:39,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:39,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-20 00:33:39,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-20 00:33:39,338 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:39,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:39,338 INFO L85 PathProgramCache]: Analyzing trace with hash 721620072, now seen corresponding path program 1 times [2023-12-20 00:33:39,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:39,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071053981] [2023-12-20 00:33:39,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:39,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:39,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:39,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:33:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:39,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 00:33:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:39,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 00:33:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:39,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 00:33:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:39,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-20 00:33:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:39,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-20 00:33:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:39,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 00:33:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:39,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-20 00:33:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:39,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-20 00:33:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-20 00:33:39,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:39,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071053981] [2023-12-20 00:33:39,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071053981] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:39,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679208554] [2023-12-20 00:33:39,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:39,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:39,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:39,437 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:39,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-20 00:33:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:39,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-20 00:33:39,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:39,559 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 00:33:39,559 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:39,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679208554] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:39,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:39,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-12-20 00:33:39,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907971649] [2023-12-20 00:33:39,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:39,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:33:39,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:39,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:33:39,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:33:39,560 INFO L87 Difference]: Start difference. First operand 7803 states and 12079 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 00:33:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:40,023 INFO L93 Difference]: Finished difference Result 15114 states and 22661 transitions. [2023-12-20 00:33:40,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 00:33:40,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2023-12-20 00:33:40,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:40,044 INFO L225 Difference]: With dead ends: 15114 [2023-12-20 00:33:40,044 INFO L226 Difference]: Without dead ends: 7969 [2023-12-20 00:33:40,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-20 00:33:40,058 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 173 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:40,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 508 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:33:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7969 states. [2023-12-20 00:33:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7969 to 7965. [2023-12-20 00:33:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 6138 states have (on average 1.30514825676116) internal successors, (8011), 6511 states have internal predecessors, (8011), 937 states have call successors, (937), 485 states have call predecessors, (937), 889 states have return successors, (2884), 1032 states have call predecessors, (2884), 937 states have call successors, (2884) [2023-12-20 00:33:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 11832 transitions. [2023-12-20 00:33:40,480 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 11832 transitions. Word has length 104 [2023-12-20 00:33:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:40,480 INFO L495 AbstractCegarLoop]: Abstraction has 7965 states and 11832 transitions. [2023-12-20 00:33:40,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 00:33:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 11832 transitions. [2023-12-20 00:33:40,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-20 00:33:40,497 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:40,497 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:40,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:40,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-20 00:33:40,702 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:40,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:40,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1400892326, now seen corresponding path program 1 times [2023-12-20 00:33:40,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:40,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813833682] [2023-12-20 00:33:40,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:40,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:40,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:40,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:33:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:40,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 00:33:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:40,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 00:33:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:40,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 00:33:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:40,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-20 00:33:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:40,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-20 00:33:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:40,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 00:33:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:40,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-20 00:33:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:40,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-20 00:33:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-20 00:33:40,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:40,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813833682] [2023-12-20 00:33:40,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813833682] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:40,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236266304] [2023-12-20 00:33:40,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:40,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:40,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:40,795 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:40,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-20 00:33:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:40,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-20 00:33:40,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-20 00:33:40,904 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:40,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236266304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:40,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:40,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2023-12-20 00:33:40,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978812067] [2023-12-20 00:33:40,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:40,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:33:40,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:40,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:33:40,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-20 00:33:40,905 INFO L87 Difference]: Start difference. First operand 7965 states and 11832 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 00:33:41,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:41,208 INFO L93 Difference]: Finished difference Result 12501 states and 18133 transitions. [2023-12-20 00:33:41,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 00:33:41,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2023-12-20 00:33:41,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:41,218 INFO L225 Difference]: With dead ends: 12501 [2023-12-20 00:33:41,218 INFO L226 Difference]: Without dead ends: 5086 [2023-12-20 00:33:41,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:33:41,231 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 72 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:41,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 449 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:33:41,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5086 states. [2023-12-20 00:33:41,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5086 to 5086. [2023-12-20 00:33:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5086 states, 3894 states have (on average 1.29301489470981) internal successors, (5035), 4148 states have internal predecessors, (5035), 609 states have call successors, (609), 313 states have call predecessors, (609), 582 states have return successors, (1692), 656 states have call predecessors, (1692), 609 states have call successors, (1692) [2023-12-20 00:33:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5086 states to 5086 states and 7336 transitions. [2023-12-20 00:33:41,437 INFO L78 Accepts]: Start accepts. Automaton has 5086 states and 7336 transitions. Word has length 104 [2023-12-20 00:33:41,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:41,437 INFO L495 AbstractCegarLoop]: Abstraction has 5086 states and 7336 transitions. [2023-12-20 00:33:41,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-20 00:33:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 5086 states and 7336 transitions. [2023-12-20 00:33:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-20 00:33:41,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:41,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:41,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:41,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:41,649 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:41,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:41,650 INFO L85 PathProgramCache]: Analyzing trace with hash 93749928, now seen corresponding path program 1 times [2023-12-20 00:33:41,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:41,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053610352] [2023-12-20 00:33:41,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:41,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:41,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:41,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:33:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:41,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 00:33:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:41,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-20 00:33:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:41,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 00:33:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:41,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-20 00:33:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:41,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-20 00:33:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:41,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 00:33:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:41,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-20 00:33:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:41,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-20 00:33:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:41,752 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-20 00:33:41,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:41,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053610352] [2023-12-20 00:33:41,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053610352] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:41,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342913014] [2023-12-20 00:33:41,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:41,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:41,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:41,759 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:41,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-20 00:33:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:41,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-20 00:33:41,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:41,902 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-20 00:33:41,902 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:41,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342913014] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:41,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:41,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-12-20 00:33:41,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813501143] [2023-12-20 00:33:41,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:41,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:33:41,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:41,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:33:41,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:33:41,903 INFO L87 Difference]: Start difference. First operand 5086 states and 7336 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:42,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:42,122 INFO L93 Difference]: Finished difference Result 9622 states and 13549 transitions. [2023-12-20 00:33:42,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:33:42,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2023-12-20 00:33:42,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:42,130 INFO L225 Difference]: With dead ends: 9622 [2023-12-20 00:33:42,130 INFO L226 Difference]: Without dead ends: 4805 [2023-12-20 00:33:42,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-20 00:33:42,136 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:42,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 369 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 00:33:42,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4805 states. [2023-12-20 00:33:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4805 to 4805. [2023-12-20 00:33:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4805 states, 3769 states have (on average 1.2963650835765455) internal successors, (4886), 4007 states have internal predecessors, (4886), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1384), 500 states have call predecessors, (1384), 469 states have call successors, (1384) [2023-12-20 00:33:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4805 states to 4805 states and 6739 transitions. [2023-12-20 00:33:42,320 INFO L78 Accepts]: Start accepts. Automaton has 4805 states and 6739 transitions. Word has length 104 [2023-12-20 00:33:42,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:42,320 INFO L495 AbstractCegarLoop]: Abstraction has 4805 states and 6739 transitions. [2023-12-20 00:33:42,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-20 00:33:42,320 INFO L276 IsEmpty]: Start isEmpty. Operand 4805 states and 6739 transitions. [2023-12-20 00:33:42,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-20 00:33:42,327 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:42,327 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:42,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:42,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:42,531 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:42,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:42,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1932596493, now seen corresponding path program 1 times [2023-12-20 00:33:42,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:42,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353176860] [2023-12-20 00:33:42,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:42,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:42,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:42,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:33:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:42,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 00:33:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:42,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:33:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:42,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 00:33:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:42,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-20 00:33:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:42,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 00:33:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:42,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-20 00:33:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:42,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-20 00:33:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:42,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 00:33:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:42,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-20 00:33:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-20 00:33:42,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:42,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353176860] [2023-12-20 00:33:42,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353176860] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:42,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745430739] [2023-12-20 00:33:42,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:42,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:42,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:42,678 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:42,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-12-20 00:33:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:42,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 00:33:42,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 00:33:42,768 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:42,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745430739] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:42,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:42,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-12-20 00:33:42,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217462993] [2023-12-20 00:33:42,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:42,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:33:42,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:42,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:33:42,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:33:42,770 INFO L87 Difference]: Start difference. First operand 4805 states and 6739 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-20 00:33:42,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:42,912 INFO L93 Difference]: Finished difference Result 9421 states and 13096 transitions. [2023-12-20 00:33:42,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:33:42,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2023-12-20 00:33:42,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:42,920 INFO L225 Difference]: With dead ends: 9421 [2023-12-20 00:33:42,920 INFO L226 Difference]: Without dead ends: 4885 [2023-12-20 00:33:42,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:33:42,925 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:42,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 226 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:33:42,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4885 states. [2023-12-20 00:33:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4885 to 4853. [2023-12-20 00:33:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4853 states, 3817 states have (on average 1.292638197537333) internal successors, (4934), 4055 states have internal predecessors, (4934), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1384), 500 states have call predecessors, (1384), 469 states have call successors, (1384) [2023-12-20 00:33:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4853 states to 4853 states and 6787 transitions. [2023-12-20 00:33:43,087 INFO L78 Accepts]: Start accepts. Automaton has 4853 states and 6787 transitions. Word has length 117 [2023-12-20 00:33:43,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:43,087 INFO L495 AbstractCegarLoop]: Abstraction has 4853 states and 6787 transitions. [2023-12-20 00:33:43,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-20 00:33:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 4853 states and 6787 transitions. [2023-12-20 00:33:43,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-20 00:33:43,094 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:43,094 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:43,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:43,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-20 00:33:43,299 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:43,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:43,299 INFO L85 PathProgramCache]: Analyzing trace with hash -256404888, now seen corresponding path program 1 times [2023-12-20 00:33:43,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:43,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508638657] [2023-12-20 00:33:43,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:43,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:43,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:43,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:33:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:43,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 00:33:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:43,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:33:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:43,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 00:33:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:43,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 00:33:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:43,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-20 00:33:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:43,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 00:33:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:43,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 00:33:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:43,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-20 00:33:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:43,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 00:33:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-20 00:33:43,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:43,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508638657] [2023-12-20 00:33:43,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508638657] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:43,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293102034] [2023-12-20 00:33:43,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:43,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:43,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:43,406 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:43,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-20 00:33:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:43,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 00:33:43,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 00:33:43,516 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:43,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293102034] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:43,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:43,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-12-20 00:33:43,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279859637] [2023-12-20 00:33:43,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:43,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:33:43,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:43,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:33:43,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:33:43,517 INFO L87 Difference]: Start difference. First operand 4853 states and 6787 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-20 00:33:43,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:43,665 INFO L93 Difference]: Finished difference Result 9453 states and 13064 transitions. [2023-12-20 00:33:43,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:33:43,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 118 [2023-12-20 00:33:43,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:43,673 INFO L225 Difference]: With dead ends: 9453 [2023-12-20 00:33:43,673 INFO L226 Difference]: Without dead ends: 4869 [2023-12-20 00:33:43,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:33:43,678 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:43,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 221 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:33:43,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2023-12-20 00:33:43,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4853. [2023-12-20 00:33:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4853 states, 3817 states have (on average 1.2800628766046633) internal successors, (4886), 4055 states have internal predecessors, (4886), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1384), 500 states have call predecessors, (1384), 469 states have call successors, (1384) [2023-12-20 00:33:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4853 states to 4853 states and 6739 transitions. [2023-12-20 00:33:43,834 INFO L78 Accepts]: Start accepts. Automaton has 4853 states and 6739 transitions. Word has length 118 [2023-12-20 00:33:43,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:43,834 INFO L495 AbstractCegarLoop]: Abstraction has 4853 states and 6739 transitions. [2023-12-20 00:33:43,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-20 00:33:43,834 INFO L276 IsEmpty]: Start isEmpty. Operand 4853 states and 6739 transitions. [2023-12-20 00:33:43,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-20 00:33:43,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:43,840 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:43,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:44,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-20 00:33:44,045 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:44,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1470067273, now seen corresponding path program 1 times [2023-12-20 00:33:44,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:44,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958440965] [2023-12-20 00:33:44,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:44,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:44,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:44,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:33:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:44,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 00:33:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:44,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:33:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:44,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 00:33:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:44,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 00:33:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:44,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-20 00:33:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:44,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 00:33:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:44,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 00:33:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:44,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-20 00:33:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:44,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-20 00:33:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-20 00:33:44,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:44,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958440965] [2023-12-20 00:33:44,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958440965] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:44,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896263041] [2023-12-20 00:33:44,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:44,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:44,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:44,176 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:44,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-20 00:33:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:44,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 00:33:44,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 00:33:44,329 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:44,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896263041] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:44,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:44,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2023-12-20 00:33:44,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209919536] [2023-12-20 00:33:44,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:44,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:33:44,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:44,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:33:44,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-20 00:33:44,332 INFO L87 Difference]: Start difference. First operand 4853 states and 6739 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 00:33:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:44,550 INFO L93 Difference]: Finished difference Result 9437 states and 12952 transitions. [2023-12-20 00:33:44,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:33:44,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 118 [2023-12-20 00:33:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:44,561 INFO L225 Difference]: With dead ends: 9437 [2023-12-20 00:33:44,561 INFO L226 Difference]: Without dead ends: 4853 [2023-12-20 00:33:44,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-20 00:33:44,568 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 210 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:44,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 120 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:33:44,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4853 states. [2023-12-20 00:33:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4853 to 4853. [2023-12-20 00:33:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4853 states, 3817 states have (on average 1.2758711029604402) internal successors, (4870), 4055 states have internal predecessors, (4870), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1384), 500 states have call predecessors, (1384), 469 states have call successors, (1384) [2023-12-20 00:33:44,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4853 states to 4853 states and 6723 transitions. [2023-12-20 00:33:44,832 INFO L78 Accepts]: Start accepts. Automaton has 4853 states and 6723 transitions. Word has length 118 [2023-12-20 00:33:44,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:44,832 INFO L495 AbstractCegarLoop]: Abstraction has 4853 states and 6723 transitions. [2023-12-20 00:33:44,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 00:33:44,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4853 states and 6723 transitions. [2023-12-20 00:33:44,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-20 00:33:44,841 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:44,841 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:44,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-12-20 00:33:45,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-20 00:33:45,049 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:45,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:45,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1106088414, now seen corresponding path program 1 times [2023-12-20 00:33:45,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:45,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427488563] [2023-12-20 00:33:45,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:45,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:45,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:45,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:33:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:45,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 00:33:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:45,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:33:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:45,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 00:33:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:45,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 00:33:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:45,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 00:33:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:45,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 00:33:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:45,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-20 00:33:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:45,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-20 00:33:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:45,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 00:33:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-20 00:33:45,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:45,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427488563] [2023-12-20 00:33:45,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427488563] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:45,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978641328] [2023-12-20 00:33:45,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:45,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:45,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:45,264 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:45,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-12-20 00:33:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:45,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 00:33:45,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 00:33:45,354 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:45,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978641328] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:45,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:45,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-12-20 00:33:45,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127795057] [2023-12-20 00:33:45,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:45,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 00:33:45,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:45,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 00:33:45,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:33:45,355 INFO L87 Difference]: Start difference. First operand 4853 states and 6723 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-20 00:33:45,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:45,497 INFO L93 Difference]: Finished difference Result 9613 states and 13176 transitions. [2023-12-20 00:33:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 00:33:45,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 119 [2023-12-20 00:33:45,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:45,505 INFO L225 Difference]: With dead ends: 9613 [2023-12-20 00:33:45,505 INFO L226 Difference]: Without dead ends: 5029 [2023-12-20 00:33:45,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-20 00:33:45,511 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 10 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:45,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 229 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:33:45,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2023-12-20 00:33:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 4965. [2023-12-20 00:33:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4965 states, 3929 states have (on average 1.2761516925426317) internal successors, (5014), 4167 states have internal predecessors, (5014), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1384), 500 states have call predecessors, (1384), 469 states have call successors, (1384) [2023-12-20 00:33:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4965 states to 4965 states and 6867 transitions. [2023-12-20 00:33:45,678 INFO L78 Accepts]: Start accepts. Automaton has 4965 states and 6867 transitions. Word has length 119 [2023-12-20 00:33:45,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:45,678 INFO L495 AbstractCegarLoop]: Abstraction has 4965 states and 6867 transitions. [2023-12-20 00:33:45,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-20 00:33:45,678 INFO L276 IsEmpty]: Start isEmpty. Operand 4965 states and 6867 transitions. [2023-12-20 00:33:45,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-20 00:33:45,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:45,685 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:45,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:45,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-12-20 00:33:45,889 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:45,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:45,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1160481312, now seen corresponding path program 1 times [2023-12-20 00:33:45,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:45,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303204208] [2023-12-20 00:33:45,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:45,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:45,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:46,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:33:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:46,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 00:33:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:46,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:33:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:46,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 00:33:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:46,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 00:33:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:46,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 00:33:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:46,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 00:33:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:46,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-20 00:33:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:46,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-20 00:33:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:46,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 00:33:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-20 00:33:46,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:46,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303204208] [2023-12-20 00:33:46,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303204208] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:46,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601966025] [2023-12-20 00:33:46,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:46,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:46,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:46,042 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:46,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-20 00:33:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:46,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 00:33:46,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 00:33:46,207 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:46,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601966025] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:46,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:46,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2023-12-20 00:33:46,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37442836] [2023-12-20 00:33:46,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:46,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:33:46,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:46,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:33:46,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-20 00:33:46,210 INFO L87 Difference]: Start difference. First operand 4965 states and 6867 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 00:33:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:46,394 INFO L93 Difference]: Finished difference Result 9661 states and 13208 transitions. [2023-12-20 00:33:46,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:33:46,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 119 [2023-12-20 00:33:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:46,404 INFO L225 Difference]: With dead ends: 9661 [2023-12-20 00:33:46,404 INFO L226 Difference]: Without dead ends: 4965 [2023-12-20 00:33:46,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-20 00:33:46,413 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 213 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:46,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 134 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:33:46,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4965 states. [2023-12-20 00:33:46,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4965 to 4965. [2023-12-20 00:33:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4965 states, 3929 states have (on average 1.2680071264952915) internal successors, (4982), 4167 states have internal predecessors, (4982), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1384), 500 states have call predecessors, (1384), 469 states have call successors, (1384) [2023-12-20 00:33:46,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4965 states to 4965 states and 6835 transitions. [2023-12-20 00:33:46,672 INFO L78 Accepts]: Start accepts. Automaton has 4965 states and 6835 transitions. Word has length 119 [2023-12-20 00:33:46,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:46,672 INFO L495 AbstractCegarLoop]: Abstraction has 4965 states and 6835 transitions. [2023-12-20 00:33:46,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 00:33:46,673 INFO L276 IsEmpty]: Start isEmpty. Operand 4965 states and 6835 transitions. [2023-12-20 00:33:46,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-20 00:33:46,690 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:46,690 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:46,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:46,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-20 00:33:46,906 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:46,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:46,906 INFO L85 PathProgramCache]: Analyzing trace with hash -19799755, now seen corresponding path program 1 times [2023-12-20 00:33:46,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:46,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847985950] [2023-12-20 00:33:46,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:46,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:46,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:33:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 00:33:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:33:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 00:33:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 00:33:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-20 00:33:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-20 00:33:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-20 00:33:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-20 00:33:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 00:33:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,026 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-20 00:33:47,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:47,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847985950] [2023-12-20 00:33:47,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847985950] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:47,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286483090] [2023-12-20 00:33:47,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:47,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:47,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:47,028 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:47,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-20 00:33:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 00:33:47,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 00:33:47,197 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:47,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286483090] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:47,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:47,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2023-12-20 00:33:47,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263395520] [2023-12-20 00:33:47,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:47,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:33:47,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:47,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:33:47,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-20 00:33:47,198 INFO L87 Difference]: Start difference. First operand 4965 states and 6835 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 00:33:47,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:47,378 INFO L93 Difference]: Finished difference Result 9549 states and 13016 transitions. [2023-12-20 00:33:47,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:33:47,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 120 [2023-12-20 00:33:47,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:47,387 INFO L225 Difference]: With dead ends: 9549 [2023-12-20 00:33:47,387 INFO L226 Difference]: Without dead ends: 4853 [2023-12-20 00:33:47,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-20 00:33:47,393 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 169 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:47,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 116 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:33:47,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4853 states. [2023-12-20 00:33:47,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4853 to 4853. [2023-12-20 00:33:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4853 states, 3817 states have (on average 1.2632957820277706) internal successors, (4822), 4055 states have internal predecessors, (4822), 469 states have call successors, (469), 313 states have call predecessors, (469), 566 states have return successors, (1384), 500 states have call predecessors, (1384), 469 states have call successors, (1384) [2023-12-20 00:33:47,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4853 states to 4853 states and 6675 transitions. [2023-12-20 00:33:47,594 INFO L78 Accepts]: Start accepts. Automaton has 4853 states and 6675 transitions. Word has length 120 [2023-12-20 00:33:47,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:47,594 INFO L495 AbstractCegarLoop]: Abstraction has 4853 states and 6675 transitions. [2023-12-20 00:33:47,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 00:33:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 4853 states and 6675 transitions. [2023-12-20 00:33:47,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-20 00:33:47,602 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:47,602 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:47,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:47,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:47,807 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:47,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:47,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2064059006, now seen corresponding path program 1 times [2023-12-20 00:33:47,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:47,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236894890] [2023-12-20 00:33:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:47,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:33:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 00:33:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:33:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 00:33:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-20 00:33:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 00:33:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 00:33:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 00:33:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-20 00:33:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-20 00:33:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-20 00:33:47,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:47,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236894890] [2023-12-20 00:33:47,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236894890] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:47,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:33:47,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 00:33:47,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852298331] [2023-12-20 00:33:47,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:47,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 00:33:47,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:47,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 00:33:47,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-20 00:33:47,890 INFO L87 Difference]: Start difference. First operand 4853 states and 6675 transitions. Second operand has 7 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 00:33:48,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:48,381 INFO L93 Difference]: Finished difference Result 9805 states and 13328 transitions. [2023-12-20 00:33:48,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-20 00:33:48,381 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 121 [2023-12-20 00:33:48,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:48,391 INFO L225 Difference]: With dead ends: 9805 [2023-12-20 00:33:48,392 INFO L226 Difference]: Without dead ends: 5221 [2023-12-20 00:33:48,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-20 00:33:48,398 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 140 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:48,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 225 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 00:33:48,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5221 states. [2023-12-20 00:33:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5221 to 4945. [2023-12-20 00:33:48,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4945 states, 3893 states have (on average 1.25815566401233) internal successors, (4898), 4147 states have internal predecessors, (4898), 469 states have call successors, (469), 313 states have call predecessors, (469), 582 states have return successors, (1388), 500 states have call predecessors, (1388), 469 states have call successors, (1388) [2023-12-20 00:33:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 6755 transitions. [2023-12-20 00:33:48,592 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 6755 transitions. Word has length 121 [2023-12-20 00:33:48,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:48,592 INFO L495 AbstractCegarLoop]: Abstraction has 4945 states and 6755 transitions. [2023-12-20 00:33:48,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 00:33:48,592 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 6755 transitions. [2023-12-20 00:33:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-20 00:33:48,599 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:48,599 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:48,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-20 00:33:48,599 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:48,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:48,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1670208512, now seen corresponding path program 1 times [2023-12-20 00:33:48,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:48,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987240269] [2023-12-20 00:33:48,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:48,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:48,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:48,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:33:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:48,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 00:33:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:48,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:33:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:48,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 00:33:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:48,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-20 00:33:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:48,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 00:33:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:48,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 00:33:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:48,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 00:33:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:48,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-20 00:33:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:48,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-20 00:33:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-20 00:33:48,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:48,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987240269] [2023-12-20 00:33:48,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987240269] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:48,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 00:33:48,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 00:33:48,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774900343] [2023-12-20 00:33:48,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:48,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 00:33:48,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:48,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 00:33:48,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-20 00:33:48,744 INFO L87 Difference]: Start difference. First operand 4945 states and 6755 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 00:33:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:49,392 INFO L93 Difference]: Finished difference Result 11585 states and 16680 transitions. [2023-12-20 00:33:49,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 00:33:49,392 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 121 [2023-12-20 00:33:49,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:49,406 INFO L225 Difference]: With dead ends: 11585 [2023-12-20 00:33:49,406 INFO L226 Difference]: Without dead ends: 6909 [2023-12-20 00:33:49,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-12-20 00:33:49,413 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 270 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:49,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 365 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 00:33:49,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6909 states. [2023-12-20 00:33:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6909 to 6201. [2023-12-20 00:33:49,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6201 states, 4961 states have (on average 1.2832090304374117) internal successors, (6366), 5323 states have internal predecessors, (6366), 517 states have call successors, (517), 361 states have call predecessors, (517), 722 states have return successors, (2204), 532 states have call predecessors, (2204), 517 states have call successors, (2204) [2023-12-20 00:33:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 9087 transitions. [2023-12-20 00:33:49,673 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 9087 transitions. Word has length 121 [2023-12-20 00:33:49,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:49,673 INFO L495 AbstractCegarLoop]: Abstraction has 6201 states and 9087 transitions. [2023-12-20 00:33:49,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 00:33:49,673 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 9087 transitions. [2023-12-20 00:33:49,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-20 00:33:49,680 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:49,680 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:49,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-20 00:33:49,680 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:49,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:49,681 INFO L85 PathProgramCache]: Analyzing trace with hash -538832258, now seen corresponding path program 1 times [2023-12-20 00:33:49,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:49,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901209420] [2023-12-20 00:33:49,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:49,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:49,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:49,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:33:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:49,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 00:33:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:49,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:33:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:49,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 00:33:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:49,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-20 00:33:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:49,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 00:33:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:49,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 00:33:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:49,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-20 00:33:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:49,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 00:33:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:49,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 00:33:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-12-20 00:33:49,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:49,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901209420] [2023-12-20 00:33:49,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901209420] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:49,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441250526] [2023-12-20 00:33:49,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:49,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:49,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:49,781 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:49,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-12-20 00:33:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:49,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-20 00:33:49,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-20 00:33:49,955 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 00:33:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-20 00:33:50,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441250526] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 00:33:50,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 00:33:50,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2023-12-20 00:33:50,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848844065] [2023-12-20 00:33:50,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 00:33:50,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 00:33:50,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:50,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 00:33:50,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-20 00:33:50,118 INFO L87 Difference]: Start difference. First operand 6201 states and 9087 transitions. Second operand has 13 states, 13 states have (on average 14.23076923076923) internal successors, (185), 10 states have internal predecessors, (185), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2023-12-20 00:33:52,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:52,291 INFO L93 Difference]: Finished difference Result 16778 states and 24678 transitions. [2023-12-20 00:33:52,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-12-20 00:33:52,291 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 14.23076923076923) internal successors, (185), 10 states have internal predecessors, (185), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 123 [2023-12-20 00:33:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:52,310 INFO L225 Difference]: With dead ends: 16778 [2023-12-20 00:33:52,311 INFO L226 Difference]: Without dead ends: 10714 [2023-12-20 00:33:52,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 292 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=735, Invalid=2805, Unknown=0, NotChecked=0, Total=3540 [2023-12-20 00:33:52,321 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 2215 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2222 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:52,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2222 Valid, 381 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-20 00:33:52,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10714 states. [2023-12-20 00:33:52,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10714 to 9614. [2023-12-20 00:33:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9614 states, 7890 states have (on average 1.2667934093789608) internal successors, (9995), 8382 states have internal predecessors, (9995), 675 states have call successors, (675), 565 states have call predecessors, (675), 1048 states have return successors, (2589), 674 states have call predecessors, (2589), 675 states have call successors, (2589) [2023-12-20 00:33:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 13259 transitions. [2023-12-20 00:33:52,724 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 13259 transitions. Word has length 123 [2023-12-20 00:33:52,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:52,725 INFO L495 AbstractCegarLoop]: Abstraction has 9614 states and 13259 transitions. [2023-12-20 00:33:52,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.23076923076923) internal successors, (185), 10 states have internal predecessors, (185), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2023-12-20 00:33:52,725 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 13259 transitions. [2023-12-20 00:33:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-20 00:33:52,731 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 00:33:52,731 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:33:52,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:52,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-12-20 00:33:52,936 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 00:33:52,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 00:33:52,936 INFO L85 PathProgramCache]: Analyzing trace with hash 742131714, now seen corresponding path program 1 times [2023-12-20 00:33:52,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 00:33:52,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001140762] [2023-12-20 00:33:52,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:52,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 00:33:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:52,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 00:33:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:53,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 00:33:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:53,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 00:33:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:53,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 00:33:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:53,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 00:33:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:53,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-20 00:33:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:53,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 00:33:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:53,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 00:33:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:53,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-20 00:33:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:53,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 00:33:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:53,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 00:33:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-20 00:33:53,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 00:33:53,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001140762] [2023-12-20 00:33:53,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001140762] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 00:33:53,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319566778] [2023-12-20 00:33:53,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 00:33:53,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:53,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 00:33:53,055 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 00:33:53,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-20 00:33:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 00:33:53,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 00:33:53,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 00:33:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 00:33:53,218 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 00:33:53,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319566778] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 00:33:53,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 00:33:53,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2023-12-20 00:33:53,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508750960] [2023-12-20 00:33:53,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 00:33:53,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 00:33:53,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 00:33:53,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 00:33:53,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-20 00:33:53,219 INFO L87 Difference]: Start difference. First operand 9614 states and 13259 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 00:33:53,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 00:33:53,380 INFO L93 Difference]: Finished difference Result 12403 states and 16880 transitions. [2023-12-20 00:33:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 00:33:53,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2023-12-20 00:33:53,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 00:33:53,381 INFO L225 Difference]: With dead ends: 12403 [2023-12-20 00:33:53,381 INFO L226 Difference]: Without dead ends: 0 [2023-12-20 00:33:53,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-20 00:33:53,392 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 241 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 00:33:53,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 118 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 00:33:53,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-20 00:33:53,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-20 00:33:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 00:33:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-20 00:33:53,393 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2023-12-20 00:33:53,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 00:33:53,393 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-20 00:33:53,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-20 00:33:53,393 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-20 00:33:53,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-20 00:33:53,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 00:33:53,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-12-20 00:33:53,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 00:33:53,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-20 00:34:04,794 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 383 398) the Hoare annotation is: (let ((.cse0 (= ~comp_m1_st~0 |old(~comp_m1_st~0)|)) (.cse1 (< ~b1_val_t~0 1)) (.cse2 (not (= ~z_val~0 0))) (.cse3 (< ~z_ev~0 2)) (.cse4 (< ~d1_val_t~0 1)) (.cse5 (< ~b0_val~0 ~b0_val_t~0)) (.cse6 (< ~b0_val_t~0 1)) (.cse7 (not (= 0 ~z_val_t~0))) (.cse8 (< ~d1_val~0 ~d1_val_t~0)) (.cse9 (< ~d0_val_t~0 1)) (.cse10 (< 0 ~comp_m1_i~0)) (.cse11 (< ~d0_val~0 ~d0_val_t~0)) (.cse12 (< ~b1_val~0 ~b1_val_t~0))) (and (or .cse0 (< ~b0_ev~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 (not (= ~b0_ev~0 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2023-12-20 00:34:04,794 INFO L899 garLoopResultBuilder]: For program point L129(lines 106 131) no Hoare annotation was computed. [2023-12-20 00:34:04,794 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2023-12-20 00:34:04,794 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 125) no Hoare annotation was computed. [2023-12-20 00:34:04,794 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2023-12-20 00:34:04,794 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 127) no Hoare annotation was computed. [2023-12-20 00:34:04,794 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 383 398) no Hoare annotation was computed. [2023-12-20 00:34:04,794 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2023-12-20 00:34:04,794 INFO L899 garLoopResultBuilder]: For program point L390-2(lines 383 398) no Hoare annotation was computed. [2023-12-20 00:34:04,794 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 264 278) no Hoare annotation was computed. [2023-12-20 00:34:04,794 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 273) no Hoare annotation was computed. [2023-12-20 00:34:04,795 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 264 278) the Hoare annotation is: true [2023-12-20 00:34:04,795 INFO L899 garLoopResultBuilder]: For program point L275(lines 267 277) no Hoare annotation was computed. [2023-12-20 00:34:04,795 INFO L899 garLoopResultBuilder]: For program point L341-1(lines 317 349) no Hoare annotation was computed. [2023-12-20 00:34:04,795 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 320 348) no Hoare annotation was computed. [2023-12-20 00:34:04,795 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 317 349) the Hoare annotation is: (let ((.cse22 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse23 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse24 (= |old(~z_ev~0)| ~z_ev~0)) (.cse25 (= |old(~b1_ev~0)| ~b1_ev~0))) (let ((.cse2 (< |old(~b1_ev~0)| 2)) (.cse0 (not (= |old(~b0_ev~0)| 0))) (.cse10 (and .cse22 .cse23 .cse24 (= ~b0_ev~0 0) .cse25)) (.cse3 (< 0 |old(~d1_ev~0)|)) (.cse9 (< 0 |old(~d0_ev~0)|)) (.cse21 (< |old(~d0_ev~0)| 2)) (.cse1 (< ~b1_val_t~0 1)) (.cse17 (and .cse22 (= ~b0_ev~0 |old(~b0_ev~0)|) .cse23 .cse24 .cse25)) (.cse4 (not (= ~z_val~0 0))) (.cse5 (< ~d1_val_t~0 1)) (.cse6 (< ~b0_val~0 ~b0_val_t~0)) (.cse7 (< |old(~z_ev~0)| 2)) (.cse8 (< ~b0_val_t~0 1)) (.cse11 (not (= 0 ~z_val_t~0))) (.cse12 (< ~d1_val~0 ~d1_val_t~0)) (.cse13 (< ~d0_val_t~0 1)) (.cse14 (< 0 ~comp_m1_i~0)) (.cse20 (< 0 |old(~b1_ev~0)|)) (.cse15 (< ~d0_val~0 ~d0_val_t~0)) (.cse18 (< |old(~d1_ev~0)| 2)) (.cse19 (< |old(~b0_ev~0)| 2)) (.cse16 (< ~b1_val~0 ~b1_val_t~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse16) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse18 .cse16) (or .cse21 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse16) (or .cse21 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse16) (or .cse21 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse16) (or .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16) (or .cse21 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse16) (or .cse1 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse18 .cse19 .cse16) (or .cse21 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse16) (or .cse21 .cse1 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse19 .cse16) (or .cse21 .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse18 .cse16) (or .cse1 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse19 .cse16) (or .cse21 .cse1 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse20 .cse15 .cse18 .cse19 .cse16)))) [2023-12-20 00:34:04,795 INFO L899 garLoopResultBuilder]: For program point L321-1(lines 320 348) no Hoare annotation was computed. [2023-12-20 00:34:04,795 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 317 349) no Hoare annotation was computed. [2023-12-20 00:34:04,795 INFO L899 garLoopResultBuilder]: For program point L336-1(lines 320 348) no Hoare annotation was computed. [2023-12-20 00:34:04,795 INFO L899 garLoopResultBuilder]: For program point L326-1(lines 320 348) no Hoare annotation was computed. [2023-12-20 00:34:04,795 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2023-12-20 00:34:04,795 INFO L899 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2023-12-20 00:34:04,796 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 211 249) no Hoare annotation was computed. [2023-12-20 00:34:04,796 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 157) no Hoare annotation was computed. [2023-12-20 00:34:04,796 INFO L899 garLoopResultBuilder]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2023-12-20 00:34:04,796 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 208 250) no Hoare annotation was computed. [2023-12-20 00:34:04,796 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 211 249) no Hoare annotation was computed. [2023-12-20 00:34:04,796 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 187) no Hoare annotation was computed. [2023-12-20 00:34:04,796 INFO L899 garLoopResultBuilder]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2023-12-20 00:34:04,796 INFO L899 garLoopResultBuilder]: For program point L240-1(lines 208 250) no Hoare annotation was computed. [2023-12-20 00:34:04,796 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 208 250) the Hoare annotation is: (let ((.cse20 (= |old(~d1_val~0)| ~d1_val~0)) (.cse21 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse22 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse23 (= ~b1_val~0 |old(~b1_val~0)|)) (.cse24 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse25 (= ~z_val~0 0)) (.cse26 (= |old(~z_ev~0)| ~z_ev~0)) (.cse27 (= |old(~d0_val~0)| ~d0_val~0)) (.cse28 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse29 (= |old(~b1_ev~0)| ~b1_ev~0))) (let ((.cse18 (< 0 |old(~b1_ev~0)|)) (.cse5 (< 0 |old(~d1_ev~0)|)) (.cse17 (< 0 |old(~d0_ev~0)|)) (.cse0 (< |old(~d0_ev~0)| 2)) (.cse1 (and .cse20 .cse21 (= ~b0_req_up~0 |old(~b0_req_up~0)|) .cse22 .cse23 (= |old(~d0_req_up~0)| ~d0_req_up~0) .cse24 .cse25 .cse26 .cse27 (= |old(~b1_req_up~0)| ~b1_req_up~0) .cse28 .cse29 (= |old(~b0_val~0)| ~b0_val~0) (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (.cse2 (< ~b1_val_t~0 1)) (.cse3 (< |old(~b1_ev~0)| 2)) (.cse4 (not (= |old(~z_val~0)| 0))) (.cse6 (< |old(~d0_val~0)| ~d0_val_t~0)) (.cse7 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse8 (< ~d1_val_t~0 1)) (.cse9 (< |old(~z_ev~0)| 2)) (.cse10 (< ~b0_val_t~0 1)) (.cse11 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse12 (not (= 0 ~z_val_t~0))) (.cse13 (< ~d0_val_t~0 1)) (.cse14 (< 0 ~comp_m1_i~0)) (.cse15 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse19 (< |old(~d1_ev~0)| 2)) (.cse16 (< |old(~b0_ev~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse16) (or (not (= ~comp_m1_st~0 0)) .cse0 (and (= ~b0_req_up~0 1) .cse20 .cse21 .cse22 (= ~d0_req_up~0 1) .cse23 (= ~b0_val~0 0) .cse24 .cse25 .cse26 .cse27 (= ~d1_req_up~0 1) .cse28 .cse29 (= 1 ~b1_req_up~0)) .cse2 .cse3 (not (= |old(~d0_req_up~0)| 1)) .cse4 .cse8 (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) .cse9 (not (= |old(~b1_req_up~0)| 1)) .cse12 .cse13 .cse14 .cse19 .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse18 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16)))) [2023-12-20 00:34:04,796 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 142) no Hoare annotation was computed. [2023-12-20 00:34:04,797 INFO L899 garLoopResultBuilder]: For program point L137-2(lines 137 142) no Hoare annotation was computed. [2023-12-20 00:34:04,797 INFO L899 garLoopResultBuilder]: For program point L212-1(lines 211 249) no Hoare annotation was computed. [2023-12-20 00:34:04,797 INFO L899 garLoopResultBuilder]: For program point L233-1(lines 211 249) no Hoare annotation was computed. [2023-12-20 00:34:04,797 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2023-12-20 00:34:04,797 INFO L899 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2023-12-20 00:34:04,797 INFO L899 garLoopResultBuilder]: For program point L374-1(lines 350 382) no Hoare annotation was computed. [2023-12-20 00:34:04,797 INFO L899 garLoopResultBuilder]: For program point L364-1(lines 353 381) no Hoare annotation was computed. [2023-12-20 00:34:04,797 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 350 382) the Hoare annotation is: (let ((.cse20 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse24 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse21 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse22 (= |old(~z_ev~0)| ~z_ev~0)) (.cse23 (= |old(~b1_ev~0)| ~b1_ev~0))) (let ((.cse1 (< |old(~b1_ev~0)| 2)) (.cse18 (< 0 |old(~d1_ev~0)|)) (.cse8 (< 0 |old(~d0_ev~0)|)) (.cse17 (< |old(~d0_ev~0)| 2)) (.cse2 (and .cse20 .cse24 .cse21 .cse22 .cse23)) (.cse25 (< 0 |old(~b1_ev~0)|)) (.cse14 (< |old(~d1_ev~0)| 2)) (.cse19 (not (= ~comp_m1_st~0 0))) (.cse0 (< ~b1_val_t~0 1)) (.cse3 (not (= ~z_val~0 0))) (.cse4 (< ~d1_val_t~0 1)) (.cse5 (< ~b0_val~0 ~b0_val_t~0)) (.cse6 (< |old(~z_ev~0)| 2)) (.cse7 (< ~b0_val_t~0 1)) (.cse9 (not (= 0 ~z_val_t~0))) (.cse10 (< ~d1_val~0 ~d1_val_t~0)) (.cse11 (< ~d0_val_t~0 1)) (.cse12 (< 0 ~comp_m1_i~0)) (.cse13 (< ~d0_val~0 ~d0_val_t~0)) (.cse15 (< |old(~b0_ev~0)| 2)) (.cse16 (< ~b1_val~0 ~b1_val_t~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (or .cse19 .cse0 .cse3 .cse4 .cse5 (and .cse20 (= ~b0_ev~0 1) .cse21 .cse22 .cse23) .cse6 .cse7 (not (= |old(~b0_ev~0)| 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse16) (or .cse19 (not (= |old(~b1_ev~0)| 1)) .cse0 .cse3 .cse4 .cse5 .cse6 (and .cse20 .cse24 (= ~b1_ev~0 1) .cse21 .cse22) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (or .cse19 (not (= |old(~d0_ev~0)| 1)) .cse0 (and .cse20 .cse24 (= ~d0_ev~0 1) .cse22 .cse23) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse15 .cse16) (or .cse0 .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse15 .cse16) (or .cse17 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16) (or .cse19 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= |old(~d1_ev~0)| 1)) .cse15 (and .cse24 .cse21 .cse22 (= ~d1_ev~0 1) .cse23) .cse16)))) [2023-12-20 00:34:04,797 INFO L899 garLoopResultBuilder]: For program point L354-1(lines 353 381) no Hoare annotation was computed. [2023-12-20 00:34:04,797 INFO L899 garLoopResultBuilder]: For program point L369-1(lines 353 381) no Hoare annotation was computed. [2023-12-20 00:34:04,797 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 350 382) no Hoare annotation was computed. [2023-12-20 00:34:04,797 INFO L899 garLoopResultBuilder]: For program point L359-1(lines 353 381) no Hoare annotation was computed. [2023-12-20 00:34:04,798 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-20 00:34:04,798 INFO L899 garLoopResultBuilder]: For program point L440-1(line 440) no Hoare annotation was computed. [2023-12-20 00:34:04,798 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2023-12-20 00:34:04,798 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2023-12-20 00:34:04,798 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 51 101) no Hoare annotation was computed. [2023-12-20 00:34:04,798 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-20 00:34:04,798 INFO L895 garLoopResultBuilder]: At program point L432-1(lines 432 454) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-20 00:34:04,798 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2023-12-20 00:34:04,798 INFO L899 garLoopResultBuilder]: For program point L61(lines 51 101) no Hoare annotation was computed. [2023-12-20 00:34:04,798 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 418 460) no Hoare annotation was computed. [2023-12-20 00:34:04,798 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-12-20 00:34:04,799 INFO L895 garLoopResultBuilder]: At program point L425(line 425) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (<= 2 ~z_ev~0) (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (<= 1 ~d0_val_t~0) (= ~b0_val_t~0 1) (<= 2 ~d1_ev~0) (= ~d0_req_up~0 1) (= ~b0_val~0 0) (<= 2 ~d0_ev~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= 2 ~b0_ev~0) (= ~d1_req_up~0 1) (<= 1 ~d1_val_t~0) (= 1 ~b1_req_up~0)) [2023-12-20 00:34:04,799 INFO L899 garLoopResultBuilder]: For program point L425-1(line 425) no Hoare annotation was computed. [2023-12-20 00:34:04,799 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2023-12-20 00:34:04,799 INFO L899 garLoopResultBuilder]: For program point L79(lines 51 101) no Hoare annotation was computed. [2023-12-20 00:34:04,799 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-20 00:34:04,799 INFO L895 garLoopResultBuilder]: At program point L286(line 286) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-20 00:34:04,799 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2023-12-20 00:34:04,799 INFO L899 garLoopResultBuilder]: For program point L501-2(lines 501 507) no Hoare annotation was computed. [2023-12-20 00:34:04,799 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 84) no Hoare annotation was computed. [2023-12-20 00:34:04,799 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse3 (<= ~b1_ev~0 0)) (.cse7 (<= 2 ~d1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-20 00:34:04,800 INFO L895 garLoopResultBuilder]: At program point L427-1(line 427) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (<= 2 ~z_ev~0) (= 0 ~z_val_t~0) (= ~b0_ev~0 1) (<= ~d0_val_t~0 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= 1 ~b0_val_t~0) (<= ~b1_val_t~0 ~b1_val~0) (<= ~b0_val_t~0 ~b0_val~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= ~d1_val_t~0 ~d1_val~0) (<= 1 ~d1_val_t~0)) [2023-12-20 00:34:04,800 INFO L895 garLoopResultBuilder]: At program point L295(lines 285 310) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-20 00:34:04,800 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 279 316) no Hoare annotation was computed. [2023-12-20 00:34:04,800 INFO L895 garLoopResultBuilder]: At program point L444(line 444) the Hoare annotation is: (let ((.cse3 (<= ~b1_ev~0 0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse7 (<= 2 ~d1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse19 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (= ~b0_ev~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-20 00:34:04,801 INFO L895 garLoopResultBuilder]: At program point L444-1(line 444) the Hoare annotation is: (let ((.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (<= ~d0_val_t~0 ~d0_val~0)) (.cse4 (<= 1 ~d0_val_t~0)) (.cse5 (<= 1 ~b0_val_t~0)) (.cse6 (<= ~b1_val_t~0 ~b1_val~0)) (.cse7 (<= ~b0_val_t~0 ~b0_val~0)) (.cse8 (<= 1 ~b1_val_t~0)) (.cse9 (= ~z_val~0 0)) (.cse10 (<= ~d1_val_t~0 ~d1_val~0)) (.cse11 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 (= ~b0_ev~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 2 ~b0_ev~0) .cse11))) [2023-12-20 00:34:04,801 INFO L895 garLoopResultBuilder]: At program point L428(line 428) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (<= 2 ~z_ev~0) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (= ~b0_ev~0 1) (<= ~d0_val_t~0 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= 1 ~b0_val_t~0) (<= ~b1_val_t~0 ~b1_val~0) (<= ~b0_val_t~0 ~b0_val~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= ~d1_val_t~0 ~d1_val~0) (<= 1 ~d1_val_t~0)) [2023-12-20 00:34:04,801 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2023-12-20 00:34:04,801 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 51 101) no Hoare annotation was computed. [2023-12-20 00:34:04,801 INFO L899 garLoopResultBuilder]: For program point L288(line 288) no Hoare annotation was computed. [2023-12-20 00:34:04,801 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2023-12-20 00:34:04,801 INFO L899 garLoopResultBuilder]: For program point L255-2(lines 251 263) no Hoare annotation was computed. [2023-12-20 00:34:04,801 INFO L895 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse18 (= ~comp_m1_st~0 0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse19 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse18 (= ~b0_ev~0 1) .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse19 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-20 00:34:04,801 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-20 00:34:04,801 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-20 00:34:04,801 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2023-12-20 00:34:04,802 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2023-12-20 00:34:04,802 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 88 96) no Hoare annotation was computed. [2023-12-20 00:34:04,802 INFO L895 garLoopResultBuilder]: At program point L405(line 405) the Hoare annotation is: (let ((.cse7 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse18 (<= ~d1_ev~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2023-12-20 00:34:04,802 INFO L899 garLoopResultBuilder]: For program point L405-1(line 405) no Hoare annotation was computed. [2023-12-20 00:34:04,802 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2023-12-20 00:34:04,802 INFO L899 garLoopResultBuilder]: For program point L290-1(lines 285 310) no Hoare annotation was computed. [2023-12-20 00:34:04,802 INFO L899 garLoopResultBuilder]: For program point L414(lines 403 416) no Hoare annotation was computed. [2023-12-20 00:34:04,802 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 306) no Hoare annotation was computed. [2023-12-20 00:34:04,806 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 00:34:04,807 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 00:34:04,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 12:34:04 BoogieIcfgContainer [2023-12-20 00:34:04,834 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 00:34:04,835 INFO L158 Benchmark]: Toolchain (without parser) took 44867.88ms. Allocated memory was 246.4MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 192.1MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-12-20 00:34:04,835 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 166.7MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 00:34:04,835 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.23ms. Allocated memory is still 246.4MB. Free memory was 192.1MB in the beginning and 178.2MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-20 00:34:04,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.96ms. Allocated memory is still 246.4MB. Free memory was 178.2MB in the beginning and 176.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 00:34:04,835 INFO L158 Benchmark]: Boogie Preprocessor took 27.90ms. Allocated memory is still 246.4MB. Free memory was 176.1MB in the beginning and 173.6MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 00:34:04,835 INFO L158 Benchmark]: RCFGBuilder took 378.46ms. Allocated memory is still 246.4MB. Free memory was 173.6MB in the beginning and 151.2MB in the end (delta: 22.4MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-20 00:34:04,835 INFO L158 Benchmark]: TraceAbstraction took 44233.54ms. Allocated memory was 246.4MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 150.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-12-20 00:34:04,836 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.08ms. Allocated memory is still 166.7MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.23ms. Allocated memory is still 246.4MB. Free memory was 192.1MB in the beginning and 178.2MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.96ms. Allocated memory is still 246.4MB. Free memory was 178.2MB in the beginning and 176.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.90ms. Allocated memory is still 246.4MB. Free memory was 176.1MB in the beginning and 173.6MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 378.46ms. Allocated memory is still 246.4MB. Free memory was 173.6MB in the beginning and 151.2MB in the end (delta: 22.4MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 44233.54ms. Allocated memory was 246.4MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 150.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.2s, OverallIterations: 34, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6047 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6001 mSDsluCounter, 10791 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6807 mSDsCounter, 696 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5788 IncrementalHoareTripleChecker+Invalid, 6484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 696 mSolverCounterUnsat, 3984 mSDtfsCounter, 5788 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4245 GetRequests, 3861 SyntacticMatches, 4 SemanticMatches, 380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1462 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9614occurred in iteration=33, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 7458 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 10741 PreInvPairs, 11047 NumberOfFragments, 6700 HoareAnnotationTreeSize, 10741 FormulaSimplifications, 7239 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 17 FormulaSimplificationsInter, 37640 FormulaSimplificationTreeSizeReductionInter, 9.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 6679 NumberOfCodeBlocks, 6626 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 6736 ConstructedInterpolants, 0 QuantifiedInterpolants, 15288 SizeOfPredicates, 10 NumberOfNonLiveVariables, 14397 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 66 InterpolantComputations, 33 PerfectInterpolantSequences, 2079/2293 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) RESULT: Ultimate proved your program to be correct! [2023-12-20 00:34:04,869 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...