./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label49.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label49.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 72620f06cf213625543d30e414a89c2b8e83a12871b1ae1124ef85c707116f4d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 21:20:11,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 21:20:11,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 21:20:11,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 21:20:11,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 21:20:11,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 21:20:11,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 21:20:11,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 21:20:11,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 21:20:11,338 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 21:20:11,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 21:20:11,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 21:20:11,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 21:20:11,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 21:20:11,340 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 21:20:11,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 21:20:11,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 21:20:11,341 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 21:20:11,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 21:20:11,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 21:20:11,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 21:20:11,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 21:20:11,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 21:20:11,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 21:20:11,344 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 21:20:11,344 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 21:20:11,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 21:20:11,344 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 21:20:11,344 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 21:20:11,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 21:20:11,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 21:20:11,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 21:20:11,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:20:11,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 21:20:11,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 21:20:11,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 21:20:11,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 21:20:11,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 21:20:11,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 21:20:11,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 21:20:11,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 21:20:11,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 21:20:11,347 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 -> 72620f06cf213625543d30e414a89c2b8e83a12871b1ae1124ef85c707116f4d [2024-11-21 21:20:11,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 21:20:11,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 21:20:11,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 21:20:11,571 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 21:20:11,571 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 21:20:11,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label49.c [2024-11-21 21:20:12,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 21:20:13,002 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 21:20:13,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label49.c [2024-11-21 21:20:13,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04a25b54/00a04f0ab278488fb58c415417263924/FLAG49bfb037f [2024-11-21 21:20:13,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04a25b54/00a04f0ab278488fb58c415417263924 [2024-11-21 21:20:13,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 21:20:13,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 21:20:13,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 21:20:13,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 21:20:13,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 21:20:13,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:20:13" (1/1) ... [2024-11-21 21:20:13,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f75976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:13, skipping insertion in model container [2024-11-21 21:20:13,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:20:13" (1/1) ... [2024-11-21 21:20:13,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 21:20:13,344 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/Problem02_label49.c[19626,19639] [2024-11-21 21:20:13,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:20:13,378 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 21:20:13,437 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/Problem02_label49.c[19626,19639] [2024-11-21 21:20:13,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:20:13,460 INFO L204 MainTranslator]: Completed translation [2024-11-21 21:20:13,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:13 WrapperNode [2024-11-21 21:20:13,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 21:20:13,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 21:20:13,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 21:20:13,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 21:20:13,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:13" (1/1) ... [2024-11-21 21:20:13,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:13" (1/1) ... [2024-11-21 21:20:13,524 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-21 21:20:13,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 21:20:13,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 21:20:13,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 21:20:13,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 21:20:13,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:13" (1/1) ... [2024-11-21 21:20:13,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:13" (1/1) ... [2024-11-21 21:20:13,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:13" (1/1) ... [2024-11-21 21:20:13,565 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-21 21:20:13,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:13" (1/1) ... [2024-11-21 21:20:13,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:13" (1/1) ... [2024-11-21 21:20:13,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:13" (1/1) ... [2024-11-21 21:20:13,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:13" (1/1) ... [2024-11-21 21:20:13,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:13" (1/1) ... [2024-11-21 21:20:13,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:13" (1/1) ... [2024-11-21 21:20:13,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 21:20:13,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 21:20:13,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 21:20:13,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 21:20:13,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:13" (1/1) ... [2024-11-21 21:20:13,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:20:13,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:20:13,657 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-21 21:20:13,660 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-21 21:20:13,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 21:20:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 21:20:13,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 21:20:13,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 21:20:13,772 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 21:20:13,774 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 21:20:14,512 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-21 21:20:14,512 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 21:20:14,532 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 21:20:14,533 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 21:20:14,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:20:14 BoogieIcfgContainer [2024-11-21 21:20:14,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 21:20:14,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 21:20:14,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 21:20:14,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 21:20:14,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:20:13" (1/3) ... [2024-11-21 21:20:14,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cac189e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:20:14, skipping insertion in model container [2024-11-21 21:20:14,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:20:13" (2/3) ... [2024-11-21 21:20:14,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cac189e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:20:14, skipping insertion in model container [2024-11-21 21:20:14,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:20:14" (3/3) ... [2024-11-21 21:20:14,541 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label49.c [2024-11-21 21:20:14,553 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 21:20:14,553 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 21:20:14,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 21:20:14,615 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;@1f3efafb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 21:20:14,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 21:20:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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-21 21:20:14,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-21 21:20:14,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:14,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:20:14,628 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:14,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1378216101, now seen corresponding path program 1 times [2024-11-21 21:20:14,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:14,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430181901] [2024-11-21 21:20:14,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:14,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:15,066 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-21 21:20:15,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:15,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430181901] [2024-11-21 21:20:15,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430181901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:15,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:15,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:20:15,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847977984] [2024-11-21 21:20:15,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:15,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:15,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:15,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:15,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:15,096 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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-21 21:20:15,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:15,698 INFO L93 Difference]: Finished difference Result 630 states and 1070 transitions. [2024-11-21 21:20:15,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:15,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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 125 [2024-11-21 21:20:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:15,709 INFO L225 Difference]: With dead ends: 630 [2024-11-21 21:20:15,709 INFO L226 Difference]: Without dead ends: 318 [2024-11-21 21:20:15,712 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-21 21:20:15,715 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 105 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:15,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 119 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 21:20:15,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-21 21:20:15,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-11-21 21:20:15,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.473186119873817) internal successors, (467), 317 states have internal predecessors, (467), 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-21 21:20:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2024-11-21 21:20:15,757 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 125 [2024-11-21 21:20:15,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:15,757 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2024-11-21 21:20:15,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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-21 21:20:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2024-11-21 21:20:15,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-21 21:20:15,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:15,760 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:20:15,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 21:20:15,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:15,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:15,761 INFO L85 PathProgramCache]: Analyzing trace with hash 427040720, now seen corresponding path program 1 times [2024-11-21 21:20:15,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:15,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201691481] [2024-11-21 21:20:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:15,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:20:16,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:16,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201691481] [2024-11-21 21:20:16,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201691481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:16,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:16,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:16,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042906788] [2024-11-21 21:20:16,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:16,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 21:20:16,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:16,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 21:20:16,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:20:16,097 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 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-21 21:20:16,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:16,630 INFO L93 Difference]: Finished difference Result 999 states and 1508 transitions. [2024-11-21 21:20:16,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 21:20:16,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 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 129 [2024-11-21 21:20:16,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:16,633 INFO L225 Difference]: With dead ends: 999 [2024-11-21 21:20:16,633 INFO L226 Difference]: Without dead ends: 600 [2024-11-21 21:20:16,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:20:16,635 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 170 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:16,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 114 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 21:20:16,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-21 21:20:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-21 21:20:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.357262103505843) internal successors, (813), 599 states have internal predecessors, (813), 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-21 21:20:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 813 transitions. [2024-11-21 21:20:16,654 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 813 transitions. Word has length 129 [2024-11-21 21:20:16,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:16,654 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 813 transitions. [2024-11-21 21:20:16,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 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-21 21:20:16,655 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 813 transitions. [2024-11-21 21:20:16,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-21 21:20:16,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:16,657 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:20:16,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 21:20:16,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:16,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:16,658 INFO L85 PathProgramCache]: Analyzing trace with hash 349951226, now seen corresponding path program 1 times [2024-11-21 21:20:16,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:16,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130165961] [2024-11-21 21:20:16,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:16,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:20:16,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:16,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130165961] [2024-11-21 21:20:16,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130165961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:16,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:16,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:20:16,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657755907] [2024-11-21 21:20:16,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:16,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:16,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:16,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:16,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:16,789 INFO L87 Difference]: Start difference. First operand 600 states and 813 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 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-21 21:20:17,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:17,128 INFO L93 Difference]: Finished difference Result 1779 states and 2417 transitions. [2024-11-21 21:20:17,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:17,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 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 143 [2024-11-21 21:20:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:17,132 INFO L225 Difference]: With dead ends: 1779 [2024-11-21 21:20:17,132 INFO L226 Difference]: Without dead ends: 1181 [2024-11-21 21:20:17,134 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-21 21:20:17,136 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 156 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:17,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 100 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:20:17,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2024-11-21 21:20:17,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1173. [2024-11-21 21:20:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.310580204778157) internal successors, (1536), 1172 states have internal predecessors, (1536), 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-21 21:20:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1536 transitions. [2024-11-21 21:20:17,170 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1536 transitions. Word has length 143 [2024-11-21 21:20:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:17,170 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1536 transitions. [2024-11-21 21:20:17,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 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-21 21:20:17,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1536 transitions. [2024-11-21 21:20:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-21 21:20:17,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:17,177 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:20:17,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 21:20:17,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:17,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:17,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1893011715, now seen corresponding path program 1 times [2024-11-21 21:20:17,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:17,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795718379] [2024-11-21 21:20:17,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:17,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-21 21:20:17,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:17,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795718379] [2024-11-21 21:20:17,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795718379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:17,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:17,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:20:17,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423518002] [2024-11-21 21:20:17,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:17,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:17,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:17,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:17,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:17,271 INFO L87 Difference]: Start difference. First operand 1173 states and 1536 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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-21 21:20:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:17,663 INFO L93 Difference]: Finished difference Result 3329 states and 4384 transitions. [2024-11-21 21:20:17,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:17,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 155 [2024-11-21 21:20:17,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:17,673 INFO L225 Difference]: With dead ends: 3329 [2024-11-21 21:20:17,673 INFO L226 Difference]: Without dead ends: 2158 [2024-11-21 21:20:17,677 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-21 21:20:17,679 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 126 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:17,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 127 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:20:17,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2024-11-21 21:20:17,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2155. [2024-11-21 21:20:17,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 2154 states have (on average 1.1996285979572887) internal successors, (2584), 2154 states have internal predecessors, (2584), 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-21 21:20:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2584 transitions. [2024-11-21 21:20:17,725 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2584 transitions. Word has length 155 [2024-11-21 21:20:17,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:17,725 INFO L471 AbstractCegarLoop]: Abstraction has 2155 states and 2584 transitions. [2024-11-21 21:20:17,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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-21 21:20:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2584 transitions. [2024-11-21 21:20:17,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-21 21:20:17,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:17,730 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:20:17,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 21:20:17,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:17,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:17,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1809702189, now seen corresponding path program 1 times [2024-11-21 21:20:17,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:17,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327498757] [2024-11-21 21:20:17,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:17,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-21 21:20:17,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:17,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327498757] [2024-11-21 21:20:17,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327498757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:17,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:17,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:17,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779371230] [2024-11-21 21:20:17,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:17,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:17,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:17,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:17,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:17,853 INFO L87 Difference]: Start difference. First operand 2155 states and 2584 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-21 21:20:18,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:18,201 INFO L93 Difference]: Finished difference Result 5311 states and 6450 transitions. [2024-11-21 21:20:18,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:18,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 158 [2024-11-21 21:20:18,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:18,209 INFO L225 Difference]: With dead ends: 5311 [2024-11-21 21:20:18,209 INFO L226 Difference]: Without dead ends: 3158 [2024-11-21 21:20:18,211 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-21 21:20:18,212 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 160 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:18,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 253 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:20:18,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3158 states. [2024-11-21 21:20:18,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3158 to 3016. [2024-11-21 21:20:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3016 states, 3015 states have (on average 1.1754560530679934) internal successors, (3544), 3015 states have internal predecessors, (3544), 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-21 21:20:18,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3544 transitions. [2024-11-21 21:20:18,250 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3544 transitions. Word has length 158 [2024-11-21 21:20:18,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:18,250 INFO L471 AbstractCegarLoop]: Abstraction has 3016 states and 3544 transitions. [2024-11-21 21:20:18,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-21 21:20:18,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3544 transitions. [2024-11-21 21:20:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-21 21:20:18,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:18,270 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:20:18,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 21:20:18,271 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:18,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:18,271 INFO L85 PathProgramCache]: Analyzing trace with hash 503140008, now seen corresponding path program 1 times [2024-11-21 21:20:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:18,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802545519] [2024-11-21 21:20:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:18,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:18,335 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:20:18,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:18,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802545519] [2024-11-21 21:20:18,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802545519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:18,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:18,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:18,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957339182] [2024-11-21 21:20:18,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:18,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:18,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:18,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:18,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:18,337 INFO L87 Difference]: Start difference. First operand 3016 states and 3544 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-21 21:20:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:18,661 INFO L93 Difference]: Finished difference Result 6177 states and 7247 transitions. [2024-11-21 21:20:18,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:18,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 158 [2024-11-21 21:20:18,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:18,670 INFO L225 Difference]: With dead ends: 6177 [2024-11-21 21:20:18,671 INFO L226 Difference]: Without dead ends: 2883 [2024-11-21 21:20:18,673 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-21 21:20:18,675 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 145 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:18,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 281 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:20:18,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2024-11-21 21:20:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2725. [2024-11-21 21:20:18,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2725 states, 2724 states have (on average 1.145007342143906) internal successors, (3119), 2724 states have internal predecessors, (3119), 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-21 21:20:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 2725 states and 3119 transitions. [2024-11-21 21:20:18,718 INFO L78 Accepts]: Start accepts. Automaton has 2725 states and 3119 transitions. Word has length 158 [2024-11-21 21:20:18,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:18,718 INFO L471 AbstractCegarLoop]: Abstraction has 2725 states and 3119 transitions. [2024-11-21 21:20:18,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-21 21:20:18,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2725 states and 3119 transitions. [2024-11-21 21:20:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-21 21:20:18,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:18,722 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:20:18,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 21:20:18,722 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:18,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:18,722 INFO L85 PathProgramCache]: Analyzing trace with hash 66033155, now seen corresponding path program 1 times [2024-11-21 21:20:18,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:18,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592857975] [2024-11-21 21:20:18,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:18,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:20:18,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:18,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592857975] [2024-11-21 21:20:18,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592857975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:18,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:18,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:18,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146332477] [2024-11-21 21:20:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:18,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:18,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:18,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:18,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:18,813 INFO L87 Difference]: Start difference. First operand 2725 states and 3119 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-21 21:20:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:19,172 INFO L93 Difference]: Finished difference Result 6292 states and 7253 transitions. [2024-11-21 21:20:19,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:19,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2024-11-21 21:20:19,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:19,181 INFO L225 Difference]: With dead ends: 6292 [2024-11-21 21:20:19,181 INFO L226 Difference]: Without dead ends: 3569 [2024-11-21 21:20:19,184 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-21 21:20:19,185 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:19,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 56 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:20:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3569 states. [2024-11-21 21:20:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3569 to 3423. [2024-11-21 21:20:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3423 states, 3422 states have (on average 1.1496201052016364) internal successors, (3934), 3422 states have internal predecessors, (3934), 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-21 21:20:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3423 states to 3423 states and 3934 transitions. [2024-11-21 21:20:19,225 INFO L78 Accepts]: Start accepts. Automaton has 3423 states and 3934 transitions. Word has length 161 [2024-11-21 21:20:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:19,226 INFO L471 AbstractCegarLoop]: Abstraction has 3423 states and 3934 transitions. [2024-11-21 21:20:19,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-21 21:20:19,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3423 states and 3934 transitions. [2024-11-21 21:20:19,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-21 21:20:19,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:19,230 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:20:19,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 21:20:19,231 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:19,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:19,231 INFO L85 PathProgramCache]: Analyzing trace with hash -777204465, now seen corresponding path program 1 times [2024-11-21 21:20:19,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:19,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284870424] [2024-11-21 21:20:19,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:19,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-21 21:20:19,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:19,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284870424] [2024-11-21 21:20:19,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284870424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:19,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:19,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:19,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254485152] [2024-11-21 21:20:19,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:19,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:19,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:19,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:19,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:19,297 INFO L87 Difference]: Start difference. First operand 3423 states and 3934 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-21 21:20:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:19,650 INFO L93 Difference]: Finished difference Result 7821 states and 9030 transitions. [2024-11-21 21:20:19,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:19,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 169 [2024-11-21 21:20:19,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:19,657 INFO L225 Difference]: With dead ends: 7821 [2024-11-21 21:20:19,658 INFO L226 Difference]: Without dead ends: 2987 [2024-11-21 21:20:19,661 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-21 21:20:19,662 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 129 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:19,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 260 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:20:19,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2024-11-21 21:20:19,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2987. [2024-11-21 21:20:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2987 states, 2986 states have (on average 1.1091761553918285) internal successors, (3312), 2986 states have internal predecessors, (3312), 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-21 21:20:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 3312 transitions. [2024-11-21 21:20:19,694 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 3312 transitions. Word has length 169 [2024-11-21 21:20:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:19,695 INFO L471 AbstractCegarLoop]: Abstraction has 2987 states and 3312 transitions. [2024-11-21 21:20:19,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-21 21:20:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 3312 transitions. [2024-11-21 21:20:19,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-21 21:20:19,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:19,699 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:20:19,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 21:20:19,699 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:19,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:19,700 INFO L85 PathProgramCache]: Analyzing trace with hash -790765054, now seen corresponding path program 1 times [2024-11-21 21:20:19,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:19,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645569] [2024-11-21 21:20:19,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:19,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-21 21:20:19,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:19,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645569] [2024-11-21 21:20:19,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:19,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:19,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:19,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713855187] [2024-11-21 21:20:19,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:19,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:19,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:19,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:19,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:19,790 INFO L87 Difference]: Start difference. First operand 2987 states and 3312 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-21 21:20:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:20,094 INFO L93 Difference]: Finished difference Result 6113 states and 6775 transitions. [2024-11-21 21:20:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:20,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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 210 [2024-11-21 21:20:20,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:20,104 INFO L225 Difference]: With dead ends: 6113 [2024-11-21 21:20:20,104 INFO L226 Difference]: Without dead ends: 3128 [2024-11-21 21:20:20,106 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-21 21:20:20,108 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 111 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:20,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 231 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:20:20,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2024-11-21 21:20:20,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 3127. [2024-11-21 21:20:20,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3127 states, 3126 states have (on average 1.0969289827255277) internal successors, (3429), 3126 states have internal predecessors, (3429), 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-21 21:20:20,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 3429 transitions. [2024-11-21 21:20:20,177 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 3429 transitions. Word has length 210 [2024-11-21 21:20:20,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:20,177 INFO L471 AbstractCegarLoop]: Abstraction has 3127 states and 3429 transitions. [2024-11-21 21:20:20,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-21 21:20:20,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 3429 transitions. [2024-11-21 21:20:20,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-21 21:20:20,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:20,183 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:20:20,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 21:20:20,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:20,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:20,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2119603872, now seen corresponding path program 1 times [2024-11-21 21:20:20,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:20,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193443602] [2024-11-21 21:20:20,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:20,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-21 21:20:20,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:20,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193443602] [2024-11-21 21:20:20,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193443602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:20,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:20,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:20,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172752259] [2024-11-21 21:20:20,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:20,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:20,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:20,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:20,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:20,301 INFO L87 Difference]: Start difference. First operand 3127 states and 3429 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 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-21 21:20:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:20,644 INFO L93 Difference]: Finished difference Result 7376 states and 8164 transitions. [2024-11-21 21:20:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:20,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 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 231 [2024-11-21 21:20:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:20,654 INFO L225 Difference]: With dead ends: 7376 [2024-11-21 21:20:20,654 INFO L226 Difference]: Without dead ends: 4251 [2024-11-21 21:20:20,657 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-21 21:20:20,658 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 131 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:20,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 204 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:20:20,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4251 states. [2024-11-21 21:20:20,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4251 to 4249. [2024-11-21 21:20:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4249 states, 4248 states have (on average 1.0969868173258004) internal successors, (4660), 4248 states have internal predecessors, (4660), 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-21 21:20:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4249 states to 4249 states and 4660 transitions. [2024-11-21 21:20:20,712 INFO L78 Accepts]: Start accepts. Automaton has 4249 states and 4660 transitions. Word has length 231 [2024-11-21 21:20:20,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:20,712 INFO L471 AbstractCegarLoop]: Abstraction has 4249 states and 4660 transitions. [2024-11-21 21:20:20,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 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-21 21:20:20,712 INFO L276 IsEmpty]: Start isEmpty. Operand 4249 states and 4660 transitions. [2024-11-21 21:20:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-21 21:20:20,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:20,718 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-21 21:20:20,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 21:20:20,718 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:20,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:20,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1501187662, now seen corresponding path program 1 times [2024-11-21 21:20:20,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:20,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939092597] [2024-11-21 21:20:20,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:20,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-21 21:20:20,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:20,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939092597] [2024-11-21 21:20:20,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939092597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:20,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:20,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:20,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181423085] [2024-11-21 21:20:20,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:20,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:20,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:20,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:20,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:20,838 INFO L87 Difference]: Start difference. First operand 4249 states and 4660 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:20:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:21,144 INFO L93 Difference]: Finished difference Result 9196 states and 10071 transitions. [2024-11-21 21:20:21,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:21,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2024-11-21 21:20:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:21,153 INFO L225 Difference]: With dead ends: 9196 [2024-11-21 21:20:21,153 INFO L226 Difference]: Without dead ends: 4247 [2024-11-21 21:20:21,157 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-21 21:20:21,158 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 82 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:21,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 217 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:20:21,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4247 states. [2024-11-21 21:20:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4247 to 4107. [2024-11-21 21:20:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4107 states, 4106 states have (on average 1.0579639551875304) internal successors, (4344), 4106 states have internal predecessors, (4344), 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-21 21:20:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4107 states to 4107 states and 4344 transitions. [2024-11-21 21:20:21,204 INFO L78 Accepts]: Start accepts. Automaton has 4107 states and 4344 transitions. Word has length 247 [2024-11-21 21:20:21,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:21,205 INFO L471 AbstractCegarLoop]: Abstraction has 4107 states and 4344 transitions. [2024-11-21 21:20:21,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:20:21,205 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 4344 transitions. [2024-11-21 21:20:21,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-21 21:20:21,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:21,210 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:20:21,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-21 21:20:21,211 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:21,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:21,211 INFO L85 PathProgramCache]: Analyzing trace with hash 804482779, now seen corresponding path program 1 times [2024-11-21 21:20:21,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:21,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754451071] [2024-11-21 21:20:21,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:21,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:21,310 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-21 21:20:21,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:21,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754451071] [2024-11-21 21:20:21,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754451071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:21,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:21,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:21,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648056809] [2024-11-21 21:20:21,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:21,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:21,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:21,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:21,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:21,312 INFO L87 Difference]: Start difference. First operand 4107 states and 4344 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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-21 21:20:21,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:21,565 INFO L93 Difference]: Finished difference Result 6510 states and 6836 transitions. [2024-11-21 21:20:21,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:21,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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 259 [2024-11-21 21:20:21,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:21,573 INFO L225 Difference]: With dead ends: 6510 [2024-11-21 21:20:21,573 INFO L226 Difference]: Without dead ends: 2405 [2024-11-21 21:20:21,576 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-21 21:20:21,577 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 150 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:21,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 46 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 21:20:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2024-11-21 21:20:21,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2265. [2024-11-21 21:20:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 2264 states have (on average 1.0318021201413428) internal successors, (2336), 2264 states have internal predecessors, (2336), 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-21 21:20:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 2336 transitions. [2024-11-21 21:20:21,607 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 2336 transitions. Word has length 259 [2024-11-21 21:20:21,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:21,608 INFO L471 AbstractCegarLoop]: Abstraction has 2265 states and 2336 transitions. [2024-11-21 21:20:21,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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-21 21:20:21,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 2336 transitions. [2024-11-21 21:20:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-11-21 21:20:21,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:20:21,612 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:20:21,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-21 21:20:21,613 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:20:21,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:20:21,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1984046020, now seen corresponding path program 1 times [2024-11-21 21:20:21,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:20:21,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296351193] [2024-11-21 21:20:21,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:20:21,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:20:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:20:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-21 21:20:21,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:20:21,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296351193] [2024-11-21 21:20:21,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296351193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:20:21,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:20:21,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:20:21,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36671217] [2024-11-21 21:20:21,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:20:21,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:20:21,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:20:21,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:20:21,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:20:21,702 INFO L87 Difference]: Start difference. First operand 2265 states and 2336 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-21 21:20:21,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:20:21,945 INFO L93 Difference]: Finished difference Result 2685 states and 2766 transitions. [2024-11-21 21:20:21,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:20:21,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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 288 [2024-11-21 21:20:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:20:21,950 INFO L225 Difference]: With dead ends: 2685 [2024-11-21 21:20:21,950 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 21:20:21,952 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-21 21:20:21,953 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 103 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-21 21:20:21,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 195 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 21:20:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 21:20:21,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 21:20:21,955 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-21 21:20:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 21:20:21,955 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 288 [2024-11-21 21:20:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:20:21,955 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 21:20:21,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-21 21:20:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 21:20:21,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 21:20:21,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 21:20:21,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-21 21:20:21,961 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:20:21,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 21:20:22,325 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 21:20:22,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:20:22 BoogieIcfgContainer [2024-11-21 21:20:22,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 21:20:22,346 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 21:20:22,346 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 21:20:22,346 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 21:20:22,346 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:20:14" (3/4) ... [2024-11-21 21:20:22,348 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 21:20:22,368 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 21:20:22,369 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-21 21:20:22,370 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 21:20:22,370 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 21:20:22,496 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 21:20:22,497 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 21:20:22,497 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 21:20:22,497 INFO L158 Benchmark]: Toolchain (without parser) took 9465.20ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 111.1MB in the beginning and 218.0MB in the end (delta: -106.9MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2024-11-21 21:20:22,497 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 21:20:22,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.70ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 81.8MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-21 21:20:22,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.28ms. Allocated memory is still 167.8MB. Free memory was 81.8MB in the beginning and 76.4MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-21 21:20:22,498 INFO L158 Benchmark]: Boogie Preprocessor took 78.14ms. Allocated memory is still 167.8MB. Free memory was 76.4MB in the beginning and 71.0MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-21 21:20:22,498 INFO L158 Benchmark]: RCFGBuilder took 928.21ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 71.0MB in the beginning and 109.9MB in the end (delta: -38.9MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2024-11-21 21:20:22,498 INFO L158 Benchmark]: TraceAbstraction took 7810.87ms. Allocated memory was 220.2MB in the beginning and 318.8MB in the end (delta: 98.6MB). Free memory was 108.8MB in the beginning and 230.6MB in the end (delta: -121.8MB). Peak memory consumption was 115.2MB. Max. memory is 16.1GB. [2024-11-21 21:20:22,499 INFO L158 Benchmark]: Witness Printer took 150.66ms. Allocated memory is still 318.8MB. Free memory was 230.6MB in the beginning and 218.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 21:20:22,500 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.15ms. Allocated memory is still 167.8MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.70ms. Allocated memory is still 167.8MB. Free memory was 111.1MB in the beginning and 81.8MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.28ms. Allocated memory is still 167.8MB. Free memory was 81.8MB in the beginning and 76.4MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.14ms. Allocated memory is still 167.8MB. Free memory was 76.4MB in the beginning and 71.0MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 928.21ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 71.0MB in the beginning and 109.9MB in the end (delta: -38.9MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7810.87ms. Allocated memory was 220.2MB in the beginning and 318.8MB in the end (delta: 98.6MB). Free memory was 108.8MB in the beginning and 230.6MB in the end (delta: -121.8MB). Peak memory consumption was 115.2MB. Max. memory is 16.1GB. * Witness Printer took 150.66ms. Allocated memory is still 318.8MB. Free memory was 230.6MB in the beginning and 218.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 557]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 13, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1718 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1718 mSDsluCounter, 2203 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 242 mSDsCounter, 814 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4912 IncrementalHoareTripleChecker+Invalid, 5726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 814 mSolverCounterUnsat, 1961 mSDtfsCounter, 4912 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4249occurred in iteration=10, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 740 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2433 NumberOfCodeBlocks, 2433 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2420 ConstructedInterpolants, 0 QuantifiedInterpolants, 4808 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 1562/1562 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: 616]: Loop Invariant Derived loop invariant: ((((((((((((((((((a17 <= 7) && (a25 <= 0)) || ((((a19 == 0) && (a11 == 1)) && (a28 <= 7)) && (a25 <= 0))) || (((a19 == 0) && (a11 <= 0)) && (a25 <= 0))) || (((((a17 == 8) && (a25 == 1)) && (a28 == 10)) && (a21 == 1)) && (a19 == 1))) || (((a25 == 1) && (a17 <= 7)) && (a28 <= 10))) || ((((a25 == 1) && (a11 <= 0)) && (a28 <= 10)) && (a19 == 1))) || ((((a19 == 0) && (a25 == 1)) && (a28 == 10)) && (a11 <= 0))) || (((a19 == 0) && (a11 <= 0)) && (a28 <= 7))) || ((((a25 == 1) && (a11 == 1)) && (a19 == 1)) && (a28 <= 7))) || ((((((a17 == 8) && (a21 == 1)) && (a11 <= 0)) && (a19 == 1)) && (a28 <= 7)) && (a25 <= 0))) || (((((a17 == 8) && (a28 == 10)) && (a21 == 1)) && (a19 == 1)) && (a25 <= 0))) || (((a25 == 1) && (a17 <= 7)) && (a11 <= 0))) || ((((((a17 == 8) && (a25 == 1)) && (a11 == 1)) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (((((((a17 == 8) && (9 <= a28)) && (a21 == 1)) && (a11 <= 0)) && (a28 <= 10)) && (a19 == 1)) && (a25 <= 0))) || (((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a19 == 1)) && (a28 <= 7))) || (((((a17 == 8) && (11 <= a28)) && (a25 == 1)) && (a21 == 1)) && (a19 == 1))) || (((((((a17 == 8) && (9 <= a28)) && (a11 == 1)) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1)) && (a25 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-21 21:20:22,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE