./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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/Problem03_label29.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 372b0f8557f493ed9d29c5f8057b8dc54ad330866696fd4878e863a88379edbf --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:30:24,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:30:24,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:30:24,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:30:24,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:30:24,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:30:24,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:30:24,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:30:24,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:30:24,597 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:30:24,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:30:24,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:30:24,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:30:24,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:30:24,601 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:30:24,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:30:24,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:30:24,602 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:30:24,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:30:24,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:30:24,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:30:24,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:30:24,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:30:24,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:30:24,607 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:30:24,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:30:24,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:30:24,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:30:24,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:30:24,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:30:24,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:30:24,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:30:24,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:30:24,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:30:24,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:30:24,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:30:24,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:30:24,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:30:24,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:30:24,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:30:24,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:30:24,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:30:24,612 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 -> 372b0f8557f493ed9d29c5f8057b8dc54ad330866696fd4878e863a88379edbf [2024-11-08 10:30:24,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:30:24,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:30:24,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:30:24,919 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:30:24,920 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:30:24,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label29.c [2024-11-08 10:30:26,440 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:30:26,777 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:30:26,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label29.c [2024-11-08 10:30:26,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde30c95d/c06929cc402e49fe93aa2f203f34e99d/FLAGddd888d6b [2024-11-08 10:30:26,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde30c95d/c06929cc402e49fe93aa2f203f34e99d [2024-11-08 10:30:26,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:30:26,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:30:26,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:30:26,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:30:26,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:30:26,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:30:26" (1/1) ... [2024-11-08 10:30:26,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eadc2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:26, skipping insertion in model container [2024-11-08 10:30:26,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:30:26" (1/1) ... [2024-11-08 10:30:26,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:30:27,426 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/Problem03_label29.c[58258,58271] [2024-11-08 10:30:27,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:30:27,471 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:30:27,696 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/Problem03_label29.c[58258,58271] [2024-11-08 10:30:27,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:30:27,731 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:30:27,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:27 WrapperNode [2024-11-08 10:30:27,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:30:27,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:30:27,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:30:27,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:30:27,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:27" (1/1) ... [2024-11-08 10:30:27,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:27" (1/1) ... [2024-11-08 10:30:27,870 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-11-08 10:30:27,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:30:27,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:30:27,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:30:27,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:30:27,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:27" (1/1) ... [2024-11-08 10:30:27,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:27" (1/1) ... [2024-11-08 10:30:27,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:27" (1/1) ... [2024-11-08 10:30:27,945 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-08 10:30:27,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:27" (1/1) ... [2024-11-08 10:30:27,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:27" (1/1) ... [2024-11-08 10:30:27,994 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:27" (1/1) ... [2024-11-08 10:30:28,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:27" (1/1) ... [2024-11-08 10:30:28,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:27" (1/1) ... [2024-11-08 10:30:28,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:27" (1/1) ... [2024-11-08 10:30:28,048 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:30:28,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:30:28,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:30:28,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:30:28,051 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:27" (1/1) ... [2024-11-08 10:30:28,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:30:28,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:28,085 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-08 10:30:28,091 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-08 10:30:28,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:30:28,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:30:28,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:30:28,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:30:28,296 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:30:28,298 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:30:30,216 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-08 10:30:30,216 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:30:30,242 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:30:30,244 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:30:30,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:30:30 BoogieIcfgContainer [2024-11-08 10:30:30,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:30:30,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:30:30,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:30:30,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:30:30,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:30:26" (1/3) ... [2024-11-08 10:30:30,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7176758f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:30:30, skipping insertion in model container [2024-11-08 10:30:30,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:30:27" (2/3) ... [2024-11-08 10:30:30,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7176758f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:30:30, skipping insertion in model container [2024-11-08 10:30:30,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:30:30" (3/3) ... [2024-11-08 10:30:30,255 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label29.c [2024-11-08 10:30:30,272 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:30:30,272 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:30:30,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:30:30,362 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;@7f3d606c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:30:30,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:30:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 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-08 10:30:30,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 10:30:30,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:30,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:30:30,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:30,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:30,398 INFO L85 PathProgramCache]: Analyzing trace with hash 800753066, now seen corresponding path program 1 times [2024-11-08 10:30:30,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:30,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396221969] [2024-11-08 10:30:30,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:30,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:31,521 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-08 10:30:31,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:31,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396221969] [2024-11-08 10:30:31,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396221969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:31,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:31,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:31,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945072743] [2024-11-08 10:30:31,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:31,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:31,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:31,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:31,562 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 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 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 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-08 10:30:32,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:32,681 INFO L93 Difference]: Finished difference Result 823 states and 1459 transitions. [2024-11-08 10:30:32,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:32,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 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 178 [2024-11-08 10:30:32,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:32,696 INFO L225 Difference]: With dead ends: 823 [2024-11-08 10:30:32,697 INFO L226 Difference]: Without dead ends: 444 [2024-11-08 10:30:32,701 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-08 10:30:32,704 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 53 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:32,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 244 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 10:30:32,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-08 10:30:32,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 443. [2024-11-08 10:30:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.420814479638009) internal successors, (628), 442 states have internal predecessors, (628), 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-08 10:30:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 628 transitions. [2024-11-08 10:30:32,774 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 628 transitions. Word has length 178 [2024-11-08 10:30:32,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:32,776 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 628 transitions. [2024-11-08 10:30:32,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 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-08 10:30:32,777 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 628 transitions. [2024-11-08 10:30:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 10:30:32,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:32,782 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:30:32,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:30:32,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:32,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash -726821495, now seen corresponding path program 1 times [2024-11-08 10:30:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:32,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007939705] [2024-11-08 10:30:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:32,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:30:33,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:33,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007939705] [2024-11-08 10:30:33,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007939705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:33,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:33,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:33,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733281181] [2024-11-08 10:30:33,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:33,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:33,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:33,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:33,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:33,068 INFO L87 Difference]: Start difference. First operand 443 states and 628 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 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-08 10:30:33,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:33,947 INFO L93 Difference]: Finished difference Result 1310 states and 1864 transitions. [2024-11-08 10:30:33,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:33,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 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 186 [2024-11-08 10:30:33,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:33,951 INFO L225 Difference]: With dead ends: 1310 [2024-11-08 10:30:33,951 INFO L226 Difference]: Without dead ends: 869 [2024-11-08 10:30:33,953 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-08 10:30:33,954 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:33,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 92 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:30:33,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2024-11-08 10:30:33,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 855. [2024-11-08 10:30:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 854 states have (on average 1.3864168618266979) internal successors, (1184), 854 states have internal predecessors, (1184), 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-08 10:30:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1184 transitions. [2024-11-08 10:30:33,993 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1184 transitions. Word has length 186 [2024-11-08 10:30:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:33,994 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1184 transitions. [2024-11-08 10:30:33,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 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-08 10:30:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1184 transitions. [2024-11-08 10:30:33,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 10:30:33,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:33,997 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:30:33,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:30:33,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:34,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:34,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1639909094, now seen corresponding path program 1 times [2024-11-08 10:30:34,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:34,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90500843] [2024-11-08 10:30:34,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:34,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:30:34,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:34,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90500843] [2024-11-08 10:30:34,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90500843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:34,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:34,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:34,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031144665] [2024-11-08 10:30:34,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:34,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:34,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:34,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:34,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:34,300 INFO L87 Difference]: Start difference. First operand 855 states and 1184 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 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-08 10:30:35,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:35,112 INFO L93 Difference]: Finished difference Result 2539 states and 3516 transitions. [2024-11-08 10:30:35,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:35,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 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 191 [2024-11-08 10:30:35,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:35,119 INFO L225 Difference]: With dead ends: 2539 [2024-11-08 10:30:35,120 INFO L226 Difference]: Without dead ends: 1686 [2024-11-08 10:30:35,121 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-08 10:30:35,122 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 243 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:35,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 222 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:30:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2024-11-08 10:30:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1682. [2024-11-08 10:30:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1681 states have (on average 1.3248066627007733) internal successors, (2227), 1681 states have internal predecessors, (2227), 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-08 10:30:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2227 transitions. [2024-11-08 10:30:35,161 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2227 transitions. Word has length 191 [2024-11-08 10:30:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:35,162 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 2227 transitions. [2024-11-08 10:30:35,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 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-08 10:30:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2227 transitions. [2024-11-08 10:30:35,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-08 10:30:35,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:35,168 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:30:35,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:30:35,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:35,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:35,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1294418448, now seen corresponding path program 1 times [2024-11-08 10:30:35,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:35,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664413962] [2024-11-08 10:30:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:35,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:30:35,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:35,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664413962] [2024-11-08 10:30:35,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664413962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:35,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:35,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:35,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369752013] [2024-11-08 10:30:35,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:35,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:35,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:35,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:35,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:35,472 INFO L87 Difference]: Start difference. First operand 1682 states and 2227 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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-08 10:30:36,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:36,295 INFO L93 Difference]: Finished difference Result 4178 states and 5696 transitions. [2024-11-08 10:30:36,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:36,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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-08 10:30:36,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:36,304 INFO L225 Difference]: With dead ends: 4178 [2024-11-08 10:30:36,305 INFO L226 Difference]: Without dead ends: 2498 [2024-11-08 10:30:36,307 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-08 10:30:36,309 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 236 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:36,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 401 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:30:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2024-11-08 10:30:36,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2496. [2024-11-08 10:30:36,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.2681362725450902) internal successors, (3164), 2495 states have internal predecessors, (3164), 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-08 10:30:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3164 transitions. [2024-11-08 10:30:36,361 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3164 transitions. Word has length 198 [2024-11-08 10:30:36,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:36,362 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 3164 transitions. [2024-11-08 10:30:36,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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-08 10:30:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3164 transitions. [2024-11-08 10:30:36,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 10:30:36,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:36,368 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:30:36,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:30:36,369 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:36,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:36,370 INFO L85 PathProgramCache]: Analyzing trace with hash -225463204, now seen corresponding path program 1 times [2024-11-08 10:30:36,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:36,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618961980] [2024-11-08 10:30:36,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:36,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:30:36,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:36,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618961980] [2024-11-08 10:30:36,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618961980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:36,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:36,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:36,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846721431] [2024-11-08 10:30:36,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:36,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:36,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:36,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:36,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:36,769 INFO L87 Difference]: Start difference. First operand 2496 states and 3164 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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-08 10:30:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:37,574 INFO L93 Difference]: Finished difference Result 6217 states and 7859 transitions. [2024-11-08 10:30:37,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:37,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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 206 [2024-11-08 10:30:37,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:37,586 INFO L225 Difference]: With dead ends: 6217 [2024-11-08 10:30:37,586 INFO L226 Difference]: Without dead ends: 3723 [2024-11-08 10:30:37,590 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-08 10:30:37,591 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 214 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:37,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 380 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:30:37,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2024-11-08 10:30:37,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3715. [2024-11-08 10:30:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3715 states, 3714 states have (on average 1.2242864835756597) internal successors, (4547), 3714 states have internal predecessors, (4547), 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-08 10:30:37,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3715 states to 3715 states and 4547 transitions. [2024-11-08 10:30:37,691 INFO L78 Accepts]: Start accepts. Automaton has 3715 states and 4547 transitions. Word has length 206 [2024-11-08 10:30:37,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:37,692 INFO L471 AbstractCegarLoop]: Abstraction has 3715 states and 4547 transitions. [2024-11-08 10:30:37,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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-08 10:30:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3715 states and 4547 transitions. [2024-11-08 10:30:37,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 10:30:37,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:37,701 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:30:37,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:30:37,701 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:37,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:37,702 INFO L85 PathProgramCache]: Analyzing trace with hash 409707928, now seen corresponding path program 1 times [2024-11-08 10:30:37,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:37,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10883885] [2024-11-08 10:30:37,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:37,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:30:38,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:38,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10883885] [2024-11-08 10:30:38,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10883885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:38,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:38,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:38,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990680013] [2024-11-08 10:30:38,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:38,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:38,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:38,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:38,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:38,060 INFO L87 Difference]: Start difference. First operand 3715 states and 4547 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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-08 10:30:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:38,955 INFO L93 Difference]: Finished difference Result 9470 states and 11742 transitions. [2024-11-08 10:30:38,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:38,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 213 [2024-11-08 10:30:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:38,971 INFO L225 Difference]: With dead ends: 9470 [2024-11-08 10:30:38,972 INFO L226 Difference]: Without dead ends: 5757 [2024-11-08 10:30:38,975 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-08 10:30:38,977 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 202 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:38,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 390 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:30:38,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2024-11-08 10:30:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5550. [2024-11-08 10:30:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5550 states, 5549 states have (on average 1.2094071003784466) internal successors, (6711), 5549 states have internal predecessors, (6711), 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-08 10:30:39,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5550 states to 5550 states and 6711 transitions. [2024-11-08 10:30:39,065 INFO L78 Accepts]: Start accepts. Automaton has 5550 states and 6711 transitions. Word has length 213 [2024-11-08 10:30:39,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:39,065 INFO L471 AbstractCegarLoop]: Abstraction has 5550 states and 6711 transitions. [2024-11-08 10:30:39,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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-08 10:30:39,067 INFO L276 IsEmpty]: Start isEmpty. Operand 5550 states and 6711 transitions. [2024-11-08 10:30:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 10:30:39,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:39,075 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:30:39,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:30:39,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:39,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1735843397, now seen corresponding path program 1 times [2024-11-08 10:30:39,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:39,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607179208] [2024-11-08 10:30:39,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:39,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:30:39,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:39,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607179208] [2024-11-08 10:30:39,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607179208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:39,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:39,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:39,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69361787] [2024-11-08 10:30:39,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:39,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:39,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:39,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:39,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:39,292 INFO L87 Difference]: Start difference. First operand 5550 states and 6711 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 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-08 10:30:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:40,171 INFO L93 Difference]: Finished difference Result 16391 states and 19793 transitions. [2024-11-08 10:30:40,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:40,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 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 221 [2024-11-08 10:30:40,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:40,246 INFO L225 Difference]: With dead ends: 16391 [2024-11-08 10:30:40,247 INFO L226 Difference]: Without dead ends: 10843 [2024-11-08 10:30:40,254 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-08 10:30:40,255 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 234 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:40,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 211 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:30:40,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10843 states. [2024-11-08 10:30:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10843 to 10840. [2024-11-08 10:30:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10840 states, 10839 states have (on average 1.1777839284066796) internal successors, (12766), 10839 states have internal predecessors, (12766), 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-08 10:30:40,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10840 states to 10840 states and 12766 transitions. [2024-11-08 10:30:40,449 INFO L78 Accepts]: Start accepts. Automaton has 10840 states and 12766 transitions. Word has length 221 [2024-11-08 10:30:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:40,449 INFO L471 AbstractCegarLoop]: Abstraction has 10840 states and 12766 transitions. [2024-11-08 10:30:40,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 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-08 10:30:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 10840 states and 12766 transitions. [2024-11-08 10:30:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-08 10:30:40,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:40,464 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:30:40,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:30:40,465 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:40,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash -963709385, now seen corresponding path program 1 times [2024-11-08 10:30:40,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:40,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476953088] [2024-11-08 10:30:40,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:40,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:30:40,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:40,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476953088] [2024-11-08 10:30:40,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476953088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:40,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:40,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:40,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774486808] [2024-11-08 10:30:40,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:40,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:30:40,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:40,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:30:40,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:30:40,863 INFO L87 Difference]: Start difference. First operand 10840 states and 12766 transitions. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 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-08 10:30:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:42,023 INFO L93 Difference]: Finished difference Result 21704 states and 25581 transitions. [2024-11-08 10:30:42,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:30:42,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 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 222 [2024-11-08 10:30:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:42,055 INFO L225 Difference]: With dead ends: 21704 [2024-11-08 10:30:42,056 INFO L226 Difference]: Without dead ends: 10866 [2024-11-08 10:30:42,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:30:42,072 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 405 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:42,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 237 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 10:30:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10866 states. [2024-11-08 10:30:42,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10866 to 10231. [2024-11-08 10:30:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10231 states, 10230 states have (on average 1.180058651026393) internal successors, (12072), 10230 states have internal predecessors, (12072), 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-08 10:30:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10231 states to 10231 states and 12072 transitions. [2024-11-08 10:30:42,232 INFO L78 Accepts]: Start accepts. Automaton has 10231 states and 12072 transitions. Word has length 222 [2024-11-08 10:30:42,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:42,233 INFO L471 AbstractCegarLoop]: Abstraction has 10231 states and 12072 transitions. [2024-11-08 10:30:42,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 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-08 10:30:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 10231 states and 12072 transitions. [2024-11-08 10:30:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-08 10:30:42,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:42,248 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:30:42,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 10:30:42,248 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:42,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:42,249 INFO L85 PathProgramCache]: Analyzing trace with hash 637188002, now seen corresponding path program 1 times [2024-11-08 10:30:42,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:42,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374488005] [2024-11-08 10:30:42,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:42,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:30:42,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:42,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374488005] [2024-11-08 10:30:42,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374488005] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:42,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907649628] [2024-11-08 10:30:42,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:42,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:42,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:42,762 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-08 10:30:42,763 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-08 10:30:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:42,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:30:42,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:43,183 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 10:30:43,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:43,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907649628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:43,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:43,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:43,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850387729] [2024-11-08 10:30:43,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:43,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:43,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:43,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:43,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:43,189 INFO L87 Difference]: Start difference. First operand 10231 states and 12072 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-08 10:30:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:43,829 INFO L93 Difference]: Finished difference Result 24952 states and 29741 transitions. [2024-11-08 10:30:43,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:43,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 229 [2024-11-08 10:30:43,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:43,854 INFO L225 Difference]: With dead ends: 24952 [2024-11-08 10:30:43,855 INFO L226 Difference]: Without dead ends: 14723 [2024-11-08 10:30:43,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:43,871 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 67 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:43,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 164 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:43,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14723 states. [2024-11-08 10:30:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14723 to 13891. [2024-11-08 10:30:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13891 states, 13890 states have (on average 1.19812814974802) internal successors, (16642), 13890 states have internal predecessors, (16642), 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-08 10:30:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13891 states to 13891 states and 16642 transitions. [2024-11-08 10:30:44,045 INFO L78 Accepts]: Start accepts. Automaton has 13891 states and 16642 transitions. Word has length 229 [2024-11-08 10:30:44,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:44,046 INFO L471 AbstractCegarLoop]: Abstraction has 13891 states and 16642 transitions. [2024-11-08 10:30:44,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-08 10:30:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 13891 states and 16642 transitions. [2024-11-08 10:30:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-08 10:30:44,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:44,073 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:30:44,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 10:30:44,274 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-08 10:30:44,275 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:44,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:44,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2089717992, now seen corresponding path program 1 times [2024-11-08 10:30:44,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:44,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202007811] [2024-11-08 10:30:44,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:44,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 10:30:44,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:44,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202007811] [2024-11-08 10:30:44,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202007811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:44,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:44,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:44,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731735107] [2024-11-08 10:30:44,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:44,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:30:44,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:44,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:30:44,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:30:44,646 INFO L87 Difference]: Start difference. First operand 13891 states and 16642 transitions. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 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-08 10:30:45,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:45,320 INFO L93 Difference]: Finished difference Result 25904 states and 31126 transitions. [2024-11-08 10:30:45,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:30:45,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 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 257 [2024-11-08 10:30:45,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:45,340 INFO L225 Difference]: With dead ends: 25904 [2024-11-08 10:30:45,340 INFO L226 Difference]: Without dead ends: 12015 [2024-11-08 10:30:45,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:30:45,359 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 463 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:45,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 55 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12015 states. [2024-11-08 10:30:45,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12015 to 12015. [2024-11-08 10:30:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12015 states, 12014 states have (on average 1.140086565673381) internal successors, (13697), 12014 states have internal predecessors, (13697), 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-08 10:30:45,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12015 states to 12015 states and 13697 transitions. [2024-11-08 10:30:45,493 INFO L78 Accepts]: Start accepts. Automaton has 12015 states and 13697 transitions. Word has length 257 [2024-11-08 10:30:45,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:45,494 INFO L471 AbstractCegarLoop]: Abstraction has 12015 states and 13697 transitions. [2024-11-08 10:30:45,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 3 states have internal predecessors, (230), 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-08 10:30:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 12015 states and 13697 transitions. [2024-11-08 10:30:45,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-08 10:30:45,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:45,510 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:30:45,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 10:30:45,511 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:45,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:45,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1480847212, now seen corresponding path program 1 times [2024-11-08 10:30:45,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:45,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256053578] [2024-11-08 10:30:45,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-08 10:30:45,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:45,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256053578] [2024-11-08 10:30:45,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256053578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:45,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:45,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:45,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391563839] [2024-11-08 10:30:45,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:45,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:45,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:45,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:45,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:45,815 INFO L87 Difference]: Start difference. First operand 12015 states and 13697 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 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-08 10:30:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:46,481 INFO L93 Difference]: Finished difference Result 30134 states and 34280 transitions. [2024-11-08 10:30:46,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:46,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 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 279 [2024-11-08 10:30:46,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:46,510 INFO L225 Difference]: With dead ends: 30134 [2024-11-08 10:30:46,511 INFO L226 Difference]: Without dead ends: 18121 [2024-11-08 10:30:46,525 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-08 10:30:46,526 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 203 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:46,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 147 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:46,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18121 states. [2024-11-08 10:30:46,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18121 to 18120. [2024-11-08 10:30:46,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18120 states, 18119 states have (on average 1.133727026877863) internal successors, (20542), 18119 states have internal predecessors, (20542), 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-08 10:30:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18120 states to 18120 states and 20542 transitions. [2024-11-08 10:30:46,736 INFO L78 Accepts]: Start accepts. Automaton has 18120 states and 20542 transitions. Word has length 279 [2024-11-08 10:30:46,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:46,737 INFO L471 AbstractCegarLoop]: Abstraction has 18120 states and 20542 transitions. [2024-11-08 10:30:46,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 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-08 10:30:46,737 INFO L276 IsEmpty]: Start isEmpty. Operand 18120 states and 20542 transitions. [2024-11-08 10:30:46,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-08 10:30:46,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:46,760 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:30:46,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 10:30:46,761 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:46,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:46,761 INFO L85 PathProgramCache]: Analyzing trace with hash 683669601, now seen corresponding path program 1 times [2024-11-08 10:30:46,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:46,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960565073] [2024-11-08 10:30:46,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:46,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 107 proven. 6 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-08 10:30:47,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:47,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960565073] [2024-11-08 10:30:47,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960565073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:47,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814428984] [2024-11-08 10:30:47,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:47,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:47,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:47,289 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:47,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 10:30:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:47,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:30:47,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-08 10:30:47,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:47,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814428984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:47,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:47,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:47,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995646824] [2024-11-08 10:30:47,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:47,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:47,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:47,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:47,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:47,510 INFO L87 Difference]: Start difference. First operand 18120 states and 20542 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-08 10:30:48,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:48,186 INFO L93 Difference]: Finished difference Result 41520 states and 47544 transitions. [2024-11-08 10:30:48,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:48,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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 286 [2024-11-08 10:30:48,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:48,220 INFO L225 Difference]: With dead ends: 41520 [2024-11-08 10:30:48,220 INFO L226 Difference]: Without dead ends: 23402 [2024-11-08 10:30:48,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:48,238 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 218 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:48,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 134 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:48,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23402 states. [2024-11-08 10:30:48,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23402 to 22992. [2024-11-08 10:30:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22992 states, 22991 states have (on average 1.114175112000348) internal successors, (25616), 22991 states have internal predecessors, (25616), 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-08 10:30:48,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22992 states to 22992 states and 25616 transitions. [2024-11-08 10:30:48,593 INFO L78 Accepts]: Start accepts. Automaton has 22992 states and 25616 transitions. Word has length 286 [2024-11-08 10:30:48,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:48,594 INFO L471 AbstractCegarLoop]: Abstraction has 22992 states and 25616 transitions. [2024-11-08 10:30:48,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-08 10:30:48,594 INFO L276 IsEmpty]: Start isEmpty. Operand 22992 states and 25616 transitions. [2024-11-08 10:30:48,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-08 10:30:48,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:48,621 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:48,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 10:30:48,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 10:30:48,822 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:48,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:48,823 INFO L85 PathProgramCache]: Analyzing trace with hash -115023720, now seen corresponding path program 1 times [2024-11-08 10:30:48,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:48,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742330303] [2024-11-08 10:30:48,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:48,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 10:30:49,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:49,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742330303] [2024-11-08 10:30:49,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742330303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:49,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:49,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:49,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086138202] [2024-11-08 10:30:49,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:49,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:30:49,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:49,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:30:49,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:30:49,238 INFO L87 Difference]: Start difference. First operand 22992 states and 25616 transitions. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 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-08 10:30:50,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:50,369 INFO L93 Difference]: Finished difference Result 52087 states and 58331 transitions. [2024-11-08 10:30:50,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:30:50,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 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 306 [2024-11-08 10:30:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:50,399 INFO L225 Difference]: With dead ends: 52087 [2024-11-08 10:30:50,399 INFO L226 Difference]: Without dead ends: 29097 [2024-11-08 10:30:50,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:30:50,417 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 362 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:50,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 93 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 10:30:50,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29097 states. [2024-11-08 10:30:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29097 to 26041. [2024-11-08 10:30:50,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26041 states, 26040 states have (on average 1.1178571428571429) internal successors, (29109), 26040 states have internal predecessors, (29109), 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-08 10:30:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26041 states to 26041 states and 29109 transitions. [2024-11-08 10:30:50,719 INFO L78 Accepts]: Start accepts. Automaton has 26041 states and 29109 transitions. Word has length 306 [2024-11-08 10:30:50,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:50,719 INFO L471 AbstractCegarLoop]: Abstraction has 26041 states and 29109 transitions. [2024-11-08 10:30:50,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 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-08 10:30:50,720 INFO L276 IsEmpty]: Start isEmpty. Operand 26041 states and 29109 transitions. [2024-11-08 10:30:50,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-08 10:30:50,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:50,735 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:30:50,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 10:30:50,735 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:50,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:50,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1250760408, now seen corresponding path program 1 times [2024-11-08 10:30:50,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:50,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633164975] [2024-11-08 10:30:50,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:50,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:51,203 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 100 proven. 6 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-08 10:30:51,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:51,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633164975] [2024-11-08 10:30:51,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633164975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:51,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894808517] [2024-11-08 10:30:51,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:51,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:51,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:51,206 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:51,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 10:30:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:51,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:30:51,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:51,604 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-08 10:30:51,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:51,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894808517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:51,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:51,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:51,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52168090] [2024-11-08 10:30:51,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:51,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:51,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:51,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:51,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:51,607 INFO L87 Difference]: Start difference. First operand 26041 states and 29109 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-08 10:30:52,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:52,527 INFO L93 Difference]: Finished difference Result 52084 states and 58222 transitions. [2024-11-08 10:30:52,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:52,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 312 [2024-11-08 10:30:52,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:52,560 INFO L225 Difference]: With dead ends: 52084 [2024-11-08 10:30:52,561 INFO L226 Difference]: Without dead ends: 26045 [2024-11-08 10:30:52,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:52,581 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 85 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:52,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 287 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:30:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26045 states. [2024-11-08 10:30:52,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26045 to 26041. [2024-11-08 10:30:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26041 states, 26040 states have (on average 1.1134792626728112) internal successors, (28995), 26040 states have internal predecessors, (28995), 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-08 10:30:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26041 states to 26041 states and 28995 transitions. [2024-11-08 10:30:52,944 INFO L78 Accepts]: Start accepts. Automaton has 26041 states and 28995 transitions. Word has length 312 [2024-11-08 10:30:52,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:52,945 INFO L471 AbstractCegarLoop]: Abstraction has 26041 states and 28995 transitions. [2024-11-08 10:30:52,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-08 10:30:52,945 INFO L276 IsEmpty]: Start isEmpty. Operand 26041 states and 28995 transitions. [2024-11-08 10:30:52,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-11-08 10:30:52,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:52,973 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:30:52,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 10:30:53,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:53,174 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:53,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:53,175 INFO L85 PathProgramCache]: Analyzing trace with hash 977806869, now seen corresponding path program 1 times [2024-11-08 10:30:53,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:53,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153965992] [2024-11-08 10:30:53,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:53,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 136 proven. 6 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-08 10:30:53,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:53,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153965992] [2024-11-08 10:30:53,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153965992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:53,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871201843] [2024-11-08 10:30:53,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:53,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:53,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:53,647 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:53,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 10:30:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:53,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:30:53,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-11-08 10:30:54,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:54,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871201843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:54,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:54,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:54,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982288679] [2024-11-08 10:30:54,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:54,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:54,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:54,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:54,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:54,272 INFO L87 Difference]: Start difference. First operand 26041 states and 28995 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-08 10:30:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:54,857 INFO L93 Difference]: Finished difference Result 52084 states and 57994 transitions. [2024-11-08 10:30:54,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:54,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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 358 [2024-11-08 10:30:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:54,885 INFO L225 Difference]: With dead ends: 52084 [2024-11-08 10:30:54,885 INFO L226 Difference]: Without dead ends: 26045 [2024-11-08 10:30:54,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:54,902 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 89 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:54,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 56 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:30:54,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26045 states. [2024-11-08 10:30:55,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26045 to 26041. [2024-11-08 10:30:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26041 states, 26040 states have (on average 1.1130952380952381) internal successors, (28985), 26040 states have internal predecessors, (28985), 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-08 10:30:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26041 states to 26041 states and 28985 transitions. [2024-11-08 10:30:55,146 INFO L78 Accepts]: Start accepts. Automaton has 26041 states and 28985 transitions. Word has length 358 [2024-11-08 10:30:55,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:55,146 INFO L471 AbstractCegarLoop]: Abstraction has 26041 states and 28985 transitions. [2024-11-08 10:30:55,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-08 10:30:55,147 INFO L276 IsEmpty]: Start isEmpty. Operand 26041 states and 28985 transitions. [2024-11-08 10:30:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-11-08 10:30:55,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:55,170 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:55,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 10:30:55,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 10:30:55,371 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:55,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:55,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1604563319, now seen corresponding path program 1 times [2024-11-08 10:30:55,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:55,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868616508] [2024-11-08 10:30:55,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:55,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-08 10:30:55,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:55,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868616508] [2024-11-08 10:30:55,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868616508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:55,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000027278] [2024-11-08 10:30:55,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:55,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:55,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:55,868 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:55,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 10:30:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:56,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:30:56,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 10:30:56,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:56,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000027278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:56,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:56,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:56,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634445893] [2024-11-08 10:30:56,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:56,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:56,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:56,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:56,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:56,125 INFO L87 Difference]: Start difference. First operand 26041 states and 28985 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-08 10:30:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:56,829 INFO L93 Difference]: Finished difference Result 54321 states and 60569 transitions. [2024-11-08 10:30:56,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:56,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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 365 [2024-11-08 10:30:56,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:56,859 INFO L225 Difference]: With dead ends: 54321 [2024-11-08 10:30:56,859 INFO L226 Difference]: Without dead ends: 28282 [2024-11-08 10:30:56,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:56,876 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 164 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:56,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 359 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:56,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28282 states. [2024-11-08 10:30:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28282 to 27465. [2024-11-08 10:30:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27465 states, 27464 states have (on average 1.115751529274687) internal successors, (30643), 27464 states have internal predecessors, (30643), 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-08 10:30:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27465 states to 27465 states and 30643 transitions. [2024-11-08 10:30:57,281 INFO L78 Accepts]: Start accepts. Automaton has 27465 states and 30643 transitions. Word has length 365 [2024-11-08 10:30:57,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:57,282 INFO L471 AbstractCegarLoop]: Abstraction has 27465 states and 30643 transitions. [2024-11-08 10:30:57,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-08 10:30:57,282 INFO L276 IsEmpty]: Start isEmpty. Operand 27465 states and 30643 transitions. [2024-11-08 10:30:57,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-11-08 10:30:57,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:57,322 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-08 10:30:57,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 10:30:57,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 10:30:57,523 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:57,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:57,524 INFO L85 PathProgramCache]: Analyzing trace with hash -597140025, now seen corresponding path program 1 times [2024-11-08 10:30:57,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:57,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461189272] [2024-11-08 10:30:57,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:57,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-08 10:30:58,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:58,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461189272] [2024-11-08 10:30:58,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461189272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:58,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944056999] [2024-11-08 10:30:58,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:58,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:58,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:58,205 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:58,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 10:30:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:58,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:30:58,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:58,511 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-08 10:30:58,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:58,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944056999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:58,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:58,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:58,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657156952] [2024-11-08 10:30:58,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:58,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:30:58,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:58,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:30:58,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:30:58,514 INFO L87 Difference]: Start difference. First operand 27465 states and 30643 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 3 states have internal predecessors, (217), 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-08 10:30:59,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:59,398 INFO L93 Difference]: Finished difference Result 73841 states and 82581 transitions. [2024-11-08 10:30:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:30:59,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 3 states have internal predecessors, (217), 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 369 [2024-11-08 10:30:59,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:59,457 INFO L225 Difference]: With dead ends: 73841 [2024-11-08 10:30:59,457 INFO L226 Difference]: Without dead ends: 46378 [2024-11-08 10:30:59,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:30:59,484 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 525 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:59,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 310 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:30:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46378 states. [2024-11-08 10:30:59,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46378 to 43733. [2024-11-08 10:31:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43733 states, 43732 states have (on average 1.1205981889691758) internal successors, (49006), 43732 states have internal predecessors, (49006), 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-08 10:31:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43733 states to 43733 states and 49006 transitions. [2024-11-08 10:31:00,269 INFO L78 Accepts]: Start accepts. Automaton has 43733 states and 49006 transitions. Word has length 369 [2024-11-08 10:31:00,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:00,270 INFO L471 AbstractCegarLoop]: Abstraction has 43733 states and 49006 transitions. [2024-11-08 10:31:00,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 3 states have internal predecessors, (217), 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-08 10:31:00,270 INFO L276 IsEmpty]: Start isEmpty. Operand 43733 states and 49006 transitions. [2024-11-08 10:31:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2024-11-08 10:31:00,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:31:00,302 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:31:00,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 10:31:00,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 10:31:00,503 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:31:00,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:31:00,503 INFO L85 PathProgramCache]: Analyzing trace with hash 700054617, now seen corresponding path program 1 times [2024-11-08 10:31:00,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:31:00,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743340613] [2024-11-08 10:31:00,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:00,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:31:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:01,150 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 147 proven. 6 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-08 10:31:01,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:31:01,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743340613] [2024-11-08 10:31:01,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743340613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:31:01,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788240538] [2024-11-08 10:31:01,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:31:01,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:01,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:31:01,153 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:31:01,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 10:31:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:31:01,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:31:01,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:31:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-11-08 10:31:01,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:31:01,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788240538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:31:01,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:31:01,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:31:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145263604] [2024-11-08 10:31:01,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:31:01,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:31:01,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:31:01,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:31:01,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:01,414 INFO L87 Difference]: Start difference. First operand 43733 states and 49006 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-08 10:31:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:31:02,208 INFO L93 Difference]: Finished difference Result 86241 states and 96286 transitions. [2024-11-08 10:31:02,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:31:02,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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 374 [2024-11-08 10:31:02,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:31:02,210 INFO L225 Difference]: With dead ends: 86241 [2024-11-08 10:31:02,210 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:31:02,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:31:02,237 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 219 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:31:02,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 301 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:31:02,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:31:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:31:02,238 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-08 10:31:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:31:02,239 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 374 [2024-11-08 10:31:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:31:02,239 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:31:02,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-08 10:31:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:31:02,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:31:02,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:31:02,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 10:31:02,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:31:02,445 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:31:02,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:31:05,745 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:31:05,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:31:05 BoogieIcfgContainer [2024-11-08 10:31:05,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:31:05,785 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:31:05,785 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:31:05,785 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:31:05,786 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:30:30" (3/4) ... [2024-11-08 10:31:05,788 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:31:05,815 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 10:31:05,817 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:31:05,819 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:31:05,821 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:31:06,038 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:31:06,039 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:31:06,039 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:31:06,042 INFO L158 Benchmark]: Toolchain (without parser) took 39217.53ms. Allocated memory was 186.6MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 130.1MB in the beginning and 5.1GB in the end (delta: -4.9GB). Peak memory consumption was 550.0MB. Max. memory is 16.1GB. [2024-11-08 10:31:06,043 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory was 65.7MB in the beginning and 65.7MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:31:06,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 907.23ms. Allocated memory is still 186.6MB. Free memory was 130.1MB in the beginning and 113.2MB in the end (delta: 16.9MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2024-11-08 10:31:06,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 138.45ms. Allocated memory is still 186.6MB. Free memory was 113.2MB in the beginning and 98.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 10:31:06,044 INFO L158 Benchmark]: Boogie Preprocessor took 177.46ms. Allocated memory is still 186.6MB. Free memory was 98.5MB in the beginning and 86.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:31:06,044 INFO L158 Benchmark]: RCFGBuilder took 2194.99ms. Allocated memory was 186.6MB in the beginning and 272.6MB in the end (delta: 86.0MB). Free memory was 86.0MB in the beginning and 135.6MB in the end (delta: -49.6MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2024-11-08 10:31:06,045 INFO L158 Benchmark]: TraceAbstraction took 35536.71ms. Allocated memory was 272.6MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 134.5MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 658.8MB. Max. memory is 16.1GB. [2024-11-08 10:31:06,045 INFO L158 Benchmark]: Witness Printer took 253.90ms. Allocated memory is still 5.7GB. Free memory was 5.1GB in the beginning and 5.1GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-08 10:31:06,048 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.19ms. Allocated memory is still 100.7MB. Free memory was 65.7MB in the beginning and 65.7MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 907.23ms. Allocated memory is still 186.6MB. Free memory was 130.1MB in the beginning and 113.2MB in the end (delta: 16.9MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 138.45ms. Allocated memory is still 186.6MB. Free memory was 113.2MB in the beginning and 98.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 177.46ms. Allocated memory is still 186.6MB. Free memory was 98.5MB in the beginning and 86.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2194.99ms. Allocated memory was 186.6MB in the beginning and 272.6MB in the end (delta: 86.0MB). Free memory was 86.0MB in the beginning and 135.6MB in the end (delta: -49.6MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * TraceAbstraction took 35536.71ms. Allocated memory was 272.6MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 134.5MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 658.8MB. Max. memory is 16.1GB. * Witness Printer took 253.90ms. Allocated memory is still 5.7GB. Free memory was 5.1GB in the beginning and 5.1GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. 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: 1579]: 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, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.1s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4229 SdHoareTripleChecker+Valid, 13.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4229 mSDsluCounter, 4083 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 628 mSDsCounter, 2309 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12012 IncrementalHoareTripleChecker+Invalid, 14321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2309 mSolverCounterUnsat, 3455 mSDtfsCounter, 12012 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2335 GetRequests, 2299 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43733occurred in iteration=17, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 8643 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 7043 NumberOfCodeBlocks, 7043 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 7018 ConstructedInterpolants, 0 QuantifiedInterpolants, 12624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4231 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 4620/4662 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: 1668]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((a15 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) || ((((((a5 == 1) && (a12 == 1)) && (a26 <= 0)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1))) || ((((a5 == 1) && (a3 == 1)) && (a11 <= 0)) && (a6 <= 0))) || ((((((a5 == 1) && (2 <= a3)) && (a26 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((a5 == 1) && (2 <= a3)) && (a11 == 1)) && (a6 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a3 == 0)) && (a6 <= 0))) || (((((a5 == 1) && (2 <= a3)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || (((((a15 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 0)) && (a6 <= 0))) || (((((a5 == 1) && (a11 == 1)) && (a3 == 1)) && (a27 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (2 <= a3)) && (a11 == 1)) && (a6 <= 0))) || ((((a5 == 1) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0))) || (((((a5 == 1) && (a12 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a27 == 1)) && (a3 == 0))) || (((((a5 == 1) && (2 <= a3)) && (a26 <= 0)) && (a11 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a11 == 1)) && (a3 == 1)) && (a12 == 0)) && (a6 <= 0))) || ((((a5 == 1) && (a6 == 1)) && (a11 <= 0)) && (a3 == 0))) || (((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a12 == 0)) && (a27 == 1))) || ((((a5 == 1) && (2 <= a3)) && (a6 == 1)) && (a11 <= 0))) || (((((a5 == 1) && (a11 == 1)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a27 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0))) || ((((a5 == 1) && (a11 == 1)) && (a6 == 1)) && (a3 == 0))) || (((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (2 <= a3)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || (((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (2 <= a3)) && (a11 <= 0)) && (a6 <= 0))) || (((((a5 == 1) && (a26 <= 0)) && (a11 <= 0)) && (a3 == 0)) && (a6 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:31:06,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE