./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label27.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label27.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 70ecb2446f57553abe7468e1f232296cdba8856c774fb79cc62538ced35b338d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:09:16,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:09:16,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:09:16,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:09:16,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:09:16,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:09:16,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:09:16,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:09:16,540 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:09:16,541 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:09:16,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:09:16,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:09:16,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:09:16,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:09:16,546 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:09:16,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:09:16,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:09:16,547 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:09:16,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:09:16,547 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:09:16,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:09:16,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:09:16,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:09:16,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:09:16,550 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:09:16,550 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:09:16,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:09:16,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:09:16,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:09:16,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:09:16,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:09:16,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:09:16,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:09:16,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:09:16,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:09:16,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:09:16,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:09:16,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:09:16,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:09:16,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:09:16,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:09:16,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:09:16,554 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 -> 70ecb2446f57553abe7468e1f232296cdba8856c774fb79cc62538ced35b338d [2024-11-08 11:09:16,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:09:16,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:09:16,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:09:16,853 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:09:16,853 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:09:16,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label27.c [2024-11-08 11:09:18,249 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:09:18,537 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:09:18,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label27.c [2024-11-08 11:09:18,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e8f55fab/7b1d85b67631495385690de80590c2df/FLAGc113c081a [2024-11-08 11:09:18,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e8f55fab/7b1d85b67631495385690de80590c2df [2024-11-08 11:09:18,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:09:18,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:09:18,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:09:18,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:09:18,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:09:18,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:09:18" (1/1) ... [2024-11-08 11:09:18,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e40787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:18, skipping insertion in model container [2024-11-08 11:09:18,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:09:18" (1/1) ... [2024-11-08 11:09:18,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:09:19,124 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label27.c[6867,6880] [2024-11-08 11:09:19,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:09:19,251 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:09:19,290 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label27.c[6867,6880] [2024-11-08 11:09:19,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:09:19,352 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:09:19,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:19 WrapperNode [2024-11-08 11:09:19,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:09:19,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:09:19,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:09:19,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:09:19,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:19" (1/1) ... [2024-11-08 11:09:19,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:19" (1/1) ... [2024-11-08 11:09:19,452 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-08 11:09:19,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:09:19,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:09:19,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:09:19,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:09:19,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:19" (1/1) ... [2024-11-08 11:09:19,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:19" (1/1) ... [2024-11-08 11:09:19,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:19" (1/1) ... [2024-11-08 11:09:19,518 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:09:19,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:19" (1/1) ... [2024-11-08 11:09:19,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:19" (1/1) ... [2024-11-08 11:09:19,541 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:19" (1/1) ... [2024-11-08 11:09:19,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:19" (1/1) ... [2024-11-08 11:09:19,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:19" (1/1) ... [2024-11-08 11:09:19,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:19" (1/1) ... [2024-11-08 11:09:19,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:09:19,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:09:19,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:09:19,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:09:19,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:19" (1/1) ... [2024-11-08 11:09:19,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:09:19,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:09:19,606 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:09:19,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:09:19,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:09:19,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:09:19,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:09:19,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:09:19,731 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:09:19,733 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:09:20,809 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-08 11:09:20,810 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:09:20,831 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:09:20,833 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:09:20,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:20 BoogieIcfgContainer [2024-11-08 11:09:20,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:09:20,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:09:20,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:09:20,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:09:20,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:09:18" (1/3) ... [2024-11-08 11:09:20,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ff2238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:09:20, skipping insertion in model container [2024-11-08 11:09:20,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:09:19" (2/3) ... [2024-11-08 11:09:20,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ff2238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:09:20, skipping insertion in model container [2024-11-08 11:09:20,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:20" (3/3) ... [2024-11-08 11:09:20,845 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label27.c [2024-11-08 11:09:20,861 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:09:20,861 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:09:20,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:09:20,937 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;@46f09e1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:09:20,938 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:09:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 11:09:20,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:20,953 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] [2024-11-08 11:09:20,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:20,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:20,957 INFO L85 PathProgramCache]: Analyzing trace with hash -634083006, now seen corresponding path program 1 times [2024-11-08 11:09:20,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:20,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131972514] [2024-11-08 11:09:20,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:20,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:21,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:21,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:21,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131972514] [2024-11-08 11:09:21,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131972514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:21,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:21,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:21,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974999323] [2024-11-08 11:09:21,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:21,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:09:21,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:21,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:09:21,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:09:21,546 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:22,740 INFO L93 Difference]: Finished difference Result 696 states and 1248 transitions. [2024-11-08 11:09:22,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:09:22,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2024-11-08 11:09:22,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:22,753 INFO L225 Difference]: With dead ends: 696 [2024-11-08 11:09:22,753 INFO L226 Difference]: Without dead ends: 421 [2024-11-08 11:09:22,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:09:22,760 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 432 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:22,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 44 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:09:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-08 11:09:22,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-08 11:09:22,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.3833333333333333) internal successors, (581), 420 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 581 transitions. [2024-11-08 11:09:22,815 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 581 transitions. Word has length 60 [2024-11-08 11:09:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:22,816 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 581 transitions. [2024-11-08 11:09:22,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 581 transitions. [2024-11-08 11:09:22,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 11:09:22,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:22,822 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:09:22,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:09:22,822 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:22,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:22,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1646029236, now seen corresponding path program 1 times [2024-11-08 11:09:22,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:22,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820264126] [2024-11-08 11:09:22,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:22,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:23,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:23,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820264126] [2024-11-08 11:09:23,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820264126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:23,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:23,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:23,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005005601] [2024-11-08 11:09:23,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:23,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:09:23,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:23,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:09:23,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:09:23,432 INFO L87 Difference]: Start difference. First operand 421 states and 581 transitions. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:23,892 INFO L93 Difference]: Finished difference Result 701 states and 1011 transitions. [2024-11-08 11:09:23,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:09:23,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2024-11-08 11:09:23,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:23,898 INFO L225 Difference]: With dead ends: 701 [2024-11-08 11:09:23,898 INFO L226 Difference]: Without dead ends: 421 [2024-11-08 11:09:23,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:09:23,900 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 87 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:23,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 87 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:09:23,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-08 11:09:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-08 11:09:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.3714285714285714) internal successors, (576), 420 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 576 transitions. [2024-11-08 11:09:23,935 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 576 transitions. Word has length 178 [2024-11-08 11:09:23,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:23,936 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 576 transitions. [2024-11-08 11:09:23,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:23,936 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 576 transitions. [2024-11-08 11:09:23,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 11:09:23,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:23,943 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:23,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:09:23,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:23,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:23,944 INFO L85 PathProgramCache]: Analyzing trace with hash -863568004, now seen corresponding path program 1 times [2024-11-08 11:09:23,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:23,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291269338] [2024-11-08 11:09:23,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:23,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:24,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:24,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291269338] [2024-11-08 11:09:24,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291269338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:24,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:24,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:24,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254284054] [2024-11-08 11:09:24,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:24,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:24,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:24,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:24,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:24,388 INFO L87 Difference]: Start difference. First operand 421 states and 576 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:24,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:24,856 INFO L93 Difference]: Finished difference Result 840 states and 1220 transitions. [2024-11-08 11:09:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:24,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 204 [2024-11-08 11:09:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:24,860 INFO L225 Difference]: With dead ends: 840 [2024-11-08 11:09:24,860 INFO L226 Difference]: Without dead ends: 560 [2024-11-08 11:09:24,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:24,864 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:24,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 19 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:09:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-08 11:09:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-08 11:09:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3774597495527727) internal successors, (770), 559 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:24,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 770 transitions. [2024-11-08 11:09:24,892 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 770 transitions. Word has length 204 [2024-11-08 11:09:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:24,894 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 770 transitions. [2024-11-08 11:09:24,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 770 transitions. [2024-11-08 11:09:24,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-08 11:09:24,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:24,900 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:09:24,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:09:24,900 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:24,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:24,901 INFO L85 PathProgramCache]: Analyzing trace with hash 106569812, now seen corresponding path program 1 times [2024-11-08 11:09:24,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:24,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478814404] [2024-11-08 11:09:24,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:24,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:25,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:25,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478814404] [2024-11-08 11:09:25,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478814404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:25,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:25,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:25,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055372519] [2024-11-08 11:09:25,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:25,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:25,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:25,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:25,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:25,105 INFO L87 Difference]: Start difference. First operand 560 states and 770 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:25,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:25,571 INFO L93 Difference]: Finished difference Result 1257 states and 1803 transitions. [2024-11-08 11:09:25,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:25,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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 220 [2024-11-08 11:09:25,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:25,576 INFO L225 Difference]: With dead ends: 1257 [2024-11-08 11:09:25,576 INFO L226 Difference]: Without dead ends: 838 [2024-11-08 11:09:25,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:25,580 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 52 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:25,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 213 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:09:25,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-08 11:09:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-08 11:09:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2771804062126644) internal successors, (1069), 837 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1069 transitions. [2024-11-08 11:09:25,602 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1069 transitions. Word has length 220 [2024-11-08 11:09:25,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:25,603 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1069 transitions. [2024-11-08 11:09:25,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:25,603 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1069 transitions. [2024-11-08 11:09:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-08 11:09:25,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:25,606 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:25,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:09:25,607 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:25,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:25,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1466376222, now seen corresponding path program 1 times [2024-11-08 11:09:25,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:25,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531775974] [2024-11-08 11:09:25,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:25,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 11:09:26,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:26,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531775974] [2024-11-08 11:09:26,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531775974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:26,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:26,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 11:09:26,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827286265] [2024-11-08 11:09:26,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:26,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 11:09:26,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:26,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 11:09:26,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:09:26,080 INFO L87 Difference]: Start difference. First operand 838 states and 1069 transitions. Second operand has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:26,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:26,729 INFO L93 Difference]: Finished difference Result 1590 states and 2047 transitions. [2024-11-08 11:09:26,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 11:09:26,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2024-11-08 11:09:26,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:26,734 INFO L225 Difference]: With dead ends: 1590 [2024-11-08 11:09:26,734 INFO L226 Difference]: Without dead ends: 838 [2024-11-08 11:09:26,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:09:26,736 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:26,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 30 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:09:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-08 11:09:26,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-08 11:09:26,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2724014336917562) internal successors, (1065), 837 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1065 transitions. [2024-11-08 11:09:26,758 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1065 transitions. Word has length 229 [2024-11-08 11:09:26,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:26,758 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1065 transitions. [2024-11-08 11:09:26,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1065 transitions. [2024-11-08 11:09:26,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-08 11:09:26,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:26,764 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:26,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:09:26,764 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:26,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:26,766 INFO L85 PathProgramCache]: Analyzing trace with hash 584621320, now seen corresponding path program 1 times [2024-11-08 11:09:26,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:26,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914409351] [2024-11-08 11:09:26,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:26,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:26,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:26,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914409351] [2024-11-08 11:09:26,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914409351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:26,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:26,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:26,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636611289] [2024-11-08 11:09:26,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:27,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:27,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:27,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:27,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:27,001 INFO L87 Difference]: Start difference. First operand 838 states and 1065 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 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-11-08 11:09:27,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:27,465 INFO L93 Difference]: Finished difference Result 1674 states and 2188 transitions. [2024-11-08 11:09:27,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:27,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 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) Word has length 265 [2024-11-08 11:09:27,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:27,469 INFO L225 Difference]: With dead ends: 1674 [2024-11-08 11:09:27,469 INFO L226 Difference]: Without dead ends: 977 [2024-11-08 11:09:27,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:27,471 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 59 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:27,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 190 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:09:27,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-08 11:09:27,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 838. [2024-11-08 11:09:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2365591397849462) internal successors, (1035), 837 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1035 transitions. [2024-11-08 11:09:27,486 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1035 transitions. Word has length 265 [2024-11-08 11:09:27,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:27,487 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1035 transitions. [2024-11-08 11:09:27,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 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-11-08 11:09:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1035 transitions. [2024-11-08 11:09:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2024-11-08 11:09:27,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:27,491 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:27,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:09:27,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:27,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:27,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1581046708, now seen corresponding path program 1 times [2024-11-08 11:09:27,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:27,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104108022] [2024-11-08 11:09:27,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:27,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-08 11:09:27,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:27,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104108022] [2024-11-08 11:09:27,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104108022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:27,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:27,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:09:27,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489256433] [2024-11-08 11:09:27,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:27,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:27,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:27,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:27,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:27,692 INFO L87 Difference]: Start difference. First operand 838 states and 1035 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:28,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:28,155 INFO L93 Difference]: Finished difference Result 1674 states and 2128 transitions. [2024-11-08 11:09:28,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:28,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 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 284 [2024-11-08 11:09:28,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:28,160 INFO L225 Difference]: With dead ends: 1674 [2024-11-08 11:09:28,160 INFO L226 Difference]: Without dead ends: 977 [2024-11-08 11:09:28,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:28,161 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:28,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 77 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:09:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-08 11:09:28,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-08 11:09:28,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.2223360655737705) internal successors, (1193), 976 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1193 transitions. [2024-11-08 11:09:28,178 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1193 transitions. Word has length 284 [2024-11-08 11:09:28,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:28,178 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1193 transitions. [2024-11-08 11:09:28,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1193 transitions. [2024-11-08 11:09:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-08 11:09:28,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:28,182 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:28,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:09:28,182 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:28,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:28,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1141381425, now seen corresponding path program 1 times [2024-11-08 11:09:28,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:28,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415424780] [2024-11-08 11:09:28,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:28,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 130 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:09:28,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:28,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415424780] [2024-11-08 11:09:28,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415424780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:09:28,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772765488] [2024-11-08 11:09:28,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:28,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:09:28,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:09:28,638 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:09:28,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:09:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:28,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:09:28,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:09:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-08 11:09:29,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:09:29,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772765488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:29,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:09:29,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-08 11:09:29,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701700429] [2024-11-08 11:09:29,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:29,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:29,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:29,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:29,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:09:29,178 INFO L87 Difference]: Start difference. First operand 977 states and 1193 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:29,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:29,643 INFO L93 Difference]: Finished difference Result 2091 states and 2573 transitions. [2024-11-08 11:09:29,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:29,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 287 [2024-11-08 11:09:29,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:29,649 INFO L225 Difference]: With dead ends: 2091 [2024-11-08 11:09:29,649 INFO L226 Difference]: Without dead ends: 1255 [2024-11-08 11:09:29,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:09:29,651 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 60 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:29,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 34 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:09:29,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-08 11:09:29,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-08 11:09:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1523125996810208) internal successors, (1445), 1254 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:29,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1445 transitions. [2024-11-08 11:09:29,674 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1445 transitions. Word has length 287 [2024-11-08 11:09:29,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:29,675 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1445 transitions. [2024-11-08 11:09:29,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:29,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1445 transitions. [2024-11-08 11:09:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-11-08 11:09:29,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:29,680 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:29,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 11:09:29,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:09:29,885 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:29,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:29,886 INFO L85 PathProgramCache]: Analyzing trace with hash 57024807, now seen corresponding path program 1 times [2024-11-08 11:09:29,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:29,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219261554] [2024-11-08 11:09:29,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:29,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:30,180 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-08 11:09:30,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:30,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219261554] [2024-11-08 11:09:30,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219261554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:30,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:30,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:30,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007598555] [2024-11-08 11:09:30,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:30,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:30,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:30,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:30,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:30,184 INFO L87 Difference]: Start difference. First operand 1255 states and 1445 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:30,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:30,647 INFO L93 Difference]: Finished difference Result 3342 states and 3886 transitions. [2024-11-08 11:09:30,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:30,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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 338 [2024-11-08 11:09:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:30,654 INFO L225 Difference]: With dead ends: 3342 [2024-11-08 11:09:30,655 INFO L226 Difference]: Without dead ends: 2228 [2024-11-08 11:09:30,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:30,657 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 86 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:30,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 195 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:09:30,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2024-11-08 11:09:30,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1811. [2024-11-08 11:09:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.1679558011049724) internal successors, (2114), 1810 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2114 transitions. [2024-11-08 11:09:30,698 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2114 transitions. Word has length 338 [2024-11-08 11:09:30,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:30,698 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2114 transitions. [2024-11-08 11:09:30,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:30,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2114 transitions. [2024-11-08 11:09:30,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2024-11-08 11:09:30,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:30,705 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:09:30,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:09:30,706 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:30,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:30,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1557017880, now seen corresponding path program 1 times [2024-11-08 11:09:30,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:30,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495476041] [2024-11-08 11:09:30,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:30,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-08 11:09:30,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:30,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495476041] [2024-11-08 11:09:30,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495476041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:30,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:30,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:30,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388755996] [2024-11-08 11:09:30,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:30,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:30,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:30,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:30,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:30,911 INFO L87 Difference]: Start difference. First operand 1811 states and 2114 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:31,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:31,370 INFO L93 Difference]: Finished difference Result 4315 states and 5054 transitions. [2024-11-08 11:09:31,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:31,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 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 355 [2024-11-08 11:09:31,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:31,381 INFO L225 Difference]: With dead ends: 4315 [2024-11-08 11:09:31,381 INFO L226 Difference]: Without dead ends: 2645 [2024-11-08 11:09:31,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:31,384 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 27 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:31,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 205 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:09:31,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2024-11-08 11:09:31,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 2645. [2024-11-08 11:09:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2644 states have (on average 1.1471255673222391) internal successors, (3033), 2644 states have internal predecessors, (3033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3033 transitions. [2024-11-08 11:09:31,434 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3033 transitions. Word has length 355 [2024-11-08 11:09:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:31,435 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 3033 transitions. [2024-11-08 11:09:31,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3033 transitions. [2024-11-08 11:09:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2024-11-08 11:09:31,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:09:31,443 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:09:31,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:09:31,444 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:09:31,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:09:31,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1442960892, now seen corresponding path program 1 times [2024-11-08 11:09:31,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:09:31,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224751941] [2024-11-08 11:09:31,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:09:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:09:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:09:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-08 11:09:32,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:09:32,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224751941] [2024-11-08 11:09:32,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224751941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:09:32,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:09:32,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:09:32,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611024399] [2024-11-08 11:09:32,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:09:32,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:09:32,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:09:32,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:09:32,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:32,064 INFO L87 Difference]: Start difference. First operand 2645 states and 3033 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:09:32,542 INFO L93 Difference]: Finished difference Result 3618 states and 4182 transitions. [2024-11-08 11:09:32,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:09:32,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 368 [2024-11-08 11:09:32,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:09:32,545 INFO L225 Difference]: With dead ends: 3618 [2024-11-08 11:09:32,545 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:09:32,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:09:32,549 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 88 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:09:32,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 49 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:09:32,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:09:32,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:09:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:09:32,551 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 368 [2024-11-08 11:09:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:09:32,551 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:09:32,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:09:32,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:09:32,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:09:32,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:09:32,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:09:32,558 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:09:32,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:09:32,775 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:09:32,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:09:32 BoogieIcfgContainer [2024-11-08 11:09:32,807 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:09:32,808 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:09:32,808 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:09:32,808 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:09:32,808 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:09:20" (3/4) ... [2024-11-08 11:09:32,815 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:09:32,841 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:09:32,845 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:09:32,845 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:09:32,846 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:09:32,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:09:32,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:09:32,980 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:09:32,981 INFO L158 Benchmark]: Toolchain (without parser) took 14144.90ms. Allocated memory was 148.9MB in the beginning and 358.6MB in the end (delta: 209.7MB). Free memory was 121.5MB in the beginning and 131.0MB in the end (delta: -9.5MB). Peak memory consumption was 200.1MB. Max. memory is 16.1GB. [2024-11-08 11:09:32,981 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 119.5MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:09:32,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.97ms. Allocated memory is still 148.9MB. Free memory was 121.5MB in the beginning and 91.2MB in the end (delta: 30.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 11:09:32,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.90ms. Allocated memory is still 148.9MB. Free memory was 91.2MB in the beginning and 83.7MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 11:09:32,983 INFO L158 Benchmark]: Boogie Preprocessor took 117.21ms. Allocated memory is still 148.9MB. Free memory was 83.7MB in the beginning and 73.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 11:09:32,984 INFO L158 Benchmark]: RCFGBuilder took 1262.28ms. Allocated memory is still 148.9MB. Free memory was 73.3MB in the beginning and 110.2MB in the end (delta: -36.9MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2024-11-08 11:09:32,984 INFO L158 Benchmark]: TraceAbstraction took 11970.21ms. Allocated memory was 148.9MB in the beginning and 358.6MB in the end (delta: 209.7MB). Free memory was 109.1MB in the beginning and 142.5MB in the end (delta: -33.4MB). Peak memory consumption was 175.3MB. Max. memory is 16.1GB. [2024-11-08 11:09:32,985 INFO L158 Benchmark]: Witness Printer took 172.66ms. Allocated memory is still 358.6MB. Free memory was 142.5MB in the beginning and 131.0MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 11:09:32,986 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 119.5MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 515.97ms. Allocated memory is still 148.9MB. Free memory was 121.5MB in the beginning and 91.2MB in the end (delta: 30.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.90ms. Allocated memory is still 148.9MB. Free memory was 91.2MB in the beginning and 83.7MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.21ms. Allocated memory is still 148.9MB. Free memory was 83.7MB in the beginning and 73.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1262.28ms. Allocated memory is still 148.9MB. Free memory was 73.3MB in the beginning and 110.2MB in the end (delta: -36.9MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11970.21ms. Allocated memory was 148.9MB in the beginning and 358.6MB in the end (delta: 209.7MB). Free memory was 109.1MB in the beginning and 142.5MB in the end (delta: -33.4MB). Peak memory consumption was 175.3MB. Max. memory is 16.1GB. * Witness Printer took 172.66ms. Allocated memory is still 358.6MB. Free memory was 142.5MB in the beginning and 131.0MB in the end (delta: 11.5MB). 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: 194]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1133 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1133 mSDsluCounter, 1143 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 799 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5083 IncrementalHoareTripleChecker+Invalid, 5882 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 799 mSolverCounterUnsat, 1067 mSDtfsCounter, 5083 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2645occurred in iteration=10, InterpolantAutomatonStates: 39, 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, 11 MinimizatonAttempts, 556 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 3075 NumberOfCodeBlocks, 3075 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3063 ConstructedInterpolants, 0 QuantifiedInterpolants, 9649 SizeOfPredicates, 0 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2650/2745 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: (((((((a10 <= 0) && (14 == a4)) && (7 != a19)) && (a12 == 0)) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (7 != a19)) && (a12 == 0))) || (((((a19 <= 9) && (0 <= a1)) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:09:33,013 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