./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/eca-rers2012/Problem10_label07.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 1604fff8c37e815a1951aa4b9b7ab6405ba084cc13d6cad3477e1ac67980b1be --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 10:19:08,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 10:19:08,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 10:19:08,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 10:19:08,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 10:19:08,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 10:19:08,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 10:19:08,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 10:19:08,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 10:19:08,274 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 10:19:08,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 10:19:08,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 10:19:08,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 10:19:08,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 10:19:08,275 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 10:19:08,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 10:19:08,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 10:19:08,276 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 10:19:08,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 10:19:08,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 10:19:08,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 10:19:08,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 10:19:08,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 10:19:08,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 10:19:08,278 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 10:19:08,278 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 10:19:08,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 10:19:08,279 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 10:19:08,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 10:19:08,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 10:19:08,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 10:19:08,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 10:19:08,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:19:08,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 10:19:08,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 10:19:08,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 10:19:08,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 10:19:08,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 10:19:08,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 10:19:08,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 10:19:08,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 10:19:08,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 10:19:08,282 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 -> 1604fff8c37e815a1951aa4b9b7ab6405ba084cc13d6cad3477e1ac67980b1be [2024-11-18 10:19:08,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 10:19:08,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 10:19:08,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 10:19:08,541 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 10:19:08,542 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 10:19:08,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label07.c [2024-11-18 10:19:09,860 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 10:19:10,101 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 10:19:10,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label07.c [2024-11-18 10:19:10,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4521756fd/87c00906573a4ea7a3d847e8aa8a7c03/FLAGa7829041b [2024-11-18 10:19:10,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4521756fd/87c00906573a4ea7a3d847e8aa8a7c03 [2024-11-18 10:19:10,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 10:19:10,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 10:19:10,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 10:19:10,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 10:19:10,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 10:19:10,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:19:10" (1/1) ... [2024-11-18 10:19:10,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20dc60a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:10, skipping insertion in model container [2024-11-18 10:19:10,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:19:10" (1/1) ... [2024-11-18 10:19:10,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 10:19:10,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label07.c[5227,5240] [2024-11-18 10:19:10,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:19:10,531 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 10:19:10,551 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label07.c[5227,5240] [2024-11-18 10:19:10,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:19:10,616 INFO L204 MainTranslator]: Completed translation [2024-11-18 10:19:10,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:10 WrapperNode [2024-11-18 10:19:10,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 10:19:10,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 10:19:10,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 10:19:10,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 10:19:10,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:10" (1/1) ... [2024-11-18 10:19:10,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:10" (1/1) ... [2024-11-18 10:19:10,695 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-18 10:19:10,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 10:19:10,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 10:19:10,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 10:19:10,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 10:19:10,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:10" (1/1) ... [2024-11-18 10:19:10,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:10" (1/1) ... [2024-11-18 10:19:10,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:10" (1/1) ... [2024-11-18 10:19:10,749 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 10:19:10,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:10" (1/1) ... [2024-11-18 10:19:10,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:10" (1/1) ... [2024-11-18 10:19:10,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:10" (1/1) ... [2024-11-18 10:19:10,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:10" (1/1) ... [2024-11-18 10:19:10,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:10" (1/1) ... [2024-11-18 10:19:10,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:10" (1/1) ... [2024-11-18 10:19:10,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 10:19:10,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 10:19:10,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 10:19:10,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 10:19:10,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:10" (1/1) ... [2024-11-18 10:19:10,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:19:10,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:19:10,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 10:19:10,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 10:19:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 10:19:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 10:19:10,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 10:19:10,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 10:19:10,941 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 10:19:10,943 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 10:19:11,772 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-18 10:19:11,773 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 10:19:11,798 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 10:19:11,798 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 10:19:11,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:19:11 BoogieIcfgContainer [2024-11-18 10:19:11,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 10:19:11,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 10:19:11,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 10:19:11,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 10:19:11,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:19:10" (1/3) ... [2024-11-18 10:19:11,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d99ab5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:19:11, skipping insertion in model container [2024-11-18 10:19:11,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:10" (2/3) ... [2024-11-18 10:19:11,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d99ab5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:19:11, skipping insertion in model container [2024-11-18 10:19:11,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:19:11" (3/3) ... [2024-11-18 10:19:11,806 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label07.c [2024-11-18 10:19:11,819 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 10:19:11,820 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 10:19:11,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 10:19:11,888 INFO L333 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, 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;@1225113a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 10:19:11,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 10:19:11,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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) [2024-11-18 10:19:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-18 10:19:11,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:11,901 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:19:11,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:11,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:11,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2068820151, now seen corresponding path program 1 times [2024-11-18 10:19:11,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:11,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012781710] [2024-11-18 10:19:11,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:11,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:12,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:12,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012781710] [2024-11-18 10:19:12,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012781710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:12,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:12,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:19:12,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486366659] [2024-11-18 10:19:12,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:12,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:12,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:12,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:12,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:12,261 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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) Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 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) [2024-11-18 10:19:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:12,869 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-18 10:19:12,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:12,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 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) Word has length 45 [2024-11-18 10:19:12,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:12,882 INFO L225 Difference]: With dead ends: 552 [2024-11-18 10:19:12,883 INFO L226 Difference]: Without dead ends: 282 [2024-11-18 10:19:12,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:12,889 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 143 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:12,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 76 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 10:19:12,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-18 10:19:12,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-18 10:19:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 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) [2024-11-18 10:19:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2024-11-18 10:19:12,930 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 45 [2024-11-18 10:19:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:12,930 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2024-11-18 10:19:12,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 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) [2024-11-18 10:19:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2024-11-18 10:19:12,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-18 10:19:12,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:12,935 INFO L215 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, 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] [2024-11-18 10:19:12,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 10:19:12,936 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:12,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:12,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1594520031, now seen corresponding path program 1 times [2024-11-18 10:19:12,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:12,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460056739] [2024-11-18 10:19:12,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:12,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:13,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:13,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460056739] [2024-11-18 10:19:13,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460056739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:13,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:13,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:19:13,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80076893] [2024-11-18 10:19:13,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:13,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:13,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:13,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:13,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:13,269 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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) [2024-11-18 10:19:13,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:13,683 INFO L93 Difference]: Finished difference Result 701 states and 1076 transitions. [2024-11-18 10:19:13,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:13,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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) Word has length 114 [2024-11-18 10:19:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:13,685 INFO L225 Difference]: With dead ends: 701 [2024-11-18 10:19:13,685 INFO L226 Difference]: Without dead ends: 421 [2024-11-18 10:19:13,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:13,689 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:13,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 52 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-18 10:19:13,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-18 10:19:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4428571428571428) internal successors, (606), 420 states have internal predecessors, (606), 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) [2024-11-18 10:19:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2024-11-18 10:19:13,708 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 114 [2024-11-18 10:19:13,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:13,709 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2024-11-18 10:19:13,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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) [2024-11-18 10:19:13,709 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2024-11-18 10:19:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-18 10:19:13,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:13,711 INFO L215 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, 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] [2024-11-18 10:19:13,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 10:19:13,711 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:13,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:13,712 INFO L85 PathProgramCache]: Analyzing trace with hash -335852144, now seen corresponding path program 1 times [2024-11-18 10:19:13,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:13,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520979933] [2024-11-18 10:19:13,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:13,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:13,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:13,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520979933] [2024-11-18 10:19:13,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520979933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:13,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:13,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815151041] [2024-11-18 10:19:13,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:13,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:13,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:13,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:13,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:13,824 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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) [2024-11-18 10:19:14,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:14,226 INFO L93 Difference]: Finished difference Result 562 states and 822 transitions. [2024-11-18 10:19:14,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:14,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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) Word has length 120 [2024-11-18 10:19:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:14,229 INFO L225 Difference]: With dead ends: 562 [2024-11-18 10:19:14,229 INFO L226 Difference]: Without dead ends: 560 [2024-11-18 10:19:14,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:14,230 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 139 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:14,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 11 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:14,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-18 10:19:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2024-11-18 10:19:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4428571428571428) internal successors, (606), 420 states have internal predecessors, (606), 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) [2024-11-18 10:19:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2024-11-18 10:19:14,253 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 120 [2024-11-18 10:19:14,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:14,254 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2024-11-18 10:19:14,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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) [2024-11-18 10:19:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2024-11-18 10:19:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-18 10:19:14,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:14,258 INFO L215 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, 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] [2024-11-18 10:19:14,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 10:19:14,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:14,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:14,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1816703166, now seen corresponding path program 1 times [2024-11-18 10:19:14,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:14,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673208651] [2024-11-18 10:19:14,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:14,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:14,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:14,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673208651] [2024-11-18 10:19:14,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673208651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:14,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:14,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:19:14,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273703431] [2024-11-18 10:19:14,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:14,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:14,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:14,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:14,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:14,371 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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) [2024-11-18 10:19:14,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:14,737 INFO L93 Difference]: Finished difference Result 1118 states and 1639 transitions. [2024-11-18 10:19:14,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:14,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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) Word has length 139 [2024-11-18 10:19:14,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:14,752 INFO L225 Difference]: With dead ends: 1118 [2024-11-18 10:19:14,753 INFO L226 Difference]: Without dead ends: 699 [2024-11-18 10:19:14,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:14,754 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 51 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:14,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 77 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 10:19:14,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-18 10:19:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 560. [2024-11-18 10:19:14,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3237924865831843) internal successors, (740), 559 states have internal predecessors, (740), 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) [2024-11-18 10:19:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 740 transitions. [2024-11-18 10:19:14,770 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 740 transitions. Word has length 139 [2024-11-18 10:19:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:14,770 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 740 transitions. [2024-11-18 10:19:14,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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) [2024-11-18 10:19:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 740 transitions. [2024-11-18 10:19:14,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-18 10:19:14,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:14,772 INFO L215 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:19:14,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 10:19:14,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:14,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:14,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1044206210, now seen corresponding path program 1 times [2024-11-18 10:19:14,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:14,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14548159] [2024-11-18 10:19:14,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:14,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:15,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:15,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14548159] [2024-11-18 10:19:15,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14548159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:15,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:15,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:15,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97104019] [2024-11-18 10:19:15,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:15,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:19:15,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:15,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:19:15,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:19:15,087 INFO L87 Difference]: Start difference. First operand 560 states and 740 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 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) [2024-11-18 10:19:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:15,522 INFO L93 Difference]: Finished difference Result 979 states and 1329 transitions. [2024-11-18 10:19:15,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:19:15,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 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) Word has length 163 [2024-11-18 10:19:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:15,524 INFO L225 Difference]: With dead ends: 979 [2024-11-18 10:19:15,524 INFO L226 Difference]: Without dead ends: 560 [2024-11-18 10:19:15,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 10:19:15,525 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 87 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:15,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 87 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:15,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-18 10:19:15,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-18 10:19:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3148479427549196) internal successors, (735), 559 states have internal predecessors, (735), 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) [2024-11-18 10:19:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 735 transitions. [2024-11-18 10:19:15,533 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 735 transitions. Word has length 163 [2024-11-18 10:19:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:15,533 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 735 transitions. [2024-11-18 10:19:15,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 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) [2024-11-18 10:19:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 735 transitions. [2024-11-18 10:19:15,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-18 10:19:15,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:15,535 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:19:15,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 10:19:15,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:15,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:15,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1696390515, now seen corresponding path program 1 times [2024-11-18 10:19:15,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:15,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894734366] [2024-11-18 10:19:15,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:15,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:15,660 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:15,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:15,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894734366] [2024-11-18 10:19:15,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894734366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:15,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:15,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:15,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753895392] [2024-11-18 10:19:15,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:15,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:15,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:15,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:15,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:15,662 INFO L87 Difference]: Start difference. First operand 560 states and 735 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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) [2024-11-18 10:19:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:16,056 INFO L93 Difference]: Finished difference Result 1257 states and 1753 transitions. [2024-11-18 10:19:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:16,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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) Word has length 189 [2024-11-18 10:19:16,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:16,059 INFO L225 Difference]: With dead ends: 1257 [2024-11-18 10:19:16,060 INFO L226 Difference]: Without dead ends: 838 [2024-11-18 10:19:16,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:16,061 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 67 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:16,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 214 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-18 10:19:16,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-18 10:19:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2353643966547192) internal successors, (1034), 837 states have internal predecessors, (1034), 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) [2024-11-18 10:19:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1034 transitions. [2024-11-18 10:19:16,072 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1034 transitions. Word has length 189 [2024-11-18 10:19:16,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:16,073 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1034 transitions. [2024-11-18 10:19:16,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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) [2024-11-18 10:19:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1034 transitions. [2024-11-18 10:19:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-18 10:19:16,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:16,074 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:19:16,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 10:19:16,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:16,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:16,075 INFO L85 PathProgramCache]: Analyzing trace with hash 912472353, now seen corresponding path program 1 times [2024-11-18 10:19:16,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:16,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987764562] [2024-11-18 10:19:16,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:16,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:16,397 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:16,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:16,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987764562] [2024-11-18 10:19:16,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987764562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:16,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:16,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 10:19:16,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269976309] [2024-11-18 10:19:16,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:16,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 10:19:16,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:16,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 10:19:16,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:19:16,400 INFO L87 Difference]: Start difference. First operand 838 states and 1034 transitions. Second operand has 7 states, 7 states have (on average 28.285714285714285) internal successors, (198), 6 states have internal predecessors, (198), 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) [2024-11-18 10:19:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:16,846 INFO L93 Difference]: Finished difference Result 1590 states and 1977 transitions. [2024-11-18 10:19:16,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 10:19:16,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 28.285714285714285) internal successors, (198), 6 states have internal predecessors, (198), 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) Word has length 198 [2024-11-18 10:19:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:16,849 INFO L225 Difference]: With dead ends: 1590 [2024-11-18 10:19:16,849 INFO L226 Difference]: Without dead ends: 838 [2024-11-18 10:19:16,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:19:16,852 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:16,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 25 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-18 10:19:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-18 10:19:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2305854241338112) internal successors, (1030), 837 states have internal predecessors, (1030), 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) [2024-11-18 10:19:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1030 transitions. [2024-11-18 10:19:16,867 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1030 transitions. Word has length 198 [2024-11-18 10:19:16,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:16,868 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1030 transitions. [2024-11-18 10:19:16,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.285714285714285) internal successors, (198), 6 states have internal predecessors, (198), 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) [2024-11-18 10:19:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1030 transitions. [2024-11-18 10:19:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-18 10:19:16,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:16,870 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-18 10:19:16,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 10:19:16,870 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:16,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:16,870 INFO L85 PathProgramCache]: Analyzing trace with hash -997487557, now seen corresponding path program 1 times [2024-11-18 10:19:16,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:16,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652157662] [2024-11-18 10:19:16,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:16,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:17,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:17,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652157662] [2024-11-18 10:19:17,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652157662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:17,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:17,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:17,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636228226] [2024-11-18 10:19:17,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:17,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:17,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:17,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:17,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:17,010 INFO L87 Difference]: Start difference. First operand 838 states and 1030 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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) [2024-11-18 10:19:17,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:17,438 INFO L93 Difference]: Finished difference Result 1813 states and 2342 transitions. [2024-11-18 10:19:17,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:17,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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) Word has length 234 [2024-11-18 10:19:17,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:17,441 INFO L225 Difference]: With dead ends: 1813 [2024-11-18 10:19:17,442 INFO L226 Difference]: Without dead ends: 1116 [2024-11-18 10:19:17,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:17,443 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 75 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:17,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 190 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:17,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-18 10:19:17,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 977. [2024-11-18 10:19:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.2336065573770492) internal successors, (1204), 976 states have internal predecessors, (1204), 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) [2024-11-18 10:19:17,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1204 transitions. [2024-11-18 10:19:17,460 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1204 transitions. Word has length 234 [2024-11-18 10:19:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:17,460 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1204 transitions. [2024-11-18 10:19:17,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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) [2024-11-18 10:19:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1204 transitions. [2024-11-18 10:19:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-18 10:19:17,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:17,463 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2024-11-18 10:19:17,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 10:19:17,463 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:17,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:17,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1723990694, now seen corresponding path program 1 times [2024-11-18 10:19:17,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:17,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537159844] [2024-11-18 10:19:17,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:17,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 100 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:17,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:17,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537159844] [2024-11-18 10:19:17,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537159844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 10:19:17,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158450143] [2024-11-18 10:19:17,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:17,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:19:17,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:19:17,828 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) [2024-11-18 10:19:17,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 10:19:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:17,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 10:19:17,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 10:19:18,229 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-18 10:19:18,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 10:19:18,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158450143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:18,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 10:19:18,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-18 10:19:18,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194982444] [2024-11-18 10:19:18,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:18,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:18,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:18,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:18,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:19:18,231 INFO L87 Difference]: Start difference. First operand 977 states and 1204 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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) [2024-11-18 10:19:18,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:18,609 INFO L93 Difference]: Finished difference Result 2091 states and 2595 transitions. [2024-11-18 10:19:18,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:18,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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) Word has length 272 [2024-11-18 10:19:18,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:18,613 INFO L225 Difference]: With dead ends: 2091 [2024-11-18 10:19:18,613 INFO L226 Difference]: Without dead ends: 1255 [2024-11-18 10:19:18,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:19:18,614 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 60 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:18,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 34 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-18 10:19:18,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-18 10:19:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.161084529505582) internal successors, (1456), 1254 states have internal predecessors, (1456), 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) [2024-11-18 10:19:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1456 transitions. [2024-11-18 10:19:18,633 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1456 transitions. Word has length 272 [2024-11-18 10:19:18,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:18,634 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1456 transitions. [2024-11-18 10:19:18,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 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) [2024-11-18 10:19:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1456 transitions. [2024-11-18 10:19:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-18 10:19:18,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:18,637 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-18 10:19:18,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 10:19:18,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:19:18,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:18,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:18,839 INFO L85 PathProgramCache]: Analyzing trace with hash 43115235, now seen corresponding path program 1 times [2024-11-18 10:19:18,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:18,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751302628] [2024-11-18 10:19:18,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:18,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-18 10:19:19,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:19,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751302628] [2024-11-18 10:19:19,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751302628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:19,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:19,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:19,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890530580] [2024-11-18 10:19:19,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:19,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:19,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:19,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:19,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:19,019 INFO L87 Difference]: Start difference. First operand 1255 states and 1456 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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) [2024-11-18 10:19:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:19,408 INFO L93 Difference]: Finished difference Result 1396 states and 1605 transitions. [2024-11-18 10:19:19,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:19,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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) Word has length 323 [2024-11-18 10:19:19,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:19,412 INFO L225 Difference]: With dead ends: 1396 [2024-11-18 10:19:19,412 INFO L226 Difference]: Without dead ends: 1394 [2024-11-18 10:19:19,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:19,413 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 139 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:19,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 11 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-18 10:19:19,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1116. [2024-11-18 10:19:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.1713004484304932) internal successors, (1306), 1115 states have internal predecessors, (1306), 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) [2024-11-18 10:19:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1306 transitions. [2024-11-18 10:19:19,427 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1306 transitions. Word has length 323 [2024-11-18 10:19:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:19,428 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1306 transitions. [2024-11-18 10:19:19,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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) [2024-11-18 10:19:19,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1306 transitions. [2024-11-18 10:19:19,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-18 10:19:19,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:19,431 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-18 10:19:19,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 10:19:19,431 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:19,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:19,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1416255629, now seen corresponding path program 1 times [2024-11-18 10:19:19,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:19,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202842779] [2024-11-18 10:19:19,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:19,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:19,742 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-11-18 10:19:19,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:19,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202842779] [2024-11-18 10:19:19,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202842779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:19,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:19,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:19,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162033639] [2024-11-18 10:19:19,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:19,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:19,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:19,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:19,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:19,744 INFO L87 Difference]: Start difference. First operand 1116 states and 1306 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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) [2024-11-18 10:19:20,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:20,079 INFO L93 Difference]: Finished difference Result 2089 states and 2466 transitions. [2024-11-18 10:19:20,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:20,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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) Word has length 344 [2024-11-18 10:19:20,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:20,081 INFO L225 Difference]: With dead ends: 2089 [2024-11-18 10:19:20,081 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 10:19:20,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:20,083 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 120 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:20,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 19 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 10:19:20,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 10:19:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 10:19:20,085 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) [2024-11-18 10:19:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 10:19:20,085 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 344 [2024-11-18 10:19:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:20,085 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 10:19:20,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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) [2024-11-18 10:19:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 10:19:20,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 10:19:20,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 10:19:20,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 10:19:20,091 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:19:20,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 10:19:20,193 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 10:19:20,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:19:20 BoogieIcfgContainer [2024-11-18 10:19:20,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 10:19:20,213 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 10:19:20,214 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 10:19:20,214 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 10:19:20,214 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:19:11" (3/4) ... [2024-11-18 10:19:20,216 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 10:19:20,230 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-18 10:19:20,233 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 10:19:20,234 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 10:19:20,234 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 10:19:20,329 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 10:19:20,329 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 10:19:20,329 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 10:19:20,330 INFO L158 Benchmark]: Toolchain (without parser) took 10183.38ms. Allocated memory was 176.2MB in the beginning and 337.6MB in the end (delta: 161.5MB). Free memory was 145.9MB in the beginning and 106.3MB in the end (delta: 39.6MB). Peak memory consumption was 201.0MB. Max. memory is 16.1GB. [2024-11-18 10:19:20,330 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 132.1MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 10:19:20,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.56ms. Allocated memory is still 176.2MB. Free memory was 146.8MB in the beginning and 116.1MB in the end (delta: 30.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-18 10:19:20,330 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.66ms. Allocated memory is still 176.2MB. Free memory was 116.1MB in the beginning and 108.3MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-18 10:19:20,331 INFO L158 Benchmark]: Boogie Preprocessor took 109.33ms. Allocated memory is still 176.2MB. Free memory was 108.3MB in the beginning and 97.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 10:19:20,331 INFO L158 Benchmark]: RCFGBuilder took 993.08ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 97.8MB in the beginning and 195.5MB in the end (delta: -97.7MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2024-11-18 10:19:20,331 INFO L158 Benchmark]: TraceAbstraction took 8412.67ms. Allocated memory was 232.8MB in the beginning and 337.6MB in the end (delta: 104.9MB). Free memory was 195.5MB in the beginning and 117.8MB in the end (delta: 77.7MB). Peak memory consumption was 182.5MB. Max. memory is 16.1GB. [2024-11-18 10:19:20,331 INFO L158 Benchmark]: Witness Printer took 115.89ms. Allocated memory is still 337.6MB. Free memory was 117.8MB in the beginning and 106.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 10:19:20,332 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.17ms. Allocated memory is still 132.1MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.56ms. Allocated memory is still 176.2MB. Free memory was 146.8MB in the beginning and 116.1MB in the end (delta: 30.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.66ms. Allocated memory is still 176.2MB. Free memory was 116.1MB in the beginning and 108.3MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.33ms. Allocated memory is still 176.2MB. Free memory was 108.3MB in the beginning and 97.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 993.08ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 97.8MB in the beginning and 195.5MB in the end (delta: -97.7MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8412.67ms. Allocated memory was 232.8MB in the beginning and 337.6MB in the end (delta: 104.9MB). Free memory was 195.5MB in the beginning and 117.8MB in the end (delta: 77.7MB). Peak memory consumption was 182.5MB. Max. memory is 16.1GB. * Witness Printer took 115.89ms. Allocated memory is still 337.6MB. Free memory was 117.8MB in the beginning and 106.3MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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: 149]: 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 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1096 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1096 mSDsluCounter, 796 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 668 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4589 IncrementalHoareTripleChecker+Invalid, 5257 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 668 mSolverCounterUnsat, 733 mSDtfsCounter, 4589 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1255occurred in iteration=9, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 695 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2413 NumberOfCodeBlocks, 2413 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2401 ConstructedInterpolants, 0 QuantifiedInterpolants, 8082 SizeOfPredicates, 0 NumberOfNonLiveVariables, 377 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1683/1778 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: 592]: Loop Invariant Derived loop invariant: (((((((a19 <= 9) && (a10 != 2)) && (14 == a4)) && (a12 == 0)) || ((((a19 <= 9) && (7 <= a19)) && (14 == a4)) && (a12 == 0))) || (((a10 <= 0) && (14 == a4)) && (a12 == 0))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-18 10:19:20,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE