./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label57.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 994616d66ca033fc3fdb2ff90a3c12325be68b1e13dbd152dc58837c2705aec2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:49:48,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:49:48,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:49:48,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:49:48,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:49:48,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:49:48,326 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:49:48,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:49:48,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:49:48,329 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:49:48,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:49:48,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:49:48,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:49:48,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:49:48,332 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:49:48,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:49:48,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:49:48,333 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:49:48,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:49:48,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:49:48,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:49:48,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:49:48,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:49:48,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:49:48,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:49:48,337 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:49:48,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:49:48,337 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:49:48,338 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:49:48,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:49:48,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:49:48,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:49:48,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:49:48,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:49:48,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:49:48,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:49:48,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:49:48,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:49:48,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:49:48,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:49:48,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:49:48,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:49:48,341 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 -> 994616d66ca033fc3fdb2ff90a3c12325be68b1e13dbd152dc58837c2705aec2 [2024-11-09 19:49:48,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:49:48,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:49:48,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:49:48,614 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:49:48,614 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:49:48,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label57.c [2024-11-09 19:49:50,094 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:49:50,424 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:49:50,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label57.c [2024-11-09 19:49:50,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02424827b/8daba036a6e84f63b88c112bd5655f45/FLAG527836b02 [2024-11-09 19:49:50,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02424827b/8daba036a6e84f63b88c112bd5655f45 [2024-11-09 19:49:50,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:49:50,471 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:49:50,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:49:50,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:49:50,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:49:50,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:49:50" (1/1) ... [2024-11-09 19:49:50,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@520aac13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:50, skipping insertion in model container [2024-11-09 19:49:50,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:49:50" (1/1) ... [2024-11-09 19:49:50,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:49:50,771 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/Problem16_label57.c[4337,4350] [2024-11-09 19:49:51,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:49:51,150 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:49:51,171 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/Problem16_label57.c[4337,4350] [2024-11-09 19:49:51,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:49:51,345 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:49:51,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51 WrapperNode [2024-11-09 19:49:51,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:49:51,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:49:51,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:49:51,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:49:51,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 19:49:51,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 19:49:51,505 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1769 [2024-11-09 19:49:51,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:49:51,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:49:51,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:49:51,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:49:51,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 19:49:51,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 19:49:51,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 19:49:51,627 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-09 19:49:51,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 19:49:51,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 19:49:51,691 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 19:49:51,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 19:49:51,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 19:49:51,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 19:49:51,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:49:51,771 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:49:51,771 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:49:51,771 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:49:51,772 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (1/1) ... [2024-11-09 19:49:51,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:49:51,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:49:51,812 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-09 19:49:51,815 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-09 19:49:51,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:49:51,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:49:51,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:49:51,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:49:51,926 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:49:51,928 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:49:54,303 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2024-11-09 19:49:54,439 INFO L? ?]: Removed 757 outVars from TransFormulas that were not future-live. [2024-11-09 19:49:54,441 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:49:54,469 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:49:54,470 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:49:54,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:49:54 BoogieIcfgContainer [2024-11-09 19:49:54,470 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:49:54,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:49:54,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:49:54,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:49:54,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:49:50" (1/3) ... [2024-11-09 19:49:54,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac55cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:49:54, skipping insertion in model container [2024-11-09 19:49:54,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:49:51" (2/3) ... [2024-11-09 19:49:54,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac55cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:49:54, skipping insertion in model container [2024-11-09 19:49:54,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:49:54" (3/3) ... [2024-11-09 19:49:54,480 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label57.c [2024-11-09 19:49:54,497 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:49:54,497 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:49:54,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:49:54,589 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;@562555da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:49:54,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:49:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 399 states, 397 states have (on average 2.4886649874055418) internal successors, (988), 398 states have internal predecessors, (988), 0 states have call successors, (0), 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-09 19:49:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 19:49:54,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:49:54,606 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] [2024-11-09 19:49:54,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:49:54,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:49:54,613 INFO L85 PathProgramCache]: Analyzing trace with hash -461427067, now seen corresponding path program 1 times [2024-11-09 19:49:54,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:49:54,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408451956] [2024-11-09 19:49:54,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:49:54,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:49:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:49:54,954 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-09 19:49:54,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:49:54,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408451956] [2024-11-09 19:49:54,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408451956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:49:54,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:49:54,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:49:54,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441426303] [2024-11-09 19:49:54,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:49:54,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:49:54,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:49:54,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:49:54,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:49:54,988 INFO L87 Difference]: Start difference. First operand has 399 states, 397 states have (on average 2.4886649874055418) internal successors, (988), 398 states have internal predecessors, (988), 0 states have call successors, (0), 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 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 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-09 19:49:57,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:49:57,137 INFO L93 Difference]: Finished difference Result 1128 states and 2895 transitions. [2024-11-09 19:49:57,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:49:57,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-11-09 19:49:57,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:49:57,154 INFO L225 Difference]: With dead ends: 1128 [2024-11-09 19:49:57,155 INFO L226 Difference]: Without dead ends: 665 [2024-11-09 19:49:57,159 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-09 19:49:57,162 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 582 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:49:57,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 227 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 19:49:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-09 19:49:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2024-11-09 19:49:57,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 2.3689759036144578) internal successors, (1573), 664 states have internal predecessors, (1573), 0 states have call successors, (0), 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-09 19:49:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1573 transitions. [2024-11-09 19:49:57,236 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1573 transitions. Word has length 42 [2024-11-09 19:49:57,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:49:57,237 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 1573 transitions. [2024-11-09 19:49:57,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 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-09 19:49:57,237 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1573 transitions. [2024-11-09 19:49:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 19:49:57,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:49:57,242 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:49:57,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:49:57,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:49:57,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:49:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash -7038277, now seen corresponding path program 1 times [2024-11-09 19:49:57,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:49:57,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587892297] [2024-11-09 19:49:57,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:49:57,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:49:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:49:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:49:57,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:49:57,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587892297] [2024-11-09 19:49:57,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587892297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:49:57,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:49:57,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:49:57,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269456829] [2024-11-09 19:49:57,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:49:57,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:49:57,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:49:57,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:49:57,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:49:57,489 INFO L87 Difference]: Start difference. First operand 665 states and 1573 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:49:59,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:49:59,213 INFO L93 Difference]: Finished difference Result 1988 states and 4713 transitions. [2024-11-09 19:49:59,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:49:59,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-09 19:49:59,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:49:59,221 INFO L225 Difference]: With dead ends: 1988 [2024-11-09 19:49:59,221 INFO L226 Difference]: Without dead ends: 1325 [2024-11-09 19:49:59,226 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-09 19:49:59,228 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 560 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:49:59,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 203 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:49:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2024-11-09 19:49:59,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2024-11-09 19:49:59,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 2.1638972809667676) internal successors, (2865), 1324 states have internal predecessors, (2865), 0 states have call successors, (0), 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-09 19:49:59,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 2865 transitions. [2024-11-09 19:49:59,277 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 2865 transitions. Word has length 114 [2024-11-09 19:49:59,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:49:59,279 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 2865 transitions. [2024-11-09 19:49:59,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:49:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 2865 transitions. [2024-11-09 19:49:59,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 19:49:59,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:49:59,289 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:49:59,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:49:59,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:49:59,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:49:59,290 INFO L85 PathProgramCache]: Analyzing trace with hash 35229157, now seen corresponding path program 1 times [2024-11-09 19:49:59,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:49:59,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85874952] [2024-11-09 19:49:59,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:49:59,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:49:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:49:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 19:49:59,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:49:59,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85874952] [2024-11-09 19:49:59,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85874952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:49:59,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:49:59,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:49:59,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903724455] [2024-11-09 19:49:59,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:49:59,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:49:59,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:49:59,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:49:59,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:49:59,616 INFO L87 Difference]: Start difference. First operand 1325 states and 2865 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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-09 19:50:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:50:01,465 INFO L93 Difference]: Finished difference Result 3308 states and 7255 transitions. [2024-11-09 19:50:01,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:50:01,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 199 [2024-11-09 19:50:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:50:01,474 INFO L225 Difference]: With dead ends: 3308 [2024-11-09 19:50:01,475 INFO L226 Difference]: Without dead ends: 1985 [2024-11-09 19:50:01,477 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-09 19:50:01,482 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 621 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:50:01,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 159 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 19:50:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2024-11-09 19:50:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1655. [2024-11-09 19:50:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1654 states have (on average 2.1632406287787185) internal successors, (3578), 1654 states have internal predecessors, (3578), 0 states have call successors, (0), 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-09 19:50:01,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 3578 transitions. [2024-11-09 19:50:01,515 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 3578 transitions. Word has length 199 [2024-11-09 19:50:01,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:50:01,516 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 3578 transitions. [2024-11-09 19:50:01,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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-09 19:50:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 3578 transitions. [2024-11-09 19:50:01,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-09 19:50:01,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:50:01,519 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:50:01,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:50:01,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:50:01,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:50:01,520 INFO L85 PathProgramCache]: Analyzing trace with hash 119632533, now seen corresponding path program 1 times [2024-11-09 19:50:01,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:50:01,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639564808] [2024-11-09 19:50:01,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:50:01,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:50:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:50:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-09 19:50:01,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:50:01,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639564808] [2024-11-09 19:50:01,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639564808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:50:01,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:50:01,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:50:01,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534418305] [2024-11-09 19:50:01,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:50:01,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:50:01,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:50:01,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:50:01,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:50:01,869 INFO L87 Difference]: Start difference. First operand 1655 states and 3578 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 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-09 19:50:03,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:50:03,786 INFO L93 Difference]: Finished difference Result 4958 states and 10728 transitions. [2024-11-09 19:50:03,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:50:03,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 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 251 [2024-11-09 19:50:03,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:50:03,801 INFO L225 Difference]: With dead ends: 4958 [2024-11-09 19:50:03,802 INFO L226 Difference]: Without dead ends: 3305 [2024-11-09 19:50:03,806 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-09 19:50:03,807 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 514 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:50:03,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 83 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 19:50:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2024-11-09 19:50:03,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 2975. [2024-11-09 19:50:03,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2975 states, 2974 states have (on average 2.1203765971755213) internal successors, (6306), 2974 states have internal predecessors, (6306), 0 states have call successors, (0), 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-09 19:50:03,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 6306 transitions. [2024-11-09 19:50:03,895 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 6306 transitions. Word has length 251 [2024-11-09 19:50:03,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:50:03,896 INFO L471 AbstractCegarLoop]: Abstraction has 2975 states and 6306 transitions. [2024-11-09 19:50:03,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 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-09 19:50:03,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 6306 transitions. [2024-11-09 19:50:03,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-09 19:50:03,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:50:03,904 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-09 19:50:03,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:50:03,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:50:03,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:50:03,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2040400391, now seen corresponding path program 1 times [2024-11-09 19:50:03,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:50:03,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021635397] [2024-11-09 19:50:03,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:50:03,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:50:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:50:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-09 19:50:04,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:50:04,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021635397] [2024-11-09 19:50:04,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021635397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:50:04,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:50:04,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:50:04,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783552012] [2024-11-09 19:50:04,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:50:04,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:50:04,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:50:04,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:50:04,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:50:04,158 INFO L87 Difference]: Start difference. First operand 2975 states and 6306 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 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-09 19:50:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:50:05,768 INFO L93 Difference]: Finished difference Result 7268 states and 15230 transitions. [2024-11-09 19:50:05,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:50:05,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 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 354 [2024-11-09 19:50:05,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:50:05,783 INFO L225 Difference]: With dead ends: 7268 [2024-11-09 19:50:05,783 INFO L226 Difference]: Without dead ends: 4295 [2024-11-09 19:50:05,787 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-09 19:50:05,789 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 541 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:50:05,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 86 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 19:50:05,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4295 states. [2024-11-09 19:50:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4295 to 4295. [2024-11-09 19:50:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4295 states, 4294 states have (on average 2.0046576618537495) internal successors, (8608), 4294 states have internal predecessors, (8608), 0 states have call successors, (0), 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-09 19:50:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4295 states to 4295 states and 8608 transitions. [2024-11-09 19:50:05,867 INFO L78 Accepts]: Start accepts. Automaton has 4295 states and 8608 transitions. Word has length 354 [2024-11-09 19:50:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:50:05,868 INFO L471 AbstractCegarLoop]: Abstraction has 4295 states and 8608 transitions. [2024-11-09 19:50:05,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 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-09 19:50:05,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4295 states and 8608 transitions. [2024-11-09 19:50:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2024-11-09 19:50:05,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:50:05,877 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:50:05,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:50:05,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:50:05,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:50:05,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1224287601, now seen corresponding path program 1 times [2024-11-09 19:50:05,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:50:05,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698958902] [2024-11-09 19:50:05,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:50:05,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:50:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:50:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-09 19:50:06,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:50:06,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698958902] [2024-11-09 19:50:06,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698958902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:50:06,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:50:06,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:50:06,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140854120] [2024-11-09 19:50:06,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:50:06,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:50:06,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:50:06,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:50:06,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:50:06,582 INFO L87 Difference]: Start difference. First operand 4295 states and 8608 transitions. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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-09 19:50:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:50:08,721 INFO L93 Difference]: Finished difference Result 8918 states and 17818 transitions. [2024-11-09 19:50:08,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:50:08,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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 468 [2024-11-09 19:50:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:50:08,744 INFO L225 Difference]: With dead ends: 8918 [2024-11-09 19:50:08,744 INFO L226 Difference]: Without dead ends: 4625 [2024-11-09 19:50:08,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:50:08,750 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 389 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 2260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:50:08,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 328 Invalid, 2260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 19:50:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4625 states. [2024-11-09 19:50:08,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4625 to 4625. [2024-11-09 19:50:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4625 states, 4624 states have (on average 1.9909169550173011) internal successors, (9206), 4624 states have internal predecessors, (9206), 0 states have call successors, (0), 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-09 19:50:08,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 9206 transitions. [2024-11-09 19:50:08,834 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 9206 transitions. Word has length 468 [2024-11-09 19:50:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:50:08,835 INFO L471 AbstractCegarLoop]: Abstraction has 4625 states and 9206 transitions. [2024-11-09 19:50:08,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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-09 19:50:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 9206 transitions. [2024-11-09 19:50:08,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2024-11-09 19:50:08,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:50:08,847 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:50:08,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:50:08,847 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:50:08,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:50:08,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1254340617, now seen corresponding path program 1 times [2024-11-09 19:50:08,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:50:08,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129081187] [2024-11-09 19:50:08,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:50:08,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:50:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:50:09,648 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-09 19:50:09,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:50:09,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129081187] [2024-11-09 19:50:09,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129081187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:50:09,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:50:09,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 19:50:09,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674325695] [2024-11-09 19:50:09,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:50:09,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 19:50:09,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:50:09,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 19:50:09,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:50:09,652 INFO L87 Difference]: Start difference. First operand 4625 states and 9206 transitions. Second operand has 7 states, 7 states have (on average 57.142857142857146) internal successors, (400), 6 states have internal predecessors, (400), 0 states have call successors, (0), 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-09 19:50:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:50:11,692 INFO L93 Difference]: Finished difference Result 8781 states and 17401 transitions. [2024-11-09 19:50:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 19:50:11,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 57.142857142857146) internal successors, (400), 6 states have internal predecessors, (400), 0 states have call successors, (0), 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 556 [2024-11-09 19:50:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:50:11,708 INFO L225 Difference]: With dead ends: 8781 [2024-11-09 19:50:11,708 INFO L226 Difference]: Without dead ends: 4295 [2024-11-09 19:50:11,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 19:50:11,713 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 553 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 3061 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 3061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:50:11,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 308 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 3061 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 19:50:11,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4295 states. [2024-11-09 19:50:11,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4295 to 4295. [2024-11-09 19:50:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4295 states, 4294 states have (on average 1.8700512342803912) internal successors, (8030), 4294 states have internal predecessors, (8030), 0 states have call successors, (0), 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-09 19:50:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4295 states to 4295 states and 8030 transitions. [2024-11-09 19:50:11,779 INFO L78 Accepts]: Start accepts. Automaton has 4295 states and 8030 transitions. Word has length 556 [2024-11-09 19:50:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:50:11,780 INFO L471 AbstractCegarLoop]: Abstraction has 4295 states and 8030 transitions. [2024-11-09 19:50:11,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 57.142857142857146) internal successors, (400), 6 states have internal predecessors, (400), 0 states have call successors, (0), 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-09 19:50:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4295 states and 8030 transitions. [2024-11-09 19:50:11,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2024-11-09 19:50:11,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:50:11,791 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:50:11,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:50:11,791 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:50:11,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:50:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1485709603, now seen corresponding path program 1 times [2024-11-09 19:50:11,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:50:11,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874152494] [2024-11-09 19:50:11,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:50:11,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:50:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:50:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 542 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-09 19:50:12,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:50:12,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874152494] [2024-11-09 19:50:12,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874152494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:50:12,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:50:12,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:50:12,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877689753] [2024-11-09 19:50:12,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:50:12,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:50:12,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:50:12,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:50:12,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:50:12,216 INFO L87 Difference]: Start difference. First operand 4295 states and 8030 transitions. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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-09 19:50:13,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:50:13,438 INFO L93 Difference]: Finished difference Result 10568 states and 19858 transitions. [2024-11-09 19:50:13,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:50:13,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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 584 [2024-11-09 19:50:13,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:50:13,453 INFO L225 Difference]: With dead ends: 10568 [2024-11-09 19:50:13,453 INFO L226 Difference]: Without dead ends: 6605 [2024-11-09 19:50:13,457 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-09 19:50:13,458 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 481 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:50:13,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 701 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:50:13,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6605 states. [2024-11-09 19:50:13,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6605 to 6275. [2024-11-09 19:50:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6275 states, 6274 states have (on average 1.8532036978004462) internal successors, (11627), 6274 states have internal predecessors, (11627), 0 states have call successors, (0), 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-09 19:50:13,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6275 states to 6275 states and 11627 transitions. [2024-11-09 19:50:13,596 INFO L78 Accepts]: Start accepts. Automaton has 6275 states and 11627 transitions. Word has length 584 [2024-11-09 19:50:13,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:50:13,597 INFO L471 AbstractCegarLoop]: Abstraction has 6275 states and 11627 transitions. [2024-11-09 19:50:13,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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-09 19:50:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 6275 states and 11627 transitions. [2024-11-09 19:50:13,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2024-11-09 19:50:13,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:50:13,613 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:50:13,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:50:13,614 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:50:13,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:50:13,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1775787421, now seen corresponding path program 1 times [2024-11-09 19:50:13,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:50:13,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236633072] [2024-11-09 19:50:13,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:50:13,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:50:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:50:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 921 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-09 19:50:14,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:50:14,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236633072] [2024-11-09 19:50:14,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236633072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:50:14,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:50:14,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:50:14,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543764812] [2024-11-09 19:50:14,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:50:14,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:50:14,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:50:14,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:50:14,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:50:14,073 INFO L87 Difference]: Start difference. First operand 6275 states and 11627 transitions. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 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-09 19:50:15,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:50:15,279 INFO L93 Difference]: Finished difference Result 14198 states and 26435 transitions. [2024-11-09 19:50:15,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:50:15,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 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 688 [2024-11-09 19:50:15,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:50:15,302 INFO L225 Difference]: With dead ends: 14198 [2024-11-09 19:50:15,303 INFO L226 Difference]: Without dead ends: 8255 [2024-11-09 19:50:15,309 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-09 19:50:15,312 INFO L432 NwaCegarLoop]: 679 mSDtfsCounter, 438 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:50:15,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 687 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:50:15,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8255 states. [2024-11-09 19:50:15,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8255 to 7925. [2024-11-09 19:50:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7925 states, 7924 states have (on average 1.8490661282180716) internal successors, (14652), 7924 states have internal predecessors, (14652), 0 states have call successors, (0), 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-09 19:50:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7925 states to 7925 states and 14652 transitions. [2024-11-09 19:50:15,427 INFO L78 Accepts]: Start accepts. Automaton has 7925 states and 14652 transitions. Word has length 688 [2024-11-09 19:50:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:50:15,428 INFO L471 AbstractCegarLoop]: Abstraction has 7925 states and 14652 transitions. [2024-11-09 19:50:15,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 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-09 19:50:15,429 INFO L276 IsEmpty]: Start isEmpty. Operand 7925 states and 14652 transitions. [2024-11-09 19:50:15,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2024-11-09 19:50:15,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:50:15,443 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:50:15,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:50:15,443 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:50:15,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:50:15,444 INFO L85 PathProgramCache]: Analyzing trace with hash -331071035, now seen corresponding path program 1 times [2024-11-09 19:50:15,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:50:15,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634817081] [2024-11-09 19:50:15,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:50:15,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:50:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:50:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1362 backedges. 736 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2024-11-09 19:50:16,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:50:16,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634817081] [2024-11-09 19:50:16,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634817081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:50:16,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:50:16,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:50:16,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138361760] [2024-11-09 19:50:16,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:50:16,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:50:16,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:50:16,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:50:16,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:50:16,195 INFO L87 Difference]: Start difference. First operand 7925 states and 14652 transitions. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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-09 19:50:17,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:50:17,369 INFO L93 Difference]: Finished difference Result 19808 states and 36714 transitions. [2024-11-09 19:50:17,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:50:17,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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 919 [2024-11-09 19:50:17,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:50:17,389 INFO L225 Difference]: With dead ends: 19808 [2024-11-09 19:50:17,389 INFO L226 Difference]: Without dead ends: 10565 [2024-11-09 19:50:17,398 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-09 19:50:17,398 INFO L432 NwaCegarLoop]: 689 mSDtfsCounter, 405 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:50:17,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 697 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:50:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10565 states. [2024-11-09 19:50:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10565 to 10235. [2024-11-09 19:50:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10235 states, 10234 states have (on average 1.839749853429744) internal successors, (18828), 10234 states have internal predecessors, (18828), 0 states have call successors, (0), 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-09 19:50:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10235 states to 10235 states and 18828 transitions. [2024-11-09 19:50:17,521 INFO L78 Accepts]: Start accepts. Automaton has 10235 states and 18828 transitions. Word has length 919 [2024-11-09 19:50:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:50:17,522 INFO L471 AbstractCegarLoop]: Abstraction has 10235 states and 18828 transitions. [2024-11-09 19:50:17,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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-09 19:50:17,523 INFO L276 IsEmpty]: Start isEmpty. Operand 10235 states and 18828 transitions. [2024-11-09 19:50:17,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1237 [2024-11-09 19:50:17,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:50:17,545 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:50:17,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:50:17,545 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:50:17,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:50:17,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1705796503, now seen corresponding path program 1 times [2024-11-09 19:50:17,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:50:17,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133275282] [2024-11-09 19:50:17,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:50:17,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:50:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:50:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2895 backedges. 2018 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2024-11-09 19:50:18,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:50:18,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133275282] [2024-11-09 19:50:18,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133275282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:50:18,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:50:18,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:50:18,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948162192] [2024-11-09 19:50:18,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:50:18,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:50:18,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:50:18,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:50:18,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:50:18,605 INFO L87 Difference]: Start difference. First operand 10235 states and 18828 transitions. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 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-09 19:50:19,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:50:19,857 INFO L93 Difference]: Finished difference Result 23108 states and 42656 transitions. [2024-11-09 19:50:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:50:19,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 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 1236 [2024-11-09 19:50:19,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:50:19,879 INFO L225 Difference]: With dead ends: 23108 [2024-11-09 19:50:19,879 INFO L226 Difference]: Without dead ends: 13205 [2024-11-09 19:50:19,889 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-09 19:50:19,890 INFO L432 NwaCegarLoop]: 692 mSDtfsCounter, 482 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:50:19,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 700 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:50:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13205 states. [2024-11-09 19:50:20,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13205 to 12545. [2024-11-09 19:50:20,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12545 states, 12544 states have (on average 1.8349808673469388) internal successors, (23018), 12544 states have internal predecessors, (23018), 0 states have call successors, (0), 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-09 19:50:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12545 states to 12545 states and 23018 transitions. [2024-11-09 19:50:20,047 INFO L78 Accepts]: Start accepts. Automaton has 12545 states and 23018 transitions. Word has length 1236 [2024-11-09 19:50:20,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:50:20,047 INFO L471 AbstractCegarLoop]: Abstraction has 12545 states and 23018 transitions. [2024-11-09 19:50:20,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 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-09 19:50:20,048 INFO L276 IsEmpty]: Start isEmpty. Operand 12545 states and 23018 transitions. [2024-11-09 19:50:20,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1238 [2024-11-09 19:50:20,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:50:20,073 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:50:20,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:50:20,073 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:50:20,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:50:20,074 INFO L85 PathProgramCache]: Analyzing trace with hash -703814721, now seen corresponding path program 1 times [2024-11-09 19:50:20,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:50:20,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096770193] [2024-11-09 19:50:20,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:50:20,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:50:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:50:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2901 backedges. 1073 proven. 0 refuted. 0 times theorem prover too weak. 1828 trivial. 0 not checked. [2024-11-09 19:50:20,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:50:20,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096770193] [2024-11-09 19:50:20,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096770193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:50:20,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:50:20,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:50:20,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523861107] [2024-11-09 19:50:20,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:50:20,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:50:20,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:50:20,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:50:20,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:50:20,913 INFO L87 Difference]: Start difference. First operand 12545 states and 23018 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 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-09 19:50:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:50:22,049 INFO L93 Difference]: Finished difference Result 27065 states and 49689 transitions. [2024-11-09 19:50:22,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:50:22,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 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) Word has length 1237 [2024-11-09 19:50:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:50:22,051 INFO L225 Difference]: With dead ends: 27065 [2024-11-09 19:50:22,051 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:50:22,066 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-09 19:50:22,067 INFO L432 NwaCegarLoop]: 668 mSDtfsCounter, 432 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:50:22,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 674 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:50:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:50:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:50:22,068 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-09 19:50:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:50:22,069 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1237 [2024-11-09 19:50:22,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:50:22,069 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:50:22,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 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-09 19:50:22,069 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:50:22,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:50:22,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:50:22,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:50:22,076 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:50:22,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:50:22,343 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:50:22,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:50:22 BoogieIcfgContainer [2024-11-09 19:50:22,358 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:50:22,358 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:50:22,358 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:50:22,359 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:50:22,359 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:49:54" (3/4) ... [2024-11-09 19:50:22,361 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:50:22,401 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-09 19:50:22,405 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:50:22,409 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:50:22,412 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:50:22,677 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:50:22,677 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:50:22,677 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:50:22,678 INFO L158 Benchmark]: Toolchain (without parser) took 32207.30ms. Allocated memory was 138.4MB in the beginning and 708.8MB in the end (delta: 570.4MB). Free memory was 59.9MB in the beginning and 334.4MB in the end (delta: -274.5MB). Peak memory consumption was 296.1MB. Max. memory is 16.1GB. [2024-11-09 19:50:22,678 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 138.4MB. Free memory was 98.0MB in the beginning and 97.7MB in the end (delta: 283.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:50:22,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 873.59ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 59.9MB in the beginning and 98.7MB in the end (delta: -38.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-09 19:50:22,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 159.22ms. Allocated memory is still 186.6MB. Free memory was 98.7MB in the beginning and 74.4MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 19:50:22,679 INFO L158 Benchmark]: Boogie Preprocessor took 263.16ms. Allocated memory is still 186.6MB. Free memory was 74.4MB in the beginning and 125.1MB in the end (delta: -50.7MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2024-11-09 19:50:22,680 INFO L158 Benchmark]: IcfgBuilder took 2699.69ms. Allocated memory was 186.6MB in the beginning and 272.6MB in the end (delta: 86.0MB). Free memory was 125.1MB in the beginning and 138.4MB in the end (delta: -13.3MB). Peak memory consumption was 115.7MB. Max. memory is 16.1GB. [2024-11-09 19:50:22,680 INFO L158 Benchmark]: TraceAbstraction took 27885.97ms. Allocated memory was 272.6MB in the beginning and 708.8MB in the end (delta: 436.2MB). Free memory was 138.4MB in the beginning and 377.4MB in the end (delta: -239.0MB). Peak memory consumption was 196.2MB. Max. memory is 16.1GB. [2024-11-09 19:50:22,681 INFO L158 Benchmark]: Witness Printer took 319.06ms. Allocated memory is still 708.8MB. Free memory was 377.4MB in the beginning and 334.4MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-09 19:50:22,682 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.22ms. Allocated memory is still 138.4MB. Free memory was 98.0MB in the beginning and 97.7MB in the end (delta: 283.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 873.59ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 59.9MB in the beginning and 98.7MB in the end (delta: -38.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 159.22ms. Allocated memory is still 186.6MB. Free memory was 98.7MB in the beginning and 74.4MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 263.16ms. Allocated memory is still 186.6MB. Free memory was 74.4MB in the beginning and 125.1MB in the end (delta: -50.7MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * IcfgBuilder took 2699.69ms. Allocated memory was 186.6MB in the beginning and 272.6MB in the end (delta: 86.0MB). Free memory was 125.1MB in the beginning and 138.4MB in the end (delta: -13.3MB). Peak memory consumption was 115.7MB. Max. memory is 16.1GB. * TraceAbstraction took 27885.97ms. Allocated memory was 272.6MB in the beginning and 708.8MB in the end (delta: 436.2MB). Free memory was 138.4MB in the beginning and 377.4MB in the end (delta: -239.0MB). Peak memory consumption was 196.2MB. Max. memory is 16.1GB. * Witness Printer took 319.06ms. Allocated memory is still 708.8MB. Free memory was 377.4MB in the beginning and 334.4MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. 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: 137]: 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, 399 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.5s, OverallIterations: 12, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5998 SdHoareTripleChecker+Valid, 18.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5998 mSDsluCounter, 4853 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 173 mSDsCounter, 2443 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18830 IncrementalHoareTripleChecker+Invalid, 21273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2443 mSolverCounterUnsat, 4680 mSDtfsCounter, 18830 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12545occurred in iteration=11, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 2310 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 6648 NumberOfCodeBlocks, 6648 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 6636 ConstructedInterpolants, 0 QuantifiedInterpolants, 14174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 10509/10509 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: 1783]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:50:22,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE