./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/systemc/bist_cell.cil.c --full-output --preprocessor.use.memory.slicer false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/systemc/bist_cell.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:17:24,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:17:24,731 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 21:17:24,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:17:24,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:17:24,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:17:24,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:17:24,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:17:24,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:17:24,764 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:17:24,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:17:24,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:17:24,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:17:24,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:17:24,767 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:17:24,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:17:24,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:17:24,767 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 21:17:24,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 21:17:24,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 21:17:24,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:17:24,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:17:24,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:17:24,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:17:24,770 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 21:17:24,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:17:24,770 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:17:24,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:17:24,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:17:24,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:17:24,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:17:24,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:17:24,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:17:24,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:17:24,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:17:24,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 21:17:24,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 21:17:24,773 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:17:24,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:17:24,773 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:17:24,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:17:24,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:17:24,774 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 21:17:25,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:17:25,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:17:25,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:17:25,038 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:17:25,039 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:17:25,040 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-11-22 21:17:26,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:17:26,333 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:17:26,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c [2023-11-22 21:17:26,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b83fcfb9/3cac02cdea574a3a8deaaea5ae971be6/FLAGce7d0fbfa [2023-11-22 21:17:26,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b83fcfb9/3cac02cdea574a3a8deaaea5ae971be6 [2023-11-22 21:17:26,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:17:26,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:17:26,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:17:26,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:17:26,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:17:26,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:17:26" (1/1) ... [2023-11-22 21:17:26,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dce62a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:26, skipping insertion in model container [2023-11-22 21:17:26,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:17:26" (1/1) ... [2023-11-22 21:17:26,434 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:17:26,540 WARN L240 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-11-22 21:17:26,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:17:26,610 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:17:26,619 WARN L240 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-11-22 21:17:26,650 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:17:26,667 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:17:26,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:26 WrapperNode [2023-11-22 21:17:26,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:17:26,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:17:26,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:17:26,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:17:26,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:26" (1/1) ... [2023-11-22 21:17:26,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:26" (1/1) ... [2023-11-22 21:17:26,714 INFO L138 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 229 [2023-11-22 21:17:26,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:17:26,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:17:26,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:17:26,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:17:26,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:26" (1/1) ... [2023-11-22 21:17:26,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:26" (1/1) ... [2023-11-22 21:17:26,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:26" (1/1) ... [2023-11-22 21:17:26,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:26" (1/1) ... [2023-11-22 21:17:26,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:26" (1/1) ... [2023-11-22 21:17:26,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:26" (1/1) ... [2023-11-22 21:17:26,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:26" (1/1) ... [2023-11-22 21:17:26,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:26" (1/1) ... [2023-11-22 21:17:26,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:17:26,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:17:26,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:17:26,763 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:17:26,764 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:26" (1/1) ... [2023-11-22 21:17:26,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:17:26,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:26,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 21:17:26,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 21:17:26,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:17:26,839 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-22 21:17:26,839 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-22 21:17:26,839 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-22 21:17:26,839 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-22 21:17:26,839 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-22 21:17:26,839 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-22 21:17:26,839 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-22 21:17:26,839 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-22 21:17:26,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 21:17:26,840 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-22 21:17:26,841 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-22 21:17:26,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:17:26,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:17:26,891 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:17:26,893 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:17:27,166 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:17:27,215 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:17:27,215 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-22 21:17:27,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:17:27 BoogieIcfgContainer [2023-11-22 21:17:27,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:17:27,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:17:27,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:17:27,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:17:27,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:17:26" (1/3) ... [2023-11-22 21:17:27,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf2c470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:17:27, skipping insertion in model container [2023-11-22 21:17:27,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:17:26" (2/3) ... [2023-11-22 21:17:27,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf2c470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:17:27, skipping insertion in model container [2023-11-22 21:17:27,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:17:27" (3/3) ... [2023-11-22 21:17:27,224 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2023-11-22 21:17:27,237 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:17:27,238 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 21:17:27,277 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:17:27,282 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;@57665f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:17:27,283 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 21:17:27,287 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-11-22 21:17:27,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-22 21:17:27,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:27,294 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-11-22 21:17:27,295 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:27,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:27,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1929751186, now seen corresponding path program 1 times [2023-11-22 21:17:27,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:27,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340187099] [2023-11-22 21:17:27,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:27,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:27,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:27,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 21:17:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:27,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:17:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:27,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-22 21:17:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:17:27,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:27,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340187099] [2023-11-22 21:17:27,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340187099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:27,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:17:27,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-22 21:17:27,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748925002] [2023-11-22 21:17:27,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:27,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 21:17:27,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:27,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 21:17:27,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-22 21:17:27,806 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-11-22 21:17:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:28,401 INFO L93 Difference]: Finished difference Result 246 states and 393 transitions. [2023-11-22 21:17:28,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-22 21:17:28,404 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-11-22 21:17:28,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:28,411 INFO L225 Difference]: With dead ends: 246 [2023-11-22 21:17:28,411 INFO L226 Difference]: Without dead ends: 158 [2023-11-22 21:17:28,414 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-11-22 21:17:28,416 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-11-22 21:17:28,417 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-11-22 21:17:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-22 21:17:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 101. [2023-11-22 21:17:28,481 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-11-22 21:17:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2023-11-22 21:17:28,483 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 39 [2023-11-22 21:17:28,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:28,483 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2023-11-22 21:17:28,484 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-11-22 21:17:28,484 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2023-11-22 21:17:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-22 21:17:28,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:28,487 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-11-22 21:17:28,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 21:17:28,487 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:28,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:28,488 INFO L85 PathProgramCache]: Analyzing trace with hash -609134686, now seen corresponding path program 1 times [2023-11-22 21:17:28,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:28,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051934170] [2023-11-22 21:17:28,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:28,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:28,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:28,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 21:17:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:28,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:17:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:28,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 21:17:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:28,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-22 21:17:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:28,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:17:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:28,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 21:17:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:28,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 21:17:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:28,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 21:17:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:28,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-22 21:17:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 21:17:28,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:28,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051934170] [2023-11-22 21:17:28,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051934170] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:28,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002669548] [2023-11-22 21:17:28,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:28,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:28,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:28,703 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-11-22 21:17:28,716 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-11-22 21:17:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:28,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 21:17:28,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 21:17:28,859 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:28,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002669548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:28,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:28,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-11-22 21:17:28,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919775528] [2023-11-22 21:17:28,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:28,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:17:28,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:28,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:17:28,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 21:17:28,862 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-11-22 21:17:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:28,881 INFO L93 Difference]: Finished difference Result 194 states and 298 transitions. [2023-11-22 21:17:28,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:17:28,881 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-11-22 21:17:28,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:28,882 INFO L225 Difference]: With dead ends: 194 [2023-11-22 21:17:28,883 INFO L226 Difference]: Without dead ends: 101 [2023-11-22 21:17:28,883 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-11-22 21:17:28,884 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-11-22 21:17:28,884 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-11-22 21:17:28,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-22 21:17:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-22 21:17:28,892 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-11-22 21:17:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 154 transitions. [2023-11-22 21:17:28,893 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 154 transitions. Word has length 92 [2023-11-22 21:17:28,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:28,893 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 154 transitions. [2023-11-22 21:17:28,894 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-11-22 21:17:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 154 transitions. [2023-11-22 21:17:28,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-22 21:17:28,896 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:28,896 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-11-22 21:17:28,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-22 21:17:29,107 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-11-22 21:17:29,108 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:29,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:29,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1751637152, now seen corresponding path program 1 times [2023-11-22 21:17:29,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:29,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737358745] [2023-11-22 21:17:29,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:29,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 21:17:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:17:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 21:17:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-22 21:17:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:17:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 21:17:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 21:17:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 21:17:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-22 21:17:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 21:17:29,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:29,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737358745] [2023-11-22 21:17:29,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737358745] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:29,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875881494] [2023-11-22 21:17:29,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:29,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:29,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:29,265 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-11-22 21:17:29,267 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-11-22 21:17:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 21:17:29,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-22 21:17:29,444 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:29,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875881494] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:29,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:29,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 21:17:29,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816061098] [2023-11-22 21:17:29,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:29,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:17:29,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:29,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:17:29,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:17:29,447 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-11-22 21:17:29,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:29,582 INFO L93 Difference]: Finished difference Result 302 states and 471 transitions. [2023-11-22 21:17:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:17:29,583 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-11-22 21:17:29,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:29,584 INFO L225 Difference]: With dead ends: 302 [2023-11-22 21:17:29,585 INFO L226 Difference]: Without dead ends: 211 [2023-11-22 21:17:29,585 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-11-22 21:17:29,586 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-11-22 21:17:29,587 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-11-22 21:17:29,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-22 21:17:29,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 198. [2023-11-22 21:17:29,604 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-11-22 21:17:29,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 306 transitions. [2023-11-22 21:17:29,605 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 306 transitions. Word has length 92 [2023-11-22 21:17:29,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:29,606 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 306 transitions. [2023-11-22 21:17:29,606 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-11-22 21:17:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 306 transitions. [2023-11-22 21:17:29,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-22 21:17:29,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:29,609 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-11-22 21:17:29,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 21:17:29,820 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-11-22 21:17:29,821 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:29,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:29,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1617302816, now seen corresponding path program 1 times [2023-11-22 21:17:29,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:29,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279919635] [2023-11-22 21:17:29,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:29,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 21:17:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:17:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 21:17:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-22 21:17:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:17:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 21:17:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 21:17:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 21:17:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-22 21:17:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 21:17:29,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:29,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279919635] [2023-11-22 21:17:29,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279919635] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:29,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493260749] [2023-11-22 21:17:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:29,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:29,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:29,963 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-11-22 21:17:29,970 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-11-22 21:17:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:30,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 21:17:30,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-22 21:17:30,099 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:30,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493260749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:30,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:30,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 21:17:30,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490499237] [2023-11-22 21:17:30,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:30,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:17:30,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:30,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:17:30,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:17:30,101 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-11-22 21:17:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:30,239 INFO L93 Difference]: Finished difference Result 593 states and 936 transitions. [2023-11-22 21:17:30,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:17:30,240 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-11-22 21:17:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:30,242 INFO L225 Difference]: With dead ends: 593 [2023-11-22 21:17:30,242 INFO L226 Difference]: Without dead ends: 409 [2023-11-22 21:17:30,244 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-11-22 21:17:30,244 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-11-22 21:17:30,245 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-11-22 21:17:30,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-11-22 21:17:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 395. [2023-11-22 21:17:30,293 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-11-22 21:17:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 620 transitions. [2023-11-22 21:17:30,299 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 620 transitions. Word has length 92 [2023-11-22 21:17:30,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:30,299 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 620 transitions. [2023-11-22 21:17:30,299 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-11-22 21:17:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 620 transitions. [2023-11-22 21:17:30,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-22 21:17:30,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:30,308 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-11-22 21:17:30,319 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-11-22 21:17:30,519 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-11-22 21:17:30,520 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:30,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:30,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1468221796, now seen corresponding path program 1 times [2023-11-22 21:17:30,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:30,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647726186] [2023-11-22 21:17:30,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:30,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:30,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:30,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 21:17:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:30,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:17:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 21:17:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:30,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-22 21:17:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:30,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:17:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:30,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 21:17:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:30,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 21:17:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:30,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 21:17:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:30,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-22 21:17:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:30,690 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 21:17:30,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:30,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647726186] [2023-11-22 21:17:30,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647726186] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:30,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119157553] [2023-11-22 21:17:30,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:30,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:30,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:30,709 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-11-22 21:17:30,728 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-11-22 21:17:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:30,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 21:17:30,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-22 21:17:30,864 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:30,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119157553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:30,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:30,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 21:17:30,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378687688] [2023-11-22 21:17:30,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:30,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:17:30,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:30,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:17:30,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:17:30,867 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-11-22 21:17:31,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:31,023 INFO L93 Difference]: Finished difference Result 1308 states and 2136 transitions. [2023-11-22 21:17:31,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:17:31,024 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-11-22 21:17:31,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:31,031 INFO L225 Difference]: With dead ends: 1308 [2023-11-22 21:17:31,032 INFO L226 Difference]: Without dead ends: 935 [2023-11-22 21:17:31,033 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-11-22 21:17:31,035 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-11-22 21:17:31,036 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-11-22 21:17:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2023-11-22 21:17:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 863. [2023-11-22 21:17:31,089 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-11-22 21:17:31,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1386 transitions. [2023-11-22 21:17:31,093 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1386 transitions. Word has length 92 [2023-11-22 21:17:31,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:31,093 INFO L495 AbstractCegarLoop]: Abstraction has 863 states and 1386 transitions. [2023-11-22 21:17:31,093 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-11-22 21:17:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1386 transitions. [2023-11-22 21:17:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-22 21:17:31,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:31,097 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-11-22 21:17:31,111 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-11-22 21:17:31,308 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-11-22 21:17:31,309 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:31,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:31,309 INFO L85 PathProgramCache]: Analyzing trace with hash -2131635018, now seen corresponding path program 1 times [2023-11-22 21:17:31,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:31,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006187585] [2023-11-22 21:17:31,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:31,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:31,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:31,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 21:17:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:31,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:17:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:31,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 21:17:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:31,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 21:17:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:31,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:17:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:31,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:17:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 21:17:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:31,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:17:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:31,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 21:17:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:17:31,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:31,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006187585] [2023-11-22 21:17:31,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006187585] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:31,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585458137] [2023-11-22 21:17:31,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:31,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:31,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:31,433 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-11-22 21:17:31,434 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-11-22 21:17:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:31,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 21:17:31,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-22 21:17:31,558 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:31,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585458137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:31,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:31,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 21:17:31,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913518269] [2023-11-22 21:17:31,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:31,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:17:31,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:31,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:17:31,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:17:31,560 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-11-22 21:17:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:31,775 INFO L93 Difference]: Finished difference Result 2816 states and 4760 transitions. [2023-11-22 21:17:31,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:17:31,776 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-11-22 21:17:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:31,783 INFO L225 Difference]: With dead ends: 2816 [2023-11-22 21:17:31,783 INFO L226 Difference]: Without dead ends: 1993 [2023-11-22 21:17:31,785 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-11-22 21:17:31,786 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-11-22 21:17:31,786 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-11-22 21:17:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2023-11-22 21:17:31,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1885. [2023-11-22 21:17:31,854 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-11-22 21:17:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 3148 transitions. [2023-11-22 21:17:31,862 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 3148 transitions. Word has length 94 [2023-11-22 21:17:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:31,863 INFO L495 AbstractCegarLoop]: Abstraction has 1885 states and 3148 transitions. [2023-11-22 21:17:31,863 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-11-22 21:17:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 3148 transitions. [2023-11-22 21:17:31,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-22 21:17:31,869 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:31,869 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-11-22 21:17:31,880 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-11-22 21:17:32,081 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-11-22 21:17:32,081 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:32,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:32,081 INFO L85 PathProgramCache]: Analyzing trace with hash -86155466, now seen corresponding path program 1 times [2023-11-22 21:17:32,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:32,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192814072] [2023-11-22 21:17:32,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:32,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 21:17:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:17:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 21:17:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 21:17:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:17:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:17:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 21:17:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:17:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 21:17:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:17:32,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:32,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192814072] [2023-11-22 21:17:32,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192814072] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:32,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910267723] [2023-11-22 21:17:32,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:32,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:32,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:32,172 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-11-22 21:17:32,218 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-11-22 21:17:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 21:17:32,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:17:32,299 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:32,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910267723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:32,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:32,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-11-22 21:17:32,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184054436] [2023-11-22 21:17:32,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:32,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:17:32,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:32,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:17:32,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-22 21:17:32,301 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-11-22 21:17:32,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:32,413 INFO L93 Difference]: Finished difference Result 4002 states and 6653 transitions. [2023-11-22 21:17:32,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:17:32,414 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-11-22 21:17:32,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:32,421 INFO L225 Difference]: With dead ends: 4002 [2023-11-22 21:17:32,422 INFO L226 Difference]: Without dead ends: 2221 [2023-11-22 21:17:32,425 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-11-22 21:17:32,426 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-11-22 21:17:32,426 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-11-22 21:17:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2023-11-22 21:17:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 1949. [2023-11-22 21:17:32,488 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-11-22 21:17:32,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 3228 transitions. [2023-11-22 21:17:32,496 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 3228 transitions. Word has length 94 [2023-11-22 21:17:32,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:32,496 INFO L495 AbstractCegarLoop]: Abstraction has 1949 states and 3228 transitions. [2023-11-22 21:17:32,496 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-11-22 21:17:32,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 3228 transitions. [2023-11-22 21:17:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-22 21:17:32,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:32,502 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-11-22 21:17:32,526 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-11-22 21:17:32,713 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-11-22 21:17:32,713 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:32,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:32,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1452184564, now seen corresponding path program 1 times [2023-11-22 21:17:32,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:32,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6336118] [2023-11-22 21:17:32,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:32,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 21:17:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:17:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 21:17:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 21:17:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:17:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:17:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 21:17:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:17:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 21:17:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:17:32,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:32,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6336118] [2023-11-22 21:17:32,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6336118] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:32,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812218241] [2023-11-22 21:17:32,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:32,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:32,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:32,857 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-11-22 21:17:32,876 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-11-22 21:17:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:32,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 21:17:32,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 21:17:32,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:32,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812218241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:32,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:32,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-22 21:17:32,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074304498] [2023-11-22 21:17:32,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:32,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:17:32,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:32,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:17:32,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 21:17:32,959 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-11-22 21:17:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:33,101 INFO L93 Difference]: Finished difference Result 4258 states and 7036 transitions. [2023-11-22 21:17:33,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:17:33,102 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-11-22 21:17:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:33,110 INFO L225 Difference]: With dead ends: 4258 [2023-11-22 21:17:33,111 INFO L226 Difference]: Without dead ends: 2413 [2023-11-22 21:17:33,114 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-11-22 21:17:33,115 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.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:17:33,115 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.1s Time] [2023-11-22 21:17:33,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2023-11-22 21:17:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2233. [2023-11-22 21:17:33,189 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-11-22 21:17:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 3639 transitions. [2023-11-22 21:17:33,197 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 3639 transitions. Word has length 94 [2023-11-22 21:17:33,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:33,198 INFO L495 AbstractCegarLoop]: Abstraction has 2233 states and 3639 transitions. [2023-11-22 21:17:33,198 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-11-22 21:17:33,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 3639 transitions. [2023-11-22 21:17:33,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-22 21:17:33,205 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:33,205 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-11-22 21:17:33,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-22 21:17:33,419 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-11-22 21:17:33,419 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:33,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:33,419 INFO L85 PathProgramCache]: Analyzing trace with hash 236030838, now seen corresponding path program 1 times [2023-11-22 21:17:33,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:33,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145878530] [2023-11-22 21:17:33,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:33,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:33,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 21:17:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:33,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:17:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:33,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 21:17:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:33,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 21:17:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:33,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:17:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:33,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 21:17:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:33,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 21:17:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:33,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:17:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:33,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 21:17:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:17:33,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:33,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145878530] [2023-11-22 21:17:33,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145878530] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:33,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619303368] [2023-11-22 21:17:33,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:33,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:33,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:33,585 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-11-22 21:17:33,608 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-11-22 21:17:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:33,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 21:17:33,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-22 21:17:33,731 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:33,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619303368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:33,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:33,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-11-22 21:17:33,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638423566] [2023-11-22 21:17:33,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:33,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:17:33,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:33,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:17:33,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:17:33,735 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-11-22 21:17:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:33,820 INFO L93 Difference]: Finished difference Result 4334 states and 7049 transitions. [2023-11-22 21:17:33,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:17:33,821 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-11-22 21:17:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:33,829 INFO L225 Difference]: With dead ends: 4334 [2023-11-22 21:17:33,829 INFO L226 Difference]: Without dead ends: 2297 [2023-11-22 21:17:33,833 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-11-22 21:17:33,834 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-11-22 21:17:33,834 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-11-22 21:17:33,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2023-11-22 21:17:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2265. [2023-11-22 21:17:33,912 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-11-22 21:17:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 3671 transitions. [2023-11-22 21:17:33,920 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 3671 transitions. Word has length 94 [2023-11-22 21:17:33,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:33,921 INFO L495 AbstractCegarLoop]: Abstraction has 2265 states and 3671 transitions. [2023-11-22 21:17:33,921 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-11-22 21:17:33,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 3671 transitions. [2023-11-22 21:17:33,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-22 21:17:33,927 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:33,927 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-11-22 21:17:33,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-22 21:17:34,139 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-11-22 21:17:34,139 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:34,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:34,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1971241955, now seen corresponding path program 1 times [2023-11-22 21:17:34,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:34,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544141345] [2023-11-22 21:17:34,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:34,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 21:17:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:17:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-22 21:17:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-22 21:17:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-22 21:17:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-22 21:17:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 21:17:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 21:17:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 21:17:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:17:34,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:34,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544141345] [2023-11-22 21:17:34,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544141345] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:34,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044056591] [2023-11-22 21:17:34,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:34,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:34,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:34,231 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-11-22 21:17:34,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-11-22 21:17:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 21:17:34,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:34,362 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 21:17:34,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:34,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044056591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:34,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:34,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-22 21:17:34,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884275495] [2023-11-22 21:17:34,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:34,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:17:34,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:34,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:17:34,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 21:17:34,365 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-11-22 21:17:34,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:34,447 INFO L93 Difference]: Finished difference Result 4634 states and 7890 transitions. [2023-11-22 21:17:34,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:17:34,448 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-11-22 21:17:34,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:34,459 INFO L225 Difference]: With dead ends: 4634 [2023-11-22 21:17:34,459 INFO L226 Difference]: Without dead ends: 2549 [2023-11-22 21:17:34,465 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-11-22 21:17:34,466 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-11-22 21:17:34,466 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-11-22 21:17:34,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2023-11-22 21:17:34,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2549. [2023-11-22 21:17:34,558 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-11-22 21:17:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 4221 transitions. [2023-11-22 21:17:34,567 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 4221 transitions. Word has length 96 [2023-11-22 21:17:34,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:34,567 INFO L495 AbstractCegarLoop]: Abstraction has 2549 states and 4221 transitions. [2023-11-22 21:17:34,568 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-11-22 21:17:34,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 4221 transitions. [2023-11-22 21:17:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-22 21:17:34,595 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:34,595 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-11-22 21:17:34,615 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-11-22 21:17:34,815 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-11-22 21:17:34,815 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:34,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1181222875, now seen corresponding path program 1 times [2023-11-22 21:17:34,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:34,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068569362] [2023-11-22 21:17:34,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:34,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 21:17:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:17:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-22 21:17:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-22 21:17:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-22 21:17:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-22 21:17:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 21:17:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 21:17:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 21:17:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:17:34,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:34,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068569362] [2023-11-22 21:17:34,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068569362] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:34,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756534510] [2023-11-22 21:17:34,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:34,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:34,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:34,927 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-11-22 21:17:34,960 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-11-22 21:17:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:35,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 21:17:35,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:17:35,073 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:35,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756534510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:35,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:35,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-22 21:17:35,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23345258] [2023-11-22 21:17:35,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:35,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:17:35,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:35,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:17:35,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:17:35,075 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-11-22 21:17:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:35,363 INFO L93 Difference]: Finished difference Result 7898 states and 13749 transitions. [2023-11-22 21:17:35,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:17:35,363 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-11-22 21:17:35,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:35,385 INFO L225 Difference]: With dead ends: 7898 [2023-11-22 21:17:35,385 INFO L226 Difference]: Without dead ends: 5577 [2023-11-22 21:17:35,391 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-11-22 21:17:35,392 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-11-22 21:17:35,392 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-11-22 21:17:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5577 states. [2023-11-22 21:17:35,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5577 to 5493. [2023-11-22 21:17:35,622 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-11-22 21:17:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5493 states to 5493 states and 9389 transitions. [2023-11-22 21:17:35,639 INFO L78 Accepts]: Start accepts. Automaton has 5493 states and 9389 transitions. Word has length 96 [2023-11-22 21:17:35,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:35,639 INFO L495 AbstractCegarLoop]: Abstraction has 5493 states and 9389 transitions. [2023-11-22 21:17:35,639 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-11-22 21:17:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 5493 states and 9389 transitions. [2023-11-22 21:17:35,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-22 21:17:35,659 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:35,659 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-11-22 21:17:35,685 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-11-22 21:17:35,870 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-11-22 21:17:35,870 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:35,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:35,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1860495129, now seen corresponding path program 1 times [2023-11-22 21:17:35,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:35,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168212780] [2023-11-22 21:17:35,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:35,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:35,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:36,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 21:17:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:36,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:17:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:36,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-22 21:17:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:36,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-22 21:17:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:36,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-22 21:17:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:36,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-22 21:17:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:36,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 21:17:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:36,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 21:17:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:36,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 21:17:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 21:17:36,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:36,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168212780] [2023-11-22 21:17:36,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168212780] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:36,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677919629] [2023-11-22 21:17:36,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:36,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:36,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:36,052 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-11-22 21:17:36,069 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-11-22 21:17:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:36,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 21:17:36,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 21:17:36,193 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:36,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677919629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:36,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:36,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 21:17:36,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038990447] [2023-11-22 21:17:36,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:36,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:17:36,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:36,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:17:36,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:17:36,195 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-11-22 21:17:36,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:36,424 INFO L93 Difference]: Finished difference Result 11994 states and 20213 transitions. [2023-11-22 21:17:36,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:17:36,424 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-11-22 21:17:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:36,465 INFO L225 Difference]: With dead ends: 11994 [2023-11-22 21:17:36,465 INFO L226 Difference]: Without dead ends: 6727 [2023-11-22 21:17:36,481 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-11-22 21:17:36,481 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-11-22 21:17:36,482 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-11-22 21:17:36,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6727 states. [2023-11-22 21:17:36,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6727 to 5493. [2023-11-22 21:17:36,765 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-11-22 21:17:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5493 states to 5493 states and 9388 transitions. [2023-11-22 21:17:36,781 INFO L78 Accepts]: Start accepts. Automaton has 5493 states and 9388 transitions. Word has length 96 [2023-11-22 21:17:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:36,781 INFO L495 AbstractCegarLoop]: Abstraction has 5493 states and 9388 transitions. [2023-11-22 21:17:36,782 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-11-22 21:17:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand 5493 states and 9388 transitions. [2023-11-22 21:17:36,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-22 21:17:36,803 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:36,803 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-11-22 21:17:36,817 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-11-22 21:17:37,017 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-11-22 21:17:37,018 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:37,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:37,018 INFO L85 PathProgramCache]: Analyzing trace with hash -315091207, now seen corresponding path program 1 times [2023-11-22 21:17:37,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:37,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614420132] [2023-11-22 21:17:37,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:37,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:37,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 21:17:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:37,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:17:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:37,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-22 21:17:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:37,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-22 21:17:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:37,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 21:17:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:37,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-22 21:17:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:37,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 21:17:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:37,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-22 21:17:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:37,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 21:17:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 21:17:37,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:37,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614420132] [2023-11-22 21:17:37,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614420132] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:37,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765539232] [2023-11-22 21:17:37,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:37,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:37,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:37,152 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-11-22 21:17:37,214 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-11-22 21:17:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:37,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 21:17:37,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 21:17:37,289 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:37,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765539232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:37,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:37,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-22 21:17:37,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333126639] [2023-11-22 21:17:37,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:37,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:17:37,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:37,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:17:37,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 21:17:37,292 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-11-22 21:17:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:37,453 INFO L93 Difference]: Finished difference Result 10940 states and 19073 transitions. [2023-11-22 21:17:37,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:17:37,454 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-11-22 21:17:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:37,484 INFO L225 Difference]: With dead ends: 10940 [2023-11-22 21:17:37,485 INFO L226 Difference]: Without dead ends: 5853 [2023-11-22 21:17:37,501 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-11-22 21:17:37,502 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-11-22 21:17:37,502 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-11-22 21:17:37,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5853 states. [2023-11-22 21:17:37,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5853 to 5853. [2023-11-22 21:17:37,809 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-11-22 21:17:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 10120 transitions. [2023-11-22 21:17:37,829 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 10120 transitions. Word has length 97 [2023-11-22 21:17:37,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:37,829 INFO L495 AbstractCegarLoop]: Abstraction has 5853 states and 10120 transitions. [2023-11-22 21:17:37,829 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-11-22 21:17:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 10120 transitions. [2023-11-22 21:17:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-22 21:17:37,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:37,854 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-11-22 21:17:37,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-22 21:17:38,071 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-11-22 21:17:38,071 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:38,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:38,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1457593673, now seen corresponding path program 1 times [2023-11-22 21:17:38,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:38,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860932719] [2023-11-22 21:17:38,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:38,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:38,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:38,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 21:17:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:38,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 21:17:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:38,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-22 21:17:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:38,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-22 21:17:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:38,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 21:17:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:38,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-22 21:17:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:38,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 21:17:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:38,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-22 21:17:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:38,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 21:17:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 21:17:38,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:38,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860932719] [2023-11-22 21:17:38,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860932719] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:38,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438312801] [2023-11-22 21:17:38,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:38,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:38,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:38,185 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-11-22 21:17:38,219 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-11-22 21:17:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:38,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 21:17:38,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 21:17:38,312 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:38,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438312801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:38,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:38,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 21:17:38,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906937052] [2023-11-22 21:17:38,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:38,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:17:38,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:38,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:17:38,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:17:38,314 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-11-22 21:17:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:38,605 INFO L93 Difference]: Finished difference Result 12398 states and 21091 transitions. [2023-11-22 21:17:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:17:38,606 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-11-22 21:17:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:38,624 INFO L225 Difference]: With dead ends: 12398 [2023-11-22 21:17:38,624 INFO L226 Difference]: Without dead ends: 6807 [2023-11-22 21:17:38,636 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-11-22 21:17:38,637 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-11-22 21:17:38,637 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-11-22 21:17:38,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6807 states. [2023-11-22 21:17:38,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6807 to 5853. [2023-11-22 21:17:38,858 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-11-22 21:17:38,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 10116 transitions. [2023-11-22 21:17:38,873 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 10116 transitions. Word has length 97 [2023-11-22 21:17:38,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:38,873 INFO L495 AbstractCegarLoop]: Abstraction has 5853 states and 10116 transitions. [2023-11-22 21:17:38,874 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-11-22 21:17:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 10116 transitions. [2023-11-22 21:17:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-22 21:17:38,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:38,888 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-11-22 21:17:38,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-22 21:17:39,099 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-11-22 21:17:39,100 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:39,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1091145433, now seen corresponding path program 1 times [2023-11-22 21:17:39,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:39,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737038655] [2023-11-22 21:17:39,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:39,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:39,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 21:17:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:39,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:17:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:39,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:17:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:39,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 21:17:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:39,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 21:17:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:39,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:17:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:39,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 21:17:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:39,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 21:17:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:39,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-22 21:17:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 21:17:39,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:39,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737038655] [2023-11-22 21:17:39,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737038655] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:39,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098307693] [2023-11-22 21:17:39,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:39,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:39,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:39,200 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-11-22 21:17:39,232 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-11-22 21:17:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:39,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 21:17:39,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 21:17:39,292 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:39,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098307693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:39,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:39,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-22 21:17:39,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330002371] [2023-11-22 21:17:39,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:39,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:17:39,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:39,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:17:39,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 21:17:39,294 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-11-22 21:17:39,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:39,492 INFO L93 Difference]: Finished difference Result 11856 states and 20687 transitions. [2023-11-22 21:17:39,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:17:39,492 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-11-22 21:17:39,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:39,511 INFO L225 Difference]: With dead ends: 11856 [2023-11-22 21:17:39,511 INFO L226 Difference]: Without dead ends: 6465 [2023-11-22 21:17:39,522 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-11-22 21:17:39,522 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-11-22 21:17:39,523 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-11-22 21:17:39,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6465 states. [2023-11-22 21:17:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6465 to 6465. [2023-11-22 21:17:39,812 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-11-22 21:17:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6465 states to 6465 states and 11260 transitions. [2023-11-22 21:17:39,829 INFO L78 Accepts]: Start accepts. Automaton has 6465 states and 11260 transitions. Word has length 99 [2023-11-22 21:17:39,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:39,830 INFO L495 AbstractCegarLoop]: Abstraction has 6465 states and 11260 transitions. [2023-11-22 21:17:39,830 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-11-22 21:17:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 6465 states and 11260 transitions. [2023-11-22 21:17:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-22 21:17:39,847 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:39,848 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-11-22 21:17:39,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-22 21:17:40,059 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-11-22 21:17:40,059 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:40,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:40,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1930179095, now seen corresponding path program 1 times [2023-11-22 21:17:40,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:40,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993905777] [2023-11-22 21:17:40,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:40,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:40,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:40,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 21:17:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:40,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:17:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:40,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:17:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:40,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 21:17:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:40,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 21:17:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:40,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:17:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:40,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 21:17:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:40,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 21:17:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:40,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-22 21:17:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 21:17:40,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:40,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993905777] [2023-11-22 21:17:40,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993905777] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:40,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127360020] [2023-11-22 21:17:40,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:40,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:40,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:40,153 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-11-22 21:17:40,189 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-11-22 21:17:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:40,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 21:17:40,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:40,283 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:17:40,283 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:40,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127360020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:40,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:40,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-22 21:17:40,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77362985] [2023-11-22 21:17:40,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:40,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:17:40,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:40,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:17:40,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:17:40,285 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-11-22 21:17:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:40,638 INFO L93 Difference]: Finished difference Result 12480 states and 20997 transitions. [2023-11-22 21:17:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:17:40,639 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-11-22 21:17:40,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:40,656 INFO L225 Difference]: With dead ends: 12480 [2023-11-22 21:17:40,657 INFO L226 Difference]: Without dead ends: 6565 [2023-11-22 21:17:40,668 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-11-22 21:17:40,669 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-11-22 21:17:40,669 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-11-22 21:17:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6565 states. [2023-11-22 21:17:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6565 to 6561. [2023-11-22 21:17:40,991 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-11-22 21:17:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 10872 transitions. [2023-11-22 21:17:41,010 INFO L78 Accepts]: Start accepts. Automaton has 6561 states and 10872 transitions. Word has length 99 [2023-11-22 21:17:41,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:41,011 INFO L495 AbstractCegarLoop]: Abstraction has 6561 states and 10872 transitions. [2023-11-22 21:17:41,011 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-11-22 21:17:41,011 INFO L276 IsEmpty]: Start isEmpty. Operand 6561 states and 10872 transitions. [2023-11-22 21:17:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-22 21:17:41,028 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:41,028 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-11-22 21:17:41,039 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-11-22 21:17:41,239 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-11-22 21:17:41,240 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:41,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:41,240 INFO L85 PathProgramCache]: Analyzing trace with hash -96433003, now seen corresponding path program 2 times [2023-11-22 21:17:41,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:41,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656188661] [2023-11-22 21:17:41,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:41,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:41,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:41,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 21:17:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:41,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:17:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:41,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:17:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:41,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 21:17:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:41,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 21:17:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:41,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:17:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:41,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 21:17:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:41,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 21:17:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:41,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-22 21:17:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 21:17:41,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:41,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656188661] [2023-11-22 21:17:41,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656188661] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:41,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784006798] [2023-11-22 21:17:41,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 21:17:41,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:41,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:41,358 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-11-22 21:17:41,387 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-11-22 21:17:41,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-22 21:17:41,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 21:17:41,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 21:17:41,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-22 21:17:41,451 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:41,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784006798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:41,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:41,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-11-22 21:17:41,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859030143] [2023-11-22 21:17:41,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:41,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:17:41,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:41,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:17:41,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:17:41,453 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-11-22 21:17:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:41,720 INFO L93 Difference]: Finished difference Result 8221 states and 15175 transitions. [2023-11-22 21:17:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 21:17:41,720 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-11-22 21:17:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:41,743 INFO L225 Difference]: With dead ends: 8221 [2023-11-22 21:17:41,743 INFO L226 Difference]: Without dead ends: 8217 [2023-11-22 21:17:41,746 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-11-22 21:17:41,747 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-11-22 21:17:41,747 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-11-22 21:17:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2023-11-22 21:17:42,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 6689. [2023-11-22 21:17:42,014 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-11-22 21:17:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 11000 transitions. [2023-11-22 21:17:42,031 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 11000 transitions. Word has length 99 [2023-11-22 21:17:42,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:42,031 INFO L495 AbstractCegarLoop]: Abstraction has 6689 states and 11000 transitions. [2023-11-22 21:17:42,032 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-11-22 21:17:42,032 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 11000 transitions. [2023-11-22 21:17:42,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-22 21:17:42,048 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:42,048 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-11-22 21:17:42,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-22 21:17:42,259 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-11-22 21:17:42,260 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:42,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:42,260 INFO L85 PathProgramCache]: Analyzing trace with hash -39174701, now seen corresponding path program 1 times [2023-11-22 21:17:42,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:42,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103425648] [2023-11-22 21:17:42,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:42,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:42,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:42,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 21:17:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:42,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:17:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:42,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:17:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:42,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 21:17:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:42,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 21:17:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:42,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:17:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:42,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 21:17:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:42,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 21:17:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:42,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-22 21:17:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 21:17:42,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:42,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103425648] [2023-11-22 21:17:42,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103425648] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:42,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286504510] [2023-11-22 21:17:42,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:42,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:42,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:42,396 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-11-22 21:17:42,424 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-11-22 21:17:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:42,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 21:17:42,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:42,502 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-22 21:17:42,502 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:42,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286504510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:42,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:42,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-11-22 21:17:42,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080580915] [2023-11-22 21:17:42,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:42,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:17:42,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:42,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:17:42,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-22 21:17:42,504 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-11-22 21:17:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:42,707 INFO L93 Difference]: Finished difference Result 12748 states and 20399 transitions. [2023-11-22 21:17:42,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:17:42,707 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-11-22 21:17:42,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:42,726 INFO L225 Difference]: With dead ends: 12748 [2023-11-22 21:17:42,726 INFO L226 Difference]: Without dead ends: 6625 [2023-11-22 21:17:42,737 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-11-22 21:17:42,738 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-11-22 21:17:42,738 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-11-22 21:17:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2023-11-22 21:17:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 6625. [2023-11-22 21:17:43,033 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-11-22 21:17:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 10872 transitions. [2023-11-22 21:17:43,054 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 10872 transitions. Word has length 99 [2023-11-22 21:17:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:43,054 INFO L495 AbstractCegarLoop]: Abstraction has 6625 states and 10872 transitions. [2023-11-22 21:17:43,055 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-11-22 21:17:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 10872 transitions. [2023-11-22 21:17:43,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-22 21:17:43,071 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:43,072 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-11-22 21:17:43,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-22 21:17:43,282 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-11-22 21:17:43,283 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:43,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:43,283 INFO L85 PathProgramCache]: Analyzing trace with hash 871855670, now seen corresponding path program 1 times [2023-11-22 21:17:43,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:43,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024044483] [2023-11-22 21:17:43,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:43,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:43,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:43,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 21:17:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:43,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:17:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:43,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:17:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:43,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 21:17:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:43,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 21:17:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:43,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:17:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:43,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 21:17:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:43,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 21:17:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:43,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 21:17:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-22 21:17:43,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:43,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024044483] [2023-11-22 21:17:43,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024044483] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:43,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712538000] [2023-11-22 21:17:43,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:43,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:43,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:43,388 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-11-22 21:17:43,437 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-11-22 21:17:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:43,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 21:17:43,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:17:43,539 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:43,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712538000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:43,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:43,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-22 21:17:43,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674882508] [2023-11-22 21:17:43,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:43,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:17:43,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:43,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:17:43,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:17:43,542 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-11-22 21:17:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:43,839 INFO L93 Difference]: Finished difference Result 12940 states and 20614 transitions. [2023-11-22 21:17:43,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:17:43,839 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-11-22 21:17:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:43,856 INFO L225 Difference]: With dead ends: 12940 [2023-11-22 21:17:43,856 INFO L226 Difference]: Without dead ends: 6845 [2023-11-22 21:17:43,867 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-11-22 21:17:43,867 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-11-22 21:17:43,868 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-11-22 21:17:43,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6845 states. [2023-11-22 21:17:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6845 to 6841. [2023-11-22 21:17:44,140 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-11-22 21:17:44,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 10652 transitions. [2023-11-22 21:17:44,158 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 10652 transitions. Word has length 102 [2023-11-22 21:17:44,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:44,158 INFO L495 AbstractCegarLoop]: Abstraction has 6841 states and 10652 transitions. [2023-11-22 21:17:44,158 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-11-22 21:17:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 10652 transitions. [2023-11-22 21:17:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-22 21:17:44,178 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:44,178 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-11-22 21:17:44,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-22 21:17:44,389 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-11-22 21:17:44,390 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:44,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:44,390 INFO L85 PathProgramCache]: Analyzing trace with hash -814324168, now seen corresponding path program 1 times [2023-11-22 21:17:44,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:44,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668163848] [2023-11-22 21:17:44,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:44,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:44,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:44,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 21:17:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:44,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 21:17:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:44,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 21:17:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:44,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 21:17:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:44,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 21:17:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:17:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:44,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 21:17:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:44,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 21:17:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:44,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 21:17:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-22 21:17:44,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:44,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668163848] [2023-11-22 21:17:44,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668163848] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:44,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581352434] [2023-11-22 21:17:44,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:44,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:44,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:44,480 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-11-22 21:17:44,524 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-11-22 21:17:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:44,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 21:17:44,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-22 21:17:44,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:44,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581352434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:44,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:44,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2023-11-22 21:17:44,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646987642] [2023-11-22 21:17:44,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:44,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:17:44,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:44,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:17:44,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-22 21:17:44,625 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-11-22 21:17:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:44,902 INFO L93 Difference]: Finished difference Result 14070 states and 21801 transitions. [2023-11-22 21:17:44,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:17:44,903 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-11-22 21:17:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:44,923 INFO L225 Difference]: With dead ends: 14070 [2023-11-22 21:17:44,923 INFO L226 Difference]: Without dead ends: 7543 [2023-11-22 21:17:44,934 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-11-22 21:17:44,936 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-11-22 21:17:44,936 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-11-22 21:17:44,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7543 states. [2023-11-22 21:17:45,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7543 to 6841. [2023-11-22 21:17:45,317 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-11-22 21:17:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 10644 transitions. [2023-11-22 21:17:45,335 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 10644 transitions. Word has length 102 [2023-11-22 21:17:45,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:45,335 INFO L495 AbstractCegarLoop]: Abstraction has 6841 states and 10644 transitions. [2023-11-22 21:17:45,335 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-11-22 21:17:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 10644 transitions. [2023-11-22 21:17:45,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-22 21:17:45,351 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:45,351 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-11-22 21:17:45,378 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-11-22 21:17:45,562 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-11-22 21:17:45,563 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:45,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:45,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1864122538, now seen corresponding path program 1 times [2023-11-22 21:17:45,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:45,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819931210] [2023-11-22 21:17:45,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:45,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:45,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:45,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:17:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:45,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 21:17:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:45,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:17:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:45,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:17:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:45,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 21:17:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:45,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 21:17:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:45,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:17:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:45,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-22 21:17:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:45,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 21:17:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:45,662 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-22 21:17:45,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:45,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819931210] [2023-11-22 21:17:45,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819931210] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:45,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273800379] [2023-11-22 21:17:45,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:45,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:45,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:45,677 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-11-22 21:17:45,717 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-11-22 21:17:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:45,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 21:17:45,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 21:17:45,794 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:45,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273800379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:45,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:45,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-22 21:17:45,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017691507] [2023-11-22 21:17:45,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:45,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:17:45,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:45,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:17:45,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-22 21:17:45,796 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-11-22 21:17:46,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:46,147 INFO L93 Difference]: Finished difference Result 14110 states and 21908 transitions. [2023-11-22 21:17:46,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:17:46,148 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-11-22 21:17:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:46,176 INFO L225 Difference]: With dead ends: 14110 [2023-11-22 21:17:46,176 INFO L226 Difference]: Without dead ends: 7803 [2023-11-22 21:17:46,191 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-11-22 21:17:46,191 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-11-22 21:17:46,192 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-11-22 21:17:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7803 states. [2023-11-22 21:17:46,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7803 to 7803. [2023-11-22 21:17:46,628 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-11-22 21:17:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7803 states to 7803 states and 12079 transitions. [2023-11-22 21:17:46,655 INFO L78 Accepts]: Start accepts. Automaton has 7803 states and 12079 transitions. Word has length 104 [2023-11-22 21:17:46,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:46,655 INFO L495 AbstractCegarLoop]: Abstraction has 7803 states and 12079 transitions. [2023-11-22 21:17:46,655 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-11-22 21:17:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 7803 states and 12079 transitions. [2023-11-22 21:17:46,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-22 21:17:46,680 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:46,680 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-11-22 21:17:46,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-22 21:17:46,895 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-11-22 21:17:46,895 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:46,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:46,895 INFO L85 PathProgramCache]: Analyzing trace with hash 721620072, now seen corresponding path program 1 times [2023-11-22 21:17:46,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:46,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240125896] [2023-11-22 21:17:46,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:46,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:46,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:46,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:17:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:46,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 21:17:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:46,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:17:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:46,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:17:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:46,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 21:17:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:46,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 21:17:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:46,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:17:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:46,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-22 21:17:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:46,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 21:17:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-22 21:17:46,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:46,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240125896] [2023-11-22 21:17:46,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240125896] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:46,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440231920] [2023-11-22 21:17:46,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:46,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:46,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:47,010 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-11-22 21:17:47,038 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-11-22 21:17:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:47,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 21:17:47,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:17:47,133 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:47,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440231920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:47,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:47,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-11-22 21:17:47,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501608809] [2023-11-22 21:17:47,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:47,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:17:47,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:47,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:17:47,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:17:47,135 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-11-22 21:17:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:47,502 INFO L93 Difference]: Finished difference Result 15114 states and 22661 transitions. [2023-11-22 21:17:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:17:47,502 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-11-22 21:17:47,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:47,520 INFO L225 Difference]: With dead ends: 15114 [2023-11-22 21:17:47,521 INFO L226 Difference]: Without dead ends: 7969 [2023-11-22 21:17:47,533 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-11-22 21:17:47,534 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-11-22 21:17:47,534 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-11-22 21:17:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7969 states. [2023-11-22 21:17:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7969 to 7965. [2023-11-22 21:17:47,829 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-11-22 21:17:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 11832 transitions. [2023-11-22 21:17:47,848 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 11832 transitions. Word has length 104 [2023-11-22 21:17:47,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:47,848 INFO L495 AbstractCegarLoop]: Abstraction has 7965 states and 11832 transitions. [2023-11-22 21:17:47,848 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-11-22 21:17:47,848 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 11832 transitions. [2023-11-22 21:17:47,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-22 21:17:47,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:47,864 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-11-22 21:17:47,874 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-11-22 21:17:48,074 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-11-22 21:17:48,075 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:48,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:48,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1400892326, now seen corresponding path program 1 times [2023-11-22 21:17:48,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:48,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976755606] [2023-11-22 21:17:48,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:48,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:48,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:48,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:17:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:48,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 21:17:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:48,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:17:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:48,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:17:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:48,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 21:17:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:48,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 21:17:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:48,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:17:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:48,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-22 21:17:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:48,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 21:17:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-22 21:17:48,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:48,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976755606] [2023-11-22 21:17:48,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976755606] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:48,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055230569] [2023-11-22 21:17:48,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:48,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:48,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:48,168 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-11-22 21:17:48,207 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-11-22 21:17:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:48,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-22 21:17:48,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-22 21:17:48,360 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:48,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055230569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:48,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:48,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2023-11-22 21:17:48,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124736897] [2023-11-22 21:17:48,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:48,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:17:48,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:48,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:17:48,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 21:17:48,362 INFO L87 Difference]: Start difference. First operand 7965 states and 11832 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-22 21:17:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:48,847 INFO L93 Difference]: Finished difference Result 11491 states and 16748 transitions. [2023-11-22 21:17:48,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 21:17:48,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 104 [2023-11-22 21:17:48,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:48,872 INFO L225 Difference]: With dead ends: 11491 [2023-11-22 21:17:48,873 INFO L226 Difference]: Without dead ends: 11487 [2023-11-22 21:17:48,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:17:48,878 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 159 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 21:17:48,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 206 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 21:17:48,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11487 states. [2023-11-22 21:17:49,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11487 to 11455. [2023-11-22 21:17:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11455 states, 8966 states have (on average 1.299018514387687) internal successors, (11647), 9469 states have internal predecessors, (11647), 1211 states have call successors, (1211), 727 states have call predecessors, (1211), 1277 states have return successors, (3839), 1354 states have call predecessors, (3839), 1211 states have call successors, (3839) [2023-11-22 21:17:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11455 states to 11455 states and 16697 transitions. [2023-11-22 21:17:49,367 INFO L78 Accepts]: Start accepts. Automaton has 11455 states and 16697 transitions. Word has length 104 [2023-11-22 21:17:49,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:49,367 INFO L495 AbstractCegarLoop]: Abstraction has 11455 states and 16697 transitions. [2023-11-22 21:17:49,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-22 21:17:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 11455 states and 16697 transitions. [2023-11-22 21:17:49,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-22 21:17:49,390 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:49,390 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, 1, 1] [2023-11-22 21:17:49,401 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-11-22 21:17:49,601 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-11-22 21:17:49,601 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:49,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:49,601 INFO L85 PathProgramCache]: Analyzing trace with hash 529672484, now seen corresponding path program 1 times [2023-11-22 21:17:49,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:49,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614063367] [2023-11-22 21:17:49,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:49,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:49,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:17:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:49,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 21:17:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:49,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 21:17:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:49,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 21:17:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:49,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 21:17:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:49,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 21:17:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:49,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 21:17:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:49,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 21:17:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:49,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-22 21:17:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-22 21:17:49,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:49,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614063367] [2023-11-22 21:17:49,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614063367] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:49,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668390361] [2023-11-22 21:17:49,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:49,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:49,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:49,688 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-11-22 21:17:49,715 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-11-22 21:17:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:49,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 21:17:49,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-22 21:17:49,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:17:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-22 21:17:49,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668390361] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:49,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-22 21:17:49,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 4] total 11 [2023-11-22 21:17:49,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585219200] [2023-11-22 21:17:49,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:49,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:17:49,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:49,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:17:49,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:17:49,977 INFO L87 Difference]: Start difference. First operand 11455 states and 16697 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-11-22 21:17:50,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:50,787 INFO L93 Difference]: Finished difference Result 33048 states and 48522 transitions. [2023-11-22 21:17:50,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:17:50,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 106 [2023-11-22 21:17:50,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:50,834 INFO L225 Difference]: With dead ends: 33048 [2023-11-22 21:17:50,835 INFO L226 Difference]: Without dead ends: 21671 [2023-11-22 21:17:50,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 222 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-22 21:17:50,857 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 157 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:17:50,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 300 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:17:50,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21671 states. [2023-11-22 21:17:51,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21671 to 21139. [2023-11-22 21:17:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21139 states, 16631 states have (on average 1.259575491551921) internal successors, (20948), 17751 states have internal predecessors, (20948), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 21:17:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21139 states to 21139 states and 29128 transitions. [2023-11-22 21:17:51,951 INFO L78 Accepts]: Start accepts. Automaton has 21139 states and 29128 transitions. Word has length 106 [2023-11-22 21:17:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:51,951 INFO L495 AbstractCegarLoop]: Abstraction has 21139 states and 29128 transitions. [2023-11-22 21:17:51,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-11-22 21:17:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 21139 states and 29128 transitions. [2023-11-22 21:17:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-22 21:17:51,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:51,970 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] [2023-11-22 21:17:51,982 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-11-22 21:17:52,180 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-11-22 21:17:52,180 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:52,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:52,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1787052981, now seen corresponding path program 1 times [2023-11-22 21:17:52,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:52,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652208203] [2023-11-22 21:17:52,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:52,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:52,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:52,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:17:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:52,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 21:17:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:52,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 21:17:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:52,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 21:17:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:52,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-22 21:17:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:52,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 21:17:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:52,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-22 21:17:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:52,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-22 21:17:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:52,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-22 21:17:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:52,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-22 21:17:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 21:17:52,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:52,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652208203] [2023-11-22 21:17:52,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652208203] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:52,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679022144] [2023-11-22 21:17:52,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:52,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:52,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:52,392 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-11-22 21:17:52,419 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-11-22 21:17:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:52,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 21:17:52,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:17:52,497 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:52,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679022144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:52,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:52,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-11-22 21:17:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076740278] [2023-11-22 21:17:52,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:52,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:17:52,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:52,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:17:52,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:17:52,500 INFO L87 Difference]: Start difference. First operand 21139 states and 29128 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-11-22 21:17:53,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:53,307 INFO L93 Difference]: Finished difference Result 42166 states and 57974 transitions. [2023-11-22 21:17:53,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:17:53,308 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-11-22 21:17:53,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:53,364 INFO L225 Difference]: With dead ends: 42166 [2023-11-22 21:17:53,364 INFO L226 Difference]: Without dead ends: 21379 [2023-11-22 21:17:53,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 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-11-22 21:17:53,400 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-11-22 21:17:53,404 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-11-22 21:17:53,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21379 states. [2023-11-22 21:17:54,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21379 to 21283. [2023-11-22 21:17:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21283 states, 16775 states have (on average 1.2573472429210135) internal successors, (21092), 17895 states have internal predecessors, (21092), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 21:17:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21283 states to 21283 states and 29272 transitions. [2023-11-22 21:17:54,425 INFO L78 Accepts]: Start accepts. Automaton has 21283 states and 29272 transitions. Word has length 119 [2023-11-22 21:17:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:54,425 INFO L495 AbstractCegarLoop]: Abstraction has 21283 states and 29272 transitions. [2023-11-22 21:17:54,425 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-11-22 21:17:54,425 INFO L276 IsEmpty]: Start isEmpty. Operand 21283 states and 29272 transitions. [2023-11-22 21:17:54,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-22 21:17:54,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:54,443 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] [2023-11-22 21:17:54,455 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-11-22 21:17:54,655 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-11-22 21:17:54,655 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:54,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:54,656 INFO L85 PathProgramCache]: Analyzing trace with hash -883405082, now seen corresponding path program 1 times [2023-11-22 21:17:54,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:54,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112558027] [2023-11-22 21:17:54,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:54,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:54,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:54,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:17:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:54,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 21:17:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:54,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 21:17:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:54,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 21:17:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:54,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 21:17:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:54,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-22 21:17:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:54,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 21:17:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:54,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 21:17:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:54,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 21:17:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:54,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-22 21:17:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 21:17:54,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:54,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112558027] [2023-11-22 21:17:54,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112558027] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:54,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059116605] [2023-11-22 21:17:54,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:54,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:54,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:54,849 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-11-22 21:17:54,876 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-11-22 21:17:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:54,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 21:17:54,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:17:54,940 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:54,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059116605] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:54,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:54,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-11-22 21:17:54,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442868947] [2023-11-22 21:17:54,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:54,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:17:54,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:54,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:17:54,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 21:17:54,943 INFO L87 Difference]: Start difference. First operand 21283 states and 29272 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-11-22 21:17:55,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:55,657 INFO L93 Difference]: Finished difference Result 42262 states and 57878 transitions. [2023-11-22 21:17:55,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:17:55,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 120 [2023-11-22 21:17:55,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:55,702 INFO L225 Difference]: With dead ends: 42262 [2023-11-22 21:17:55,702 INFO L226 Difference]: Without dead ends: 21331 [2023-11-22 21:17:55,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 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-11-22 21:17:55,729 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-11-22 21:17:55,730 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-11-22 21:17:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21331 states. [2023-11-22 21:17:56,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21331 to 21283. [2023-11-22 21:17:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21283 states, 16775 states have (on average 1.24876304023845) internal successors, (20948), 17895 states have internal predecessors, (20948), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 21:17:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21283 states to 21283 states and 29128 transitions. [2023-11-22 21:17:56,592 INFO L78 Accepts]: Start accepts. Automaton has 21283 states and 29128 transitions. Word has length 120 [2023-11-22 21:17:56,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:56,593 INFO L495 AbstractCegarLoop]: Abstraction has 21283 states and 29128 transitions. [2023-11-22 21:17:56,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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-11-22 21:17:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 21283 states and 29128 transitions. [2023-11-22 21:17:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-22 21:17:56,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:56,609 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] [2023-11-22 21:17:56,620 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-11-22 21:17:56,820 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-11-22 21:17:56,821 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:56,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:56,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1018147445, now seen corresponding path program 1 times [2023-11-22 21:17:56,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:56,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519540858] [2023-11-22 21:17:56,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:56,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:56,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:56,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:17:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:56,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 21:17:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:56,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 21:17:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:56,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 21:17:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:56,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 21:17:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:56,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-22 21:17:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:56,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 21:17:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:56,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 21:17:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:56,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 21:17:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:56,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-22 21:17:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 21:17:56,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:56,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519540858] [2023-11-22 21:17:56,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519540858] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:56,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037515741] [2023-11-22 21:17:56,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:56,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:56,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:56,945 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-11-22 21:17:56,946 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-11-22 21:17:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:57,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 21:17:57,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:17:57,192 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:57,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037515741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:57,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:57,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2023-11-22 21:17:57,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497701574] [2023-11-22 21:17:57,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:57,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:17:57,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:57,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:17:57,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-22 21:17:57,193 INFO L87 Difference]: Start difference. First operand 21283 states and 29128 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-11-22 21:17:57,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:17:57,890 INFO L93 Difference]: Finished difference Result 42214 states and 57542 transitions. [2023-11-22 21:17:57,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:17:57,890 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-11-22 21:17:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:17:57,934 INFO L225 Difference]: With dead ends: 42214 [2023-11-22 21:17:57,935 INFO L226 Difference]: Without dead ends: 21283 [2023-11-22 21:17:57,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 135 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-11-22 21:17:57,966 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 275 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:17:57,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 119 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:17:57,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21283 states. [2023-11-22 21:17:59,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21283 to 21283. [2023-11-22 21:17:59,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21283 states, 16775 states have (on average 1.2459016393442623) internal successors, (20900), 17895 states have internal predecessors, (20900), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 21:17:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21283 states to 21283 states and 29080 transitions. [2023-11-22 21:17:59,151 INFO L78 Accepts]: Start accepts. Automaton has 21283 states and 29080 transitions. Word has length 120 [2023-11-22 21:17:59,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:17:59,152 INFO L495 AbstractCegarLoop]: Abstraction has 21283 states and 29080 transitions. [2023-11-22 21:17:59,152 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-11-22 21:17:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 21283 states and 29080 transitions. [2023-11-22 21:17:59,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-22 21:17:59,172 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:17:59,172 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] [2023-11-22 21:17:59,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-11-22 21:17:59,383 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-11-22 21:17:59,384 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:17:59,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:17:59,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1385487328, now seen corresponding path program 1 times [2023-11-22 21:17:59,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:17:59,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941031991] [2023-11-22 21:17:59,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:59,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:17:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:59,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:17:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:59,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:17:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:59,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 21:17:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:59,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 21:17:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:59,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 21:17:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:59,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:17:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:59,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 21:17:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:59,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 21:17:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:59,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 21:17:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:59,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-22 21:17:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:59,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-22 21:17:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 21:17:59,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:17:59,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941031991] [2023-11-22 21:17:59,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941031991] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:17:59,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311054824] [2023-11-22 21:17:59,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:17:59,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:17:59,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:17:59,540 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-11-22 21:17:59,579 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-11-22 21:17:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:17:59,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 21:17:59,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:17:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:17:59,651 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:17:59,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311054824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:17:59,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:17:59,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-22 21:17:59,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382510449] [2023-11-22 21:17:59,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:17:59,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:17:59,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:17:59,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:17:59,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-22 21:17:59,653 INFO L87 Difference]: Start difference. First operand 21283 states and 29080 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-11-22 21:18:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:18:00,632 INFO L93 Difference]: Finished difference Result 42742 states and 58214 transitions. [2023-11-22 21:18:00,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:18:00,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 121 [2023-11-22 21:18:00,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:18:00,688 INFO L225 Difference]: With dead ends: 42742 [2023-11-22 21:18:00,688 INFO L226 Difference]: Without dead ends: 21811 [2023-11-22 21:18:00,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 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-11-22 21:18:00,724 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-11-22 21:18:00,725 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-11-22 21:18:00,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21811 states. [2023-11-22 21:18:01,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21811 to 21619. [2023-11-22 21:18:01,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21619 states, 17111 states have (on average 1.2466834200222079) internal successors, (21332), 18231 states have internal predecessors, (21332), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 21:18:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21619 states to 21619 states and 29512 transitions. [2023-11-22 21:18:01,906 INFO L78 Accepts]: Start accepts. Automaton has 21619 states and 29512 transitions. Word has length 121 [2023-11-22 21:18:01,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:18:01,906 INFO L495 AbstractCegarLoop]: Abstraction has 21619 states and 29512 transitions. [2023-11-22 21:18:01,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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-11-22 21:18:01,907 INFO L276 IsEmpty]: Start isEmpty. Operand 21619 states and 29512 transitions. [2023-11-22 21:18:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-22 21:18:01,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:18:01,923 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] [2023-11-22 21:18:01,934 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-11-22 21:18:02,134 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-11-22 21:18:02,134 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:18:02,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:18:02,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2117454754, now seen corresponding path program 1 times [2023-11-22 21:18:02,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:18:02,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183978236] [2023-11-22 21:18:02,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:18:02,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:18:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:02,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:18:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:02,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:18:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:02,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 21:18:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:02,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 21:18:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:02,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 21:18:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:02,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 21:18:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:02,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 21:18:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:02,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 21:18:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:02,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 21:18:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:02,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-22 21:18:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:02,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-22 21:18:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:02,256 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 21:18:02,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:18:02,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183978236] [2023-11-22 21:18:02,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183978236] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:18:02,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942510032] [2023-11-22 21:18:02,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:18:02,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:18:02,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:18:02,259 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-11-22 21:18:02,282 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-11-22 21:18:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:02,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 21:18:02,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:18:02,521 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:18:02,522 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:18:02,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942510032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:18:02,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:18:02,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2023-11-22 21:18:02,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520921937] [2023-11-22 21:18:02,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:18:02,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:18:02,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:18:02,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:18:02,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-22 21:18:02,525 INFO L87 Difference]: Start difference. First operand 21619 states and 29512 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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-11-22 21:18:03,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:18:03,241 INFO L93 Difference]: Finished difference Result 42886 states and 58310 transitions. [2023-11-22 21:18:03,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:18:03,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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 121 [2023-11-22 21:18:03,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:18:03,291 INFO L225 Difference]: With dead ends: 42886 [2023-11-22 21:18:03,291 INFO L226 Difference]: Without dead ends: 21619 [2023-11-22 21:18:03,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 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-11-22 21:18:03,324 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 282 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:18:03,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 130 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:18:03,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21619 states. [2023-11-22 21:18:04,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21619 to 21619. [2023-11-22 21:18:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21619 states, 17111 states have (on average 1.2410729939804803) internal successors, (21236), 18231 states have internal predecessors, (21236), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 21:18:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21619 states to 21619 states and 29416 transitions. [2023-11-22 21:18:04,393 INFO L78 Accepts]: Start accepts. Automaton has 21619 states and 29416 transitions. Word has length 121 [2023-11-22 21:18:04,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:18:04,393 INFO L495 AbstractCegarLoop]: Abstraction has 21619 states and 29416 transitions. [2023-11-22 21:18:04,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 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-11-22 21:18:04,394 INFO L276 IsEmpty]: Start isEmpty. Operand 21619 states and 29416 transitions. [2023-11-22 21:18:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-22 21:18:04,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:18:04,411 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] [2023-11-22 21:18:04,421 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-11-22 21:18:04,621 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-11-22 21:18:04,622 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:18:04,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:18:04,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1139138957, now seen corresponding path program 1 times [2023-11-22 21:18:04,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:18:04,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787983690] [2023-11-22 21:18:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:18:04,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:18:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:04,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:18:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:04,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:18:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:04,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 21:18:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:04,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 21:18:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:04,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 21:18:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:04,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 21:18:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:04,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-22 21:18:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:04,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-22 21:18:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:04,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-22 21:18:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:04,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-22 21:18:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:04,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-22 21:18:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 21:18:04,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:18:04,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787983690] [2023-11-22 21:18:04,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787983690] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:18:04,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449403922] [2023-11-22 21:18:04,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:18:04,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:18:04,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:18:04,785 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-11-22 21:18:04,812 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-11-22 21:18:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:04,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 21:18:04,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:18:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:18:04,975 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:18:04,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449403922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:18:04,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:18:04,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2023-11-22 21:18:04,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520618976] [2023-11-22 21:18:04,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:18:04,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:18:04,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:18:04,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:18:04,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-22 21:18:04,977 INFO L87 Difference]: Start difference. First operand 21619 states and 29416 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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-11-22 21:18:05,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:18:05,966 INFO L93 Difference]: Finished difference Result 42550 states and 57734 transitions. [2023-11-22 21:18:05,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:18:05,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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 122 [2023-11-22 21:18:05,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:18:06,024 INFO L225 Difference]: With dead ends: 42550 [2023-11-22 21:18:06,024 INFO L226 Difference]: Without dead ends: 21283 [2023-11-22 21:18:06,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 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-11-22 21:18:06,057 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 198 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:18:06,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 122 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:18:06,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21283 states. [2023-11-22 21:18:07,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21283 to 21283. [2023-11-22 21:18:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21283 states, 16775 states have (on average 1.237317436661699) internal successors, (20756), 17895 states have internal predecessors, (20756), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 21:18:07,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21283 states to 21283 states and 28936 transitions. [2023-11-22 21:18:07,376 INFO L78 Accepts]: Start accepts. Automaton has 21283 states and 28936 transitions. Word has length 122 [2023-11-22 21:18:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:18:07,377 INFO L495 AbstractCegarLoop]: Abstraction has 21283 states and 28936 transitions. [2023-11-22 21:18:07,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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-11-22 21:18:07,377 INFO L276 IsEmpty]: Start isEmpty. Operand 21283 states and 28936 transitions. [2023-11-22 21:18:07,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-22 21:18:07,395 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:18:07,396 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-11-22 21:18:07,409 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-11-22 21:18:07,606 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-11-22 21:18:07,607 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:18:07,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:18:07,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1422742400, now seen corresponding path program 1 times [2023-11-22 21:18:07,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:18:07,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298769349] [2023-11-22 21:18:07,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:18:07,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:18:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:07,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:18:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:07,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:18:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:07,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 21:18:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:07,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 21:18:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:07,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 21:18:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:07,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 21:18:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:07,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:18:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:07,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 21:18:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:07,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 21:18:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:07,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-22 21:18:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:07,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-22 21:18:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-22 21:18:07,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:18:07,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298769349] [2023-11-22 21:18:07,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298769349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:18:07,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:18:07,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 21:18:07,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316389374] [2023-11-22 21:18:07,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:18:07,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 21:18:07,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:18:07,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 21:18:07,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:18:07,735 INFO L87 Difference]: Start difference. First operand 21283 states and 28936 transitions. Second operand has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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-11-22 21:18:08,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:18:08,800 INFO L93 Difference]: Finished difference Result 44054 states and 59690 transitions. [2023-11-22 21:18:08,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 21:18:08,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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 123 [2023-11-22 21:18:08,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:18:08,849 INFO L225 Difference]: With dead ends: 44054 [2023-11-22 21:18:08,850 INFO L226 Difference]: Without dead ends: 22976 [2023-11-22 21:18:08,883 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-11-22 21:18:08,883 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 189 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 21:18:08,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 201 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 21:18:08,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22976 states. [2023-11-22 21:18:09,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22976 to 21456. [2023-11-22 21:18:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21456 states, 16962 states have (on average 1.2342294540738121) internal successors, (20935), 18138 states have internal predecessors, (20935), 1769 states have call successors, (1769), 1453 states have call predecessors, (1769), 2724 states have return successors, (6225), 1888 states have call predecessors, (6225), 1769 states have call successors, (6225) [2023-11-22 21:18:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21456 states to 21456 states and 28929 transitions. [2023-11-22 21:18:09,929 INFO L78 Accepts]: Start accepts. Automaton has 21456 states and 28929 transitions. Word has length 123 [2023-11-22 21:18:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:18:09,929 INFO L495 AbstractCegarLoop]: Abstraction has 21456 states and 28929 transitions. [2023-11-22 21:18:09,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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-11-22 21:18:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 21456 states and 28929 transitions. [2023-11-22 21:18:09,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-22 21:18:09,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:18:09,944 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-11-22 21:18:09,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-22 21:18:09,945 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:18:09,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:18:09,945 INFO L85 PathProgramCache]: Analyzing trace with hash -538832258, now seen corresponding path program 1 times [2023-11-22 21:18:09,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:18:09,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444798494] [2023-11-22 21:18:09,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:18:09,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:18:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:10,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:18:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:10,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:18:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:10,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 21:18:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:10,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 21:18:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:10,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 21:18:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:10,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 21:18:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:10,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:18:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:10,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 21:18:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:10,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 21:18:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:10,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-22 21:18:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:10,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-22 21:18:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-22 21:18:10,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:18:10,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444798494] [2023-11-22 21:18:10,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444798494] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:18:10,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503600670] [2023-11-22 21:18:10,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:18:10,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:18:10,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:18:10,098 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-11-22 21:18:10,123 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-11-22 21:18:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:10,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-22 21:18:10,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:18:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-22 21:18:10,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:18:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-22 21:18:10,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503600670] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:18:10,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 21:18:10,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2023-11-22 21:18:10,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542446484] [2023-11-22 21:18:10,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 21:18:10,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-22 21:18:10,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:18:10,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-22 21:18:10,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-22 21:18:10,429 INFO L87 Difference]: Start difference. First operand 21456 states and 28929 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-11-22 21:18:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:18:13,405 INFO L93 Difference]: Finished difference Result 48244 states and 65468 transitions. [2023-11-22 21:18:13,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-11-22 21:18:13,406 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-11-22 21:18:13,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:18:13,465 INFO L225 Difference]: With dead ends: 48244 [2023-11-22 21:18:13,465 INFO L226 Difference]: Without dead ends: 26957 [2023-11-22 21:18:13,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 295 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1732 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=912, Invalid=4058, Unknown=0, NotChecked=0, Total=4970 [2023-11-22 21:18:13,499 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 2555 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2571 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-22 21:18:13,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2571 Valid, 440 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-22 21:18:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26957 states. [2023-11-22 21:18:14,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26957 to 24657. [2023-11-22 21:18:14,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24657 states, 19501 states have (on average 1.2094764371057893) internal successors, (23586), 20807 states have internal predecessors, (23586), 2043 states have call successors, (2043), 1695 states have call predecessors, (2043), 3112 states have return successors, (6561), 2178 states have call predecessors, (6561), 2043 states have call successors, (6561) [2023-11-22 21:18:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24657 states to 24657 states and 32190 transitions. [2023-11-22 21:18:14,643 INFO L78 Accepts]: Start accepts. Automaton has 24657 states and 32190 transitions. Word has length 123 [2023-11-22 21:18:14,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:18:14,643 INFO L495 AbstractCegarLoop]: Abstraction has 24657 states and 32190 transitions. [2023-11-22 21:18:14,643 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-11-22 21:18:14,644 INFO L276 IsEmpty]: Start isEmpty. Operand 24657 states and 32190 transitions. [2023-11-22 21:18:14,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-22 21:18:14,663 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:18:14,663 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-11-22 21:18:14,674 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-11-22 21:18:14,872 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,SelfDestructingSolverStorable31 [2023-11-22 21:18:14,872 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:18:14,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:18:14,872 INFO L85 PathProgramCache]: Analyzing trace with hash 742131714, now seen corresponding path program 1 times [2023-11-22 21:18:14,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:18:14,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847460473] [2023-11-22 21:18:14,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:18:14,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:18:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:14,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:18:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:14,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 21:18:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:14,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 21:18:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:14,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 21:18:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:14,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 21:18:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:14,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 21:18:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:14,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 21:18:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:15,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 21:18:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:15,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 21:18:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:15,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-22 21:18:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:15,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-22 21:18:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 21:18:15,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:18:15,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847460473] [2023-11-22 21:18:15,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847460473] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:18:15,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747650596] [2023-11-22 21:18:15,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:18:15,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:18:15,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:18:15,012 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-11-22 21:18:15,036 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-11-22 21:18:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:18:15,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 21:18:15,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:18:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:18:15,176 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:18:15,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747650596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:18:15,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 21:18:15,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2023-11-22 21:18:15,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764826107] [2023-11-22 21:18:15,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:18:15,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:18:15,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:18:15,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:18:15,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-11-22 21:18:15,178 INFO L87 Difference]: Start difference. First operand 24657 states and 32190 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-11-22 21:18:15,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:18:15,572 INFO L93 Difference]: Finished difference Result 31445 states and 40570 transitions. [2023-11-22 21:18:15,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:18:15,572 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-11-22 21:18:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:18:15,574 INFO L225 Difference]: With dead ends: 31445 [2023-11-22 21:18:15,574 INFO L226 Difference]: Without dead ends: 0 [2023-11-22 21:18:15,604 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-11-22 21:18:15,606 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 184 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:18:15,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 127 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:18:15,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-22 21:18:15,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-22 21:18:15,608 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-11-22 21:18:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-22 21:18:15,610 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2023-11-22 21:18:15,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:18:15,611 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-22 21:18:15,611 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-11-22 21:18:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-22 21:18:15,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-22 21:18:15,614 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 21:18:15,628 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-11-22 21:18:15,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:18:15,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-22 21:18:40,785 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 383 398) the Hoare annotation is: (or (= ~comp_m1_st~0 |old(~comp_m1_st~0)|) (< ~b1_val_t~0 1) (not (= ~z_val~0 0)) (< ~z_ev~0 2) (< ~d1_val_t~0 1) (< ~b0_val~0 ~b0_val_t~0) (< ~b0_val_t~0 1) (not (= 0 ~z_val_t~0)) (< ~d1_val~0 ~d1_val_t~0) (< ~d0_val_t~0 1) (< 0 ~comp_m1_i~0) (< ~d0_val~0 ~d0_val_t~0) (< ~b1_val~0 ~b1_val_t~0)) [2023-11-22 21:18:40,785 INFO L899 garLoopResultBuilder]: For program point L129(lines 106 131) no Hoare annotation was computed. [2023-11-22 21:18:40,786 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2023-11-22 21:18:40,786 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 125) no Hoare annotation was computed. [2023-11-22 21:18:40,786 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2023-11-22 21:18:40,786 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 127) no Hoare annotation was computed. [2023-11-22 21:18:40,786 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 383 398) no Hoare annotation was computed. [2023-11-22 21:18:40,786 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2023-11-22 21:18:40,786 INFO L899 garLoopResultBuilder]: For program point L390-2(lines 383 398) no Hoare annotation was computed. [2023-11-22 21:18:40,786 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 264 278) no Hoare annotation was computed. [2023-11-22 21:18:40,786 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 273) no Hoare annotation was computed. [2023-11-22 21:18:40,786 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 264 278) the Hoare annotation is: true [2023-11-22 21:18:40,787 INFO L899 garLoopResultBuilder]: For program point L275(lines 267 277) no Hoare annotation was computed. [2023-11-22 21:18:40,787 INFO L899 garLoopResultBuilder]: For program point L341-1(lines 317 349) no Hoare annotation was computed. [2023-11-22 21:18:40,787 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 320 348) no Hoare annotation was computed. [2023-11-22 21:18:40,787 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 317 349) the Hoare annotation is: (let ((.cse1 (< |old(~b1_ev~0)| 2)) (.cse18 (< |old(~b0_ev~0)| 2)) (.cse19 (< |old(~d0_ev~0)| 2)) (.cse17 (< |old(~d1_ev~0)| 2)) (.cse0 (< ~b1_val_t~0 1)) (.cse2 (and (= ~d1_ev~0 |old(~d1_ev~0)|) (= ~b0_ev~0 |old(~b0_ev~0)|) (= |old(~d0_ev~0)| ~d0_ev~0) (= |old(~z_ev~0)| ~z_ev~0) (= |old(~b1_ev~0)| ~b1_ev~0))) (.cse3 (< 0 |old(~d1_ev~0)|)) (.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)) (.cse9 (< 0 |old(~d0_ev~0)|)) (.cse10 (not (= 0 ~z_val_t~0))) (.cse11 (< ~d1_val~0 ~d1_val_t~0)) (.cse12 (< ~d0_val_t~0 1)) (.cse13 (< 0 ~comp_m1_i~0)) (.cse20 (< 0 |old(~b1_ev~0)|)) (.cse14 (< ~d0_val~0 ~d0_val_t~0)) (.cse15 (< 0 |old(~b0_ev~0)|)) (.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 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse16) (or .cse19 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse15 .cse16) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse16) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse17 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse16) (or .cse19 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse19 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse16) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse17 .cse18 .cse16) (or .cse19 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse18 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse18 .cse16) (or .cse19 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse17 .cse18 .cse16) (or .cse19 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse17 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16))) [2023-11-22 21:18:40,787 INFO L899 garLoopResultBuilder]: For program point L321-1(lines 320 348) no Hoare annotation was computed. [2023-11-22 21:18:40,788 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 317 349) no Hoare annotation was computed. [2023-11-22 21:18:40,788 INFO L899 garLoopResultBuilder]: For program point L336-1(lines 320 348) no Hoare annotation was computed. [2023-11-22 21:18:40,788 INFO L899 garLoopResultBuilder]: For program point L326-1(lines 320 348) no Hoare annotation was computed. [2023-11-22 21:18:40,788 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2023-11-22 21:18:40,788 INFO L899 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2023-11-22 21:18:40,788 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 211 249) no Hoare annotation was computed. [2023-11-22 21:18:40,788 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 157) no Hoare annotation was computed. [2023-11-22 21:18:40,788 INFO L899 garLoopResultBuilder]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2023-11-22 21:18:40,788 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 208 250) no Hoare annotation was computed. [2023-11-22 21:18:40,789 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 211 249) no Hoare annotation was computed. [2023-11-22 21:18:40,789 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 187) no Hoare annotation was computed. [2023-11-22 21:18:40,789 INFO L899 garLoopResultBuilder]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2023-11-22 21:18:40,789 INFO L899 garLoopResultBuilder]: For program point L240-1(lines 208 250) no Hoare annotation was computed. [2023-11-22 21:18:40,790 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 208 250) the Hoare annotation is: (let ((.cse21 (= |old(~d1_val~0)| ~d1_val~0)) (.cse22 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse23 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse24 (= ~b1_val~0 |old(~b1_val~0)|)) (.cse25 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse26 (= ~z_val~0 0)) (.cse27 (= |old(~z_ev~0)| ~z_ev~0)) (.cse28 (= |old(~d0_val~0)| ~d0_val~0)) (.cse29 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse30 (= |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)|)) (.cse16 (< |old(~b0_ev~0)| 2)) (.cse0 (< |old(~d0_ev~0)| 2)) (.cse1 (and .cse21 .cse22 (= ~b0_req_up~0 |old(~b0_req_up~0)|) .cse23 .cse24 (= |old(~d0_req_up~0)| ~d0_req_up~0) .cse25 .cse26 .cse27 .cse28 (= |old(~b1_req_up~0)| ~b1_req_up~0) .cse29 .cse30 (= |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)) (.cse20 (< 0 |old(~b0_ev~0)|))) (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 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse20) (or .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse20) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse19 .cse20) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse18 .cse20) (or (not (= ~comp_m1_st~0 0)) .cse0 (and (= ~b0_req_up~0 1) .cse21 .cse22 .cse23 (= ~d0_req_up~0 1) .cse24 (= ~b0_val~0 0) .cse25 .cse26 .cse27 .cse28 (= ~d1_req_up~0 1) .cse29 .cse30 (= 1 ~b1_req_up~0)) .cse2 .cse3 (not (= |old(~d0_req_up~0)| 1)) .cse4 .cse8 (< 0 |old(~z_req_up~0)|) (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 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse20) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse20) (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) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse20)))) [2023-11-22 21:18:40,790 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 142) no Hoare annotation was computed. [2023-11-22 21:18:40,790 INFO L899 garLoopResultBuilder]: For program point L137-2(lines 137 142) no Hoare annotation was computed. [2023-11-22 21:18:40,790 INFO L899 garLoopResultBuilder]: For program point L212-1(lines 211 249) no Hoare annotation was computed. [2023-11-22 21:18:40,790 INFO L899 garLoopResultBuilder]: For program point L233-1(lines 211 249) no Hoare annotation was computed. [2023-11-22 21:18:40,790 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2023-11-22 21:18:40,790 INFO L899 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2023-11-22 21:18:40,791 INFO L899 garLoopResultBuilder]: For program point L374-1(lines 350 382) no Hoare annotation was computed. [2023-11-22 21:18:40,791 INFO L899 garLoopResultBuilder]: For program point L364-1(lines 353 381) no Hoare annotation was computed. [2023-11-22 21:18:40,791 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 350 382) the Hoare annotation is: (let ((.cse2 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse3 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse22 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse4 (= |old(~z_ev~0)| ~z_ev~0)) (.cse5 (= |old(~b1_ev~0)| ~b1_ev~0))) (let ((.cse17 (< |old(~b1_ev~0)| 2)) (.cse0 (not (= ~comp_m1_st~0 0))) (.cse24 (< |old(~b0_ev~0)| 2)) (.cse25 (< |old(~d0_ev~0)| 2)) (.cse23 (< |old(~d1_ev~0)| 2)) (.cse1 (< ~b1_val_t~0 1)) (.cse18 (and .cse2 .cse3 .cse22 .cse4 .cse5)) (.cse19 (< 0 |old(~d1_ev~0)|)) (.cse6 (not (= ~z_val~0 0))) (.cse7 (< ~d1_val_t~0 1)) (.cse8 (< ~b0_val~0 ~b0_val_t~0)) (.cse9 (< |old(~z_ev~0)| 2)) (.cse10 (< ~b0_val_t~0 1)) (.cse20 (< 0 |old(~d0_ev~0)|)) (.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)) (.cse26 (< 0 |old(~b1_ev~0)|)) (.cse15 (< ~d0_val~0 ~d0_val_t~0)) (.cse21 (< 0 |old(~b0_ev~0)|)) (.cse16 (< ~b1_val~0 ~b1_val_t~0))) (and (or .cse0 (not (= |old(~d0_ev~0)| 1)) .cse1 (and .cse2 .cse3 (= ~d0_ev~0 1) .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse17 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16) (or .cse0 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= |old(~d1_ev~0)| 1)) (and .cse3 .cse22 .cse4 (= ~d1_ev~0 1) .cse5) .cse16) (or .cse1 .cse17 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse24 .cse16) (or .cse25 .cse1 .cse17 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse21 .cse16) (or .cse25 .cse1 .cse17 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse24 .cse16) (or .cse0 .cse1 .cse6 .cse7 .cse8 (and .cse2 (= ~b0_ev~0 1) .cse22 .cse4 .cse5) .cse9 .cse10 (not (= |old(~b0_ev~0)| 1)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse23 .cse21 .cse16) (or .cse1 .cse17 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse21 .cse16) (or .cse1 .cse17 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse24 .cse16) (or .cse25 .cse1 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse21 .cse16) (or .cse25 .cse1 .cse17 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16) (or .cse25 .cse1 .cse17 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse24 .cse16) (or .cse1 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse23 .cse24 .cse16) (or .cse25 .cse1 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16) (or .cse0 (not (= |old(~b1_ev~0)| 1)) .cse1 .cse6 .cse7 .cse8 .cse9 (and .cse2 .cse3 (= ~b1_ev~0 1) .cse22 .cse4) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16) (or .cse25 .cse1 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse23 .cse24 .cse16) (or .cse25 .cse1 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse23 .cse21 .cse16) (or .cse1 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse21 .cse16)))) [2023-11-22 21:18:40,792 INFO L899 garLoopResultBuilder]: For program point L354-1(lines 353 381) no Hoare annotation was computed. [2023-11-22 21:18:40,792 INFO L899 garLoopResultBuilder]: For program point L369-1(lines 353 381) no Hoare annotation was computed. [2023-11-22 21:18:40,796 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 350 382) no Hoare annotation was computed. [2023-11-22 21:18:40,796 INFO L899 garLoopResultBuilder]: For program point L359-1(lines 353 381) no Hoare annotation was computed. [2023-11-22 21:18:40,796 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~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)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 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 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 21:18:40,796 INFO L899 garLoopResultBuilder]: For program point L440-1(line 440) no Hoare annotation was computed. [2023-11-22 21:18:40,796 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2023-11-22 21:18:40,797 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2023-11-22 21:18:40,797 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 51 101) no Hoare annotation was computed. [2023-11-22 21:18:40,797 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-22 21:18:40,797 INFO L895 garLoopResultBuilder]: At program point L432-1(lines 432 454) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~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)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 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 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 21:18:40,797 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2023-11-22 21:18:40,797 INFO L899 garLoopResultBuilder]: For program point L61(lines 51 101) no Hoare annotation was computed. [2023-11-22 21:18:40,798 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 418 460) no Hoare annotation was computed. [2023-11-22 21:18:40,798 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-11-22 21:18:40,798 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) (<= ~z_req_up~0 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-11-22 21:18:40,798 INFO L899 garLoopResultBuilder]: For program point L425-1(line 425) no Hoare annotation was computed. [2023-11-22 21:18:40,798 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2023-11-22 21:18:40,798 INFO L899 garLoopResultBuilder]: For program point L79(lines 51 101) no Hoare annotation was computed. [2023-11-22 21:18:40,798 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-22 21:18:40,799 INFO L895 garLoopResultBuilder]: At program point L286(line 286) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~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)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 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 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 21:18:40,799 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2023-11-22 21:18:40,800 INFO L899 garLoopResultBuilder]: For program point L501-2(lines 501 507) no Hoare annotation was computed. [2023-11-22 21:18:40,800 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 84) no Hoare annotation was computed. [2023-11-22 21:18:40,801 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse11 (<= 2 ~d0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse17 (<= ~b1_ev~0 0)) (.cse19 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= ~z_req_up~0 0)) (.cse7 (<= 1 ~d0_val_t~0)) (.cse8 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b0_ev~0 0)) (.cse18 (<= 2 ~d1_ev~0)) (.cse10 (<= ~b1_val_t~0 ~b1_val~0)) (.cse12 (<= ~b0_val_t~0 ~b0_val~0)) (.cse13 (<= 1 ~b1_val_t~0)) (.cse14 (= ~z_val~0 0)) (.cse15 (<= ~d1_val_t~0 ~d1_val~0)) (.cse16 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse19 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-22 21:18:40,801 INFO L895 garLoopResultBuilder]: At program point L427-1(line 427) 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 (<= ~z_req_up~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse7 (<= ~b1_val_t~0 ~b1_val~0)) (.cse8 (<= ~b0_val_t~0 ~b0_val~0)) (.cse9 (<= 1 ~b1_val_t~0)) (.cse10 (= ~z_val~0 0)) (.cse11 (<= ~d1_val_t~0 ~d1_val~0)) (.cse12 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 (= ~b0_ev~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~b0_ev~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2023-11-22 21:18:40,801 INFO L895 garLoopResultBuilder]: At program point L295(lines 285 310) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~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)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 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 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 21:18:40,801 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 279 316) no Hoare annotation was computed. [2023-11-22 21:18:40,802 INFO L895 garLoopResultBuilder]: At program point L444(line 444) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~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)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 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 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 21:18:40,802 INFO L895 garLoopResultBuilder]: At program point L444-1(line 444) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (<= 2 ~z_ev~0) (= 0 ~z_val_t~0) (<= ~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-11-22 21:18:40,803 INFO L895 garLoopResultBuilder]: At program point L428(line 428) the Hoare annotation is: (let ((.cse3 (= ~comp_m1_st~0 0)) (.cse15 (<= 2 ~b1_ev~0)) (.cse16 (<= ~d1_ev~0 0)) (.cse17 (<= 2 ~d0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse18 (<= ~b1_ev~0 0)) (.cse20 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~z_req_up~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b0_ev~0 0)) (.cse19 (<= 2 ~d1_ev~0)) (.cse9 (<= ~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))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse20 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 (= ~b0_ev~0 1) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse18 .cse20 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse18 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2023-11-22 21:18:40,803 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2023-11-22 21:18:40,804 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 51 101) no Hoare annotation was computed. [2023-11-22 21:18:40,804 INFO L899 garLoopResultBuilder]: For program point L288(line 288) no Hoare annotation was computed. [2023-11-22 21:18:40,804 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2023-11-22 21:18:40,804 INFO L899 garLoopResultBuilder]: For program point L255-2(lines 251 263) no Hoare annotation was computed. [2023-11-22 21:18:40,805 INFO L895 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~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)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 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 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse4 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 21:18:40,805 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-22 21:18:40,805 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-22 21:18:40,805 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2023-11-22 21:18:40,806 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2023-11-22 21:18:40,806 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 88 96) no Hoare annotation was computed. [2023-11-22 21:18:40,806 INFO L895 garLoopResultBuilder]: At program point L405(line 405) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~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)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 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 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 21:18:40,806 INFO L899 garLoopResultBuilder]: For program point L405-1(line 405) no Hoare annotation was computed. [2023-11-22 21:18:40,807 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2023-11-22 21:18:40,807 INFO L899 garLoopResultBuilder]: For program point L290-1(lines 285 310) no Hoare annotation was computed. [2023-11-22 21:18:40,807 INFO L899 garLoopResultBuilder]: For program point L414(lines 403 416) no Hoare annotation was computed. [2023-11-22 21:18:40,807 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 306) no Hoare annotation was computed. [2023-11-22 21:18:40,810 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] [2023-11-22 21:18:40,811 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 21:18:40,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:18:40 BoogieIcfgContainer [2023-11-22 21:18:40,834 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 21:18:40,835 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 21:18:40,835 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 21:18:40,835 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 21:18:40,835 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:17:27" (3/4) ... [2023-11-22 21:18:40,837 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-22 21:18:40,839 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2023-11-22 21:18:40,839 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2023-11-22 21:18:40,840 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2023-11-22 21:18:40,840 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2023-11-22 21:18:40,840 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2023-11-22 21:18:40,845 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-11-22 21:18:40,845 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-22 21:18:40,846 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-22 21:18:40,846 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-22 21:18:40,947 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 21:18:40,947 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-22 21:18:40,948 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 21:18:40,951 INFO L158 Benchmark]: Toolchain (without parser) took 74581.51ms. Allocated memory was 211.8MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 178.7MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-11-22 21:18:40,952 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 119.5MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 21:18:40,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.39ms. Allocated memory is still 211.8MB. Free memory was 178.5MB in the beginning and 170.7MB in the end (delta: 7.8MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2023-11-22 21:18:40,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.58ms. Allocated memory is still 211.8MB. Free memory was 170.7MB in the beginning and 168.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:18:40,956 INFO L158 Benchmark]: Boogie Preprocessor took 47.33ms. Allocated memory is still 211.8MB. Free memory was 168.6MB in the beginning and 166.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:18:40,957 INFO L158 Benchmark]: RCFGBuilder took 453.63ms. Allocated memory is still 211.8MB. Free memory was 166.5MB in the beginning and 144.7MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-22 21:18:40,957 INFO L158 Benchmark]: TraceAbstraction took 73616.18ms. Allocated memory was 211.8MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 144.2MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2023-11-22 21:18:40,957 INFO L158 Benchmark]: Witness Printer took 113.03ms. Allocated memory is still 6.1GB. Free memory was 4.5GB in the beginning and 4.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-22 21:18:40,957 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.13ms. Allocated memory is still 119.5MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.39ms. Allocated memory is still 211.8MB. Free memory was 178.5MB in the beginning and 170.7MB in the end (delta: 7.8MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.58ms. Allocated memory is still 211.8MB. Free memory was 170.7MB in the beginning and 168.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.33ms. Allocated memory is still 211.8MB. Free memory was 168.6MB in the beginning and 166.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 453.63ms. Allocated memory is still 211.8MB. Free memory was 166.5MB in the beginning and 144.7MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 73616.18ms. Allocated memory was 211.8MB in the beginning and 6.1GB in the end (delta: 5.9GB). Free memory was 144.2MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. * Witness Printer took 113.03ms. Allocated memory is still 6.1GB. Free memory was 4.5GB in the beginning and 4.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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: 73.5s, OverallIterations: 33, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.5s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 25.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6524 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6468 mSDsluCounter, 10159 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6294 mSDsCounter, 727 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5383 IncrementalHoareTripleChecker+Invalid, 6110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 727 mSolverCounterUnsat, 3865 mSDtfsCounter, 5383 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4336 GetRequests, 3954 SyntacticMatches, 7 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2024 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24657occurred in iteration=32, InterpolantAutomatonStates: 234, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.8s AutomataMinimizationTime, 33 MinimizatonAttempts, 9982 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 22549 PreInvPairs, 23349 NumberOfFragments, 10750 HoareAnnotationTreeSize, 22549 FomulaSimplifications, 18192 FormulaSimplificationTreeSizeReduction, 7.4s HoareSimplificationTime, 17 FomulaSimplificationsInter, 109867 FormulaSimplificationTreeSizeReductionInter, 17.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 6588 NumberOfCodeBlocks, 6535 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 6751 ConstructedInterpolants, 0 QuantifiedInterpolants, 15421 SizeOfPredicates, 9 NumberOfNonLiveVariables, 14477 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 66 InterpolantComputations, 32 PerfectInterpolantSequences, 2062/2284 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)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (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)) && (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)) && (b0_ev <= 0)) && (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)) && (1 <= d1_val_t))) || ((((((((((((((((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)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (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)) && (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)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((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)) && (b0_ev <= 0)) && (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)) && (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)) && (b0_ev <= 0)) && (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)) && (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)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (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)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (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)) && (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)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (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)) && (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)) && (b0_ev <= 0)) && (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)) && (1 <= d1_val_t))) || ((((((((((((((((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)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (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)) && (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)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((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)) && (b0_ev <= 0)) && (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)) && (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)) && (b0_ev <= 0)) && (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)) && (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)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (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)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (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)) && (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-11-22 21:18:40,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE