./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label48.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 1479ddd90ec2fcde77d063083da596ee818d8098bb47b0581d7cfb4606042d51 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 22:43:51,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:43:51,465 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 22:43:51,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:43:51,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:43:51,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:43:51,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:43:51,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:43:51,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:43:51,507 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:43:51,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:43:51,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:43:51,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:43:51,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:43:51,510 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:43:51,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:43:51,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:43:51,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:43:51,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 22:43:51,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:43:51,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:43:51,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:43:51,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:43:51,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:43:51,515 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:43:51,515 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:43:51,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:43:51,516 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:43:51,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:43:51,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:43:51,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:43:51,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:43:51,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:43:51,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:43:51,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:43:51,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:43:51,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 22:43:51,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 22:43:51,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:43:51,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:43:51,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:43:51,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:43:51,523 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 -> 1479ddd90ec2fcde77d063083da596ee818d8098bb47b0581d7cfb4606042d51 [2024-10-13 22:43:51,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:43:51,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:43:51,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:43:51,818 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:43:51,818 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:43:51,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label48.c [2024-10-13 22:43:53,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:43:53,513 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:43:53,513 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label48.c [2024-10-13 22:43:53,530 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/791df236b/bcdad396429b434d8094029ae1dc9c69/FLAGfe7e62257 [2024-10-13 22:43:53,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/791df236b/bcdad396429b434d8094029ae1dc9c69 [2024-10-13 22:43:53,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:43:53,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:43:53,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:43:53,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:43:53,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:43:53,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:43:53" (1/1) ... [2024-10-13 22:43:53,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c334e23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:53, skipping insertion in model container [2024-10-13 22:43:53,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:43:53" (1/1) ... [2024-10-13 22:43:53,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:43:54,202 WARN L248 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/Problem01_label48.c[20593,20606] [2024-10-13 22:43:54,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:43:54,248 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:43:54,325 WARN L248 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/Problem01_label48.c[20593,20606] [2024-10-13 22:43:54,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:43:54,351 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:43:54,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:54 WrapperNode [2024-10-13 22:43:54,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:43:54,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:43:54,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:43:54,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:43:54,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:54" (1/1) ... [2024-10-13 22:43:54,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:54" (1/1) ... [2024-10-13 22:43:54,437 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-10-13 22:43:54,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:43:54,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:43:54,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:43:54,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:43:54,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:54" (1/1) ... [2024-10-13 22:43:54,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:54" (1/1) ... [2024-10-13 22:43:54,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:54" (1/1) ... [2024-10-13 22:43:54,477 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-10-13 22:43:54,478 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:54" (1/1) ... [2024-10-13 22:43:54,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:54" (1/1) ... [2024-10-13 22:43:54,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:54" (1/1) ... [2024-10-13 22:43:54,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:54" (1/1) ... [2024-10-13 22:43:54,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:54" (1/1) ... [2024-10-13 22:43:54,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:54" (1/1) ... [2024-10-13 22:43:54,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:43:54,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:43:54,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:43:54,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:43:54,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:54" (1/1) ... [2024-10-13 22:43:54,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:43:54,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:43:54,586 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-10-13 22:43:54,596 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-10-13 22:43:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:43:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 22:43:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:43:54,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:43:54,722 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:43:54,726 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:43:55,666 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-10-13 22:43:55,668 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:43:55,719 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:43:55,721 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 22:43:55,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:43:55 BoogieIcfgContainer [2024-10-13 22:43:55,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:43:55,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:43:55,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:43:55,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:43:55,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:43:53" (1/3) ... [2024-10-13 22:43:55,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a37c337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:43:55, skipping insertion in model container [2024-10-13 22:43:55,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:43:54" (2/3) ... [2024-10-13 22:43:55,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a37c337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:43:55, skipping insertion in model container [2024-10-13 22:43:55,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:43:55" (3/3) ... [2024-10-13 22:43:55,731 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label48.c [2024-10-13 22:43:55,748 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:43:55,748 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:43:55,819 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:43:55,825 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;@68a757a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:43:55,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:43:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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-10-13 22:43:55,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 22:43:55,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:43:55,843 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] [2024-10-13 22:43:55,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:43:55,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:43:55,848 INFO L85 PathProgramCache]: Analyzing trace with hash 209872213, now seen corresponding path program 1 times [2024-10-13 22:43:55,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:43:55,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457099359] [2024-10-13 22:43:55,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:55,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:43:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:43:56,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:43:56,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457099359] [2024-10-13 22:43:56,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457099359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:43:56,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:43:56,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:43:56,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867183406] [2024-10-13 22:43:56,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:43:56,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 22:43:56,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:43:56,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 22:43:56,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 22:43:56,291 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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 2 states, 2 states have (on average 60.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:43:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:43:56,329 INFO L93 Difference]: Finished difference Result 271 states and 529 transitions. [2024-10-13 22:43:56,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 22:43:56,332 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 60.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2024-10-13 22:43:56,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:43:56,341 INFO L225 Difference]: With dead ends: 271 [2024-10-13 22:43:56,342 INFO L226 Difference]: Without dead ends: 134 [2024-10-13 22:43:56,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 22:43:56,348 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:43:56,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:43:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-13 22:43:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-13 22:43:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 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-10-13 22:43:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2024-10-13 22:43:56,392 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 120 [2024-10-13 22:43:56,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:43:56,393 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2024-10-13 22:43:56,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 60.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:43:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2024-10-13 22:43:56,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 22:43:56,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:43:56,398 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] [2024-10-13 22:43:56,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 22:43:56,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:43:56,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:43:56,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1461589802, now seen corresponding path program 1 times [2024-10-13 22:43:56,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:43:56,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507444677] [2024-10-13 22:43:56,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:56,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:43:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:43:56,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:43:56,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507444677] [2024-10-13 22:43:56,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507444677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:43:56,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:43:56,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:43:56,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505826168] [2024-10-13 22:43:56,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:43:56,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:43:56,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:43:56,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:43:56,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:43:56,806 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:43:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:43:57,366 INFO L93 Difference]: Finished difference Result 398 states and 597 transitions. [2024-10-13 22:43:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:43:57,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2024-10-13 22:43:57,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:43:57,371 INFO L225 Difference]: With dead ends: 398 [2024-10-13 22:43:57,373 INFO L226 Difference]: Without dead ends: 265 [2024-10-13 22:43:57,374 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-10-13 22:43:57,376 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 35 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 22:43:57,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 29 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 22:43:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-13 22:43:57,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2024-10-13 22:43:57,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.4356060606060606) internal successors, (379), 264 states have internal predecessors, (379), 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-10-13 22:43:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 379 transitions. [2024-10-13 22:43:57,395 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 379 transitions. Word has length 120 [2024-10-13 22:43:57,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:43:57,395 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 379 transitions. [2024-10-13 22:43:57,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:43:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 379 transitions. [2024-10-13 22:43:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 22:43:57,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:43:57,398 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:43:57,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 22:43:57,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:43:57,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:43:57,400 INFO L85 PathProgramCache]: Analyzing trace with hash -733046109, now seen corresponding path program 1 times [2024-10-13 22:43:57,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:43:57,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466693533] [2024-10-13 22:43:57,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:57,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:43:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:57,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:43:57,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:43:57,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466693533] [2024-10-13 22:43:57,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466693533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:43:57,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:43:57,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:43:57,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285702337] [2024-10-13 22:43:57,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:43:57,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:43:57,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:43:57,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:43:57,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:43:57,583 INFO L87 Difference]: Start difference. First operand 265 states and 379 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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-10-13 22:43:58,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:43:58,042 INFO L93 Difference]: Finished difference Result 791 states and 1134 transitions. [2024-10-13 22:43:58,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:43:58,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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 126 [2024-10-13 22:43:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:43:58,046 INFO L225 Difference]: With dead ends: 791 [2024-10-13 22:43:58,046 INFO L226 Difference]: Without dead ends: 527 [2024-10-13 22:43:58,051 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-10-13 22:43:58,052 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:43:58,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 34 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:43:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-13 22:43:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2024-10-13 22:43:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.3460076045627376) internal successors, (708), 526 states have internal predecessors, (708), 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-10-13 22:43:58,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 708 transitions. [2024-10-13 22:43:58,095 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 708 transitions. Word has length 126 [2024-10-13 22:43:58,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:43:58,096 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 708 transitions. [2024-10-13 22:43:58,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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-10-13 22:43:58,096 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 708 transitions. [2024-10-13 22:43:58,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 22:43:58,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:43:58,100 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:43:58,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 22:43:58,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:43:58,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:43:58,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2087136099, now seen corresponding path program 1 times [2024-10-13 22:43:58,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:43:58,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408479453] [2024-10-13 22:43:58,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:58,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:43:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:43:58,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:43:58,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408479453] [2024-10-13 22:43:58,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408479453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:43:58,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:43:58,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:43:58,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324114506] [2024-10-13 22:43:58,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:43:58,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:43:58,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:43:58,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:43:58,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:43:58,537 INFO L87 Difference]: Start difference. First operand 527 states and 708 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 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-10-13 22:43:59,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:43:59,136 INFO L93 Difference]: Finished difference Result 1410 states and 1881 transitions. [2024-10-13 22:43:59,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:43:59,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 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 127 [2024-10-13 22:43:59,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:43:59,140 INFO L225 Difference]: With dead ends: 1410 [2024-10-13 22:43:59,140 INFO L226 Difference]: Without dead ends: 789 [2024-10-13 22:43:59,141 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-10-13 22:43:59,143 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 130 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 22:43:59,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 77 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 22:43:59,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-10-13 22:43:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2024-10-13 22:43:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.1637055837563453) internal successors, (917), 788 states have internal predecessors, (917), 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-10-13 22:43:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 917 transitions. [2024-10-13 22:43:59,180 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 917 transitions. Word has length 127 [2024-10-13 22:43:59,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:43:59,180 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 917 transitions. [2024-10-13 22:43:59,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 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-10-13 22:43:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 917 transitions. [2024-10-13 22:43:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 22:43:59,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:43:59,188 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 22:43:59,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 22:43:59,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:43:59,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:43:59,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1192421264, now seen corresponding path program 1 times [2024-10-13 22:43:59,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:43:59,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125257088] [2024-10-13 22:43:59,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:59,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:43:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 22:43:59,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:43:59,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125257088] [2024-10-13 22:43:59,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125257088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:43:59,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:43:59,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:43:59,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819103550] [2024-10-13 22:43:59,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:43:59,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:43:59,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:43:59,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:43:59,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:43:59,349 INFO L87 Difference]: Start difference. First operand 789 states and 917 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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-10-13 22:43:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:43:59,710 INFO L93 Difference]: Finished difference Result 1577 states and 1858 transitions. [2024-10-13 22:43:59,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:43:59,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 132 [2024-10-13 22:43:59,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:43:59,714 INFO L225 Difference]: With dead ends: 1577 [2024-10-13 22:43:59,714 INFO L226 Difference]: Without dead ends: 920 [2024-10-13 22:43:59,715 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-10-13 22:43:59,716 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:43:59,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 43 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:43:59,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-13 22:43:59,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2024-10-13 22:43:59,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 919 states have (on average 1.1534276387377584) internal successors, (1060), 919 states have internal predecessors, (1060), 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-10-13 22:43:59,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1060 transitions. [2024-10-13 22:43:59,739 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1060 transitions. Word has length 132 [2024-10-13 22:43:59,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:43:59,739 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1060 transitions. [2024-10-13 22:43:59,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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-10-13 22:43:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1060 transitions. [2024-10-13 22:43:59,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 22:43:59,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:43:59,742 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2024-10-13 22:43:59,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 22:43:59,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:43:59,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:43:59,743 INFO L85 PathProgramCache]: Analyzing trace with hash 982627858, now seen corresponding path program 1 times [2024-10-13 22:43:59,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:43:59,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609328819] [2024-10-13 22:43:59,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:43:59,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:43:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:43:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-13 22:43:59,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:43:59,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609328819] [2024-10-13 22:43:59,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609328819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:43:59,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:43:59,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:43:59,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573777353] [2024-10-13 22:43:59,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:43:59,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:43:59,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:43:59,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:43:59,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 22:43:59,896 INFO L87 Difference]: Start difference. First operand 920 states and 1060 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-10-13 22:44:00,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:44:00,270 INFO L93 Difference]: Finished difference Result 2363 states and 2731 transitions. [2024-10-13 22:44:00,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:44:00,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 141 [2024-10-13 22:44:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:44:00,280 INFO L225 Difference]: With dead ends: 2363 [2024-10-13 22:44:00,281 INFO L226 Difference]: Without dead ends: 1575 [2024-10-13 22:44:00,283 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-10-13 22:44:00,284 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:44:00,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 17 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:44:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-10-13 22:44:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1182. [2024-10-13 22:44:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.1507197290431836) internal successors, (1359), 1181 states have internal predecessors, (1359), 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-10-13 22:44:00,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1359 transitions. [2024-10-13 22:44:00,316 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1359 transitions. Word has length 141 [2024-10-13 22:44:00,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:44:00,317 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1359 transitions. [2024-10-13 22:44:00,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-10-13 22:44:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1359 transitions. [2024-10-13 22:44:00,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 22:44:00,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:44:00,320 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2024-10-13 22:44:00,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 22:44:00,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:44:00,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:44:00,321 INFO L85 PathProgramCache]: Analyzing trace with hash 778173953, now seen corresponding path program 1 times [2024-10-13 22:44:00,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:44:00,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015199828] [2024-10-13 22:44:00,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:44:00,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:44:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:44:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 22:44:00,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:44:00,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015199828] [2024-10-13 22:44:00,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015199828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:44:00,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:44:00,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:44:00,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423538626] [2024-10-13 22:44:00,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:44:00,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:44:00,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:44:00,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:44:00,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:44:00,503 INFO L87 Difference]: Start difference. First operand 1182 states and 1359 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 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-10-13 22:44:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:44:01,071 INFO L93 Difference]: Finished difference Result 2494 states and 2924 transitions. [2024-10-13 22:44:01,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:44:01,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 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 147 [2024-10-13 22:44:01,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:44:01,076 INFO L225 Difference]: With dead ends: 2494 [2024-10-13 22:44:01,076 INFO L226 Difference]: Without dead ends: 1444 [2024-10-13 22:44:01,078 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-10-13 22:44:01,079 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 261 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 22:44:01,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 32 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 22:44:01,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2024-10-13 22:44:01,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1444. [2024-10-13 22:44:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.1448371448371448) internal successors, (1652), 1443 states have internal predecessors, (1652), 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-10-13 22:44:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1652 transitions. [2024-10-13 22:44:01,109 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1652 transitions. Word has length 147 [2024-10-13 22:44:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:44:01,110 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1652 transitions. [2024-10-13 22:44:01,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 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-10-13 22:44:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1652 transitions. [2024-10-13 22:44:01,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 22:44:01,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:44:01,114 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 22:44:01,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 22:44:01,114 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:44:01,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:44:01,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1870632068, now seen corresponding path program 1 times [2024-10-13 22:44:01,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:44:01,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388760617] [2024-10-13 22:44:01,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:44:01,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:44:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:44:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 22:44:01,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:44:01,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388760617] [2024-10-13 22:44:01,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388760617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:44:01,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:44:01,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 22:44:01,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233478117] [2024-10-13 22:44:01,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:44:01,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:44:01,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:44:01,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:44:01,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:44:01,314 INFO L87 Difference]: Start difference. First operand 1444 states and 1652 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:44:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:44:01,898 INFO L93 Difference]: Finished difference Result 3542 states and 4042 transitions. [2024-10-13 22:44:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:44:01,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2024-10-13 22:44:01,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:44:01,907 INFO L225 Difference]: With dead ends: 3542 [2024-10-13 22:44:01,907 INFO L226 Difference]: Without dead ends: 2099 [2024-10-13 22:44:01,910 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-10-13 22:44:01,910 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 252 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 22:44:01,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 37 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 22:44:01,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2024-10-13 22:44:01,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1837. [2024-10-13 22:44:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1836 states have (on average 1.1198257080610021) internal successors, (2056), 1836 states have internal predecessors, (2056), 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-10-13 22:44:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2056 transitions. [2024-10-13 22:44:01,948 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2056 transitions. Word has length 161 [2024-10-13 22:44:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:44:01,948 INFO L471 AbstractCegarLoop]: Abstraction has 1837 states and 2056 transitions. [2024-10-13 22:44:01,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:44:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2056 transitions. [2024-10-13 22:44:01,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-13 22:44:01,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:44:01,953 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 22:44:01,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 22:44:01,953 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:44:01,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:44:01,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2142549012, now seen corresponding path program 1 times [2024-10-13 22:44:01,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:44:01,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37083090] [2024-10-13 22:44:01,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:44:01,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:44:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:44:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-13 22:44:02,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:44:02,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37083090] [2024-10-13 22:44:02,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37083090] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:44:02,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409614961] [2024-10-13 22:44:02,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:44:02,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:44:02,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:44:02,256 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-10-13 22:44:02,258 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-10-13 22:44:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:44:02,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:44:02,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:44:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-13 22:44:02,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:44:02,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409614961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:44:02,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:44:02,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-13 22:44:02,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427085641] [2024-10-13 22:44:02,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:44:02,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:44:02,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:44:02,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:44:02,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 22:44:02,620 INFO L87 Difference]: Start difference. First operand 1837 states and 2056 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-10-13 22:44:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:44:03,010 INFO L93 Difference]: Finished difference Result 3804 states and 4253 transitions. [2024-10-13 22:44:03,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:44:03,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 181 [2024-10-13 22:44:03,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:44:03,016 INFO L225 Difference]: With dead ends: 3804 [2024-10-13 22:44:03,017 INFO L226 Difference]: Without dead ends: 1706 [2024-10-13 22:44:03,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 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-10-13 22:44:03,020 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 20 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 22:44:03,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 169 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 22:44:03,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-10-13 22:44:03,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1575. [2024-10-13 22:44:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1574 states have (on average 1.0984752223634053) internal successors, (1729), 1574 states have internal predecessors, (1729), 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-10-13 22:44:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1729 transitions. [2024-10-13 22:44:03,050 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 1729 transitions. Word has length 181 [2024-10-13 22:44:03,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:44:03,050 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 1729 transitions. [2024-10-13 22:44:03,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-10-13 22:44:03,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1729 transitions. [2024-10-13 22:44:03,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-13 22:44:03,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:44:03,055 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:44:03,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 22:44:03,258 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-10-13 22:44:03,259 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:44:03,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:44:03,260 INFO L85 PathProgramCache]: Analyzing trace with hash 4177432, now seen corresponding path program 1 times [2024-10-13 22:44:03,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:44:03,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393341866] [2024-10-13 22:44:03,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:44:03,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:44:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:44:03,607 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:44:03,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:44:03,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393341866] [2024-10-13 22:44:03,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393341866] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:44:03,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455441513] [2024-10-13 22:44:03,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:44:03,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:44:03,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:44:03,620 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-10-13 22:44:03,622 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-10-13 22:44:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:44:03,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 22:44:03,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:44:03,918 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-13 22:44:03,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 22:44:03,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455441513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:44:03,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 22:44:03,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 22:44:03,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775923357] [2024-10-13 22:44:03,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:44:03,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 22:44:03,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:44:03,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 22:44:03,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:44:03,921 INFO L87 Difference]: Start difference. First operand 1575 states and 1729 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-10-13 22:44:04,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:44:04,281 INFO L93 Difference]: Finished difference Result 3147 states and 3473 transitions. [2024-10-13 22:44:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 22:44:04,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 200 [2024-10-13 22:44:04,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:44:04,283 INFO L225 Difference]: With dead ends: 3147 [2024-10-13 22:44:04,283 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 22:44:04,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 22:44:04,287 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:44:04,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 167 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 22:44:04,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 22:44:04,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 22:44:04,288 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-10-13 22:44:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 22:44:04,288 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 200 [2024-10-13 22:44:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:44:04,288 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 22:44:04,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-10-13 22:44:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 22:44:04,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 22:44:04,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 22:44:04,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 22:44:04,494 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,SelfDestructingSolverStorable9 [2024-10-13 22:44:04,498 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:44:04,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 22:44:04,658 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 22:44:04,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:44:04 BoogieIcfgContainer [2024-10-13 22:44:04,683 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 22:44:04,684 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 22:44:04,684 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 22:44:04,684 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 22:44:04,684 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:43:55" (3/4) ... [2024-10-13 22:44:04,686 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 22:44:04,706 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 22:44:04,707 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 22:44:04,707 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 22:44:04,708 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 22:44:04,864 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 22:44:04,865 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 22:44:04,865 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 22:44:04,866 INFO L158 Benchmark]: Toolchain (without parser) took 11051.54ms. Allocated memory was 169.9MB in the beginning and 268.4MB in the end (delta: 98.6MB). Free memory was 99.4MB in the beginning and 136.3MB in the end (delta: -36.9MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. [2024-10-13 22:44:04,866 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 22:44:04,866 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.23ms. Allocated memory is still 169.9MB. Free memory was 99.2MB in the beginning and 123.7MB in the end (delta: -24.6MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-10-13 22:44:04,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.94ms. Allocated memory is still 169.9MB. Free memory was 123.7MB in the beginning and 117.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 22:44:04,867 INFO L158 Benchmark]: Boogie Preprocessor took 107.35ms. Allocated memory is still 169.9MB. Free memory was 117.4MB in the beginning and 112.0MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 22:44:04,867 INFO L158 Benchmark]: RCFGBuilder took 1174.94ms. Allocated memory is still 169.9MB. Free memory was 112.0MB in the beginning and 102.9MB in the end (delta: 9.1MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2024-10-13 22:44:04,867 INFO L158 Benchmark]: TraceAbstraction took 8959.62ms. Allocated memory was 169.9MB in the beginning and 268.4MB in the end (delta: 98.6MB). Free memory was 102.9MB in the beginning and 148.9MB in the end (delta: -46.0MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2024-10-13 22:44:04,868 INFO L158 Benchmark]: Witness Printer took 181.15ms. Allocated memory is still 268.4MB. Free memory was 148.9MB in the beginning and 136.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 22:44:04,869 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 535.23ms. Allocated memory is still 169.9MB. Free memory was 99.2MB in the beginning and 123.7MB in the end (delta: -24.6MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.94ms. Allocated memory is still 169.9MB. Free memory was 123.7MB in the beginning and 117.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.35ms. Allocated memory is still 169.9MB. Free memory was 117.4MB in the beginning and 112.0MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1174.94ms. Allocated memory is still 169.9MB. Free memory was 112.0MB in the beginning and 102.9MB in the end (delta: 9.1MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8959.62ms. Allocated memory was 169.9MB in the beginning and 268.4MB in the end (delta: 98.6MB). Free memory was 102.9MB in the beginning and 148.9MB in the end (delta: -46.0MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. * Witness Printer took 181.15ms. Allocated memory is still 268.4MB. Free memory was 148.9MB in the beginning and 136.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 549]: 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, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1119 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1119 mSDsluCounter, 805 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 536 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3478 IncrementalHoareTripleChecker+Invalid, 4014 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 536 mSolverCounterUnsat, 753 mSDtfsCounter, 3478 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 406 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1837occurred in iteration=8, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 786 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1836 NumberOfCodeBlocks, 1836 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1824 ConstructedInterpolants, 0 QuantifiedInterpolants, 5606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 687 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 525/537 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: 593]: Loop Invariant Derived loop invariant: (((((((((a21 == 1) && (a17 == 1)) && (15 <= a8)) || ((a8 <= 13) && (a16 <= 5))) || ((a8 <= 13) && (a20 == 1))) || (((a17 <= 0) && (a21 == 1)) && (15 <= a8))) || (((a17 <= 0) && (a21 == 1)) && (a16 <= 5))) || (((a17 <= 0) && (a21 == 1)) && (a20 == 1))) || (((((a12 == 8) && (a21 == 1)) && (a17 == 1)) && (a16 <= 4)) && (a20 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-13 22:44:04,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE