./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label54.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label54.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 a6fe2492e6625b8197ec02c92b2531b1f71f91a1bb5aa875b34eccb40967800d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:55:12,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:55:12,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:55:12,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:55:12,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:55:12,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:55:12,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:55:12,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:55:12,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:55:12,488 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:55:12,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:55:12,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:55:12,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:55:12,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:55:12,489 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:55:12,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:55:12,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:55:12,490 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:55:12,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:55:12,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:55:12,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:55:12,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:55:12,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:55:12,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:55:12,493 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:55:12,493 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:55:12,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:55:12,493 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:55:12,494 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:55:12,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:55:12,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:55:12,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:55:12,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:55:12,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:55:12,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:55:12,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:55:12,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:55:12,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:55:12,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:55:12,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:55:12,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:55:12,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:55:12,496 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-clean/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-clean/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 -> a6fe2492e6625b8197ec02c92b2531b1f71f91a1bb5aa875b34eccb40967800d [2024-10-10 23:55:12,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:55:12,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:55:12,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:55:12,741 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:55:12,742 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:55:12,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label54.c [2024-10-10 23:55:14,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:55:14,508 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:55:14,509 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label54.c [2024-10-10 23:55:14,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5e2d92f62/2908690b8def45b59e773f91ae8625f5/FLAGb63b77a0d [2024-10-10 23:55:14,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5e2d92f62/2908690b8def45b59e773f91ae8625f5 [2024-10-10 23:55:14,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:55:14,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:55:14,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:55:14,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:55:14,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:55:14,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:55:14" (1/1) ... [2024-10-10 23:55:14,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ccb60f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:14, skipping insertion in model container [2024-10-10 23:55:14,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:55:14" (1/1) ... [2024-10-10 23:55:14,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:55:15,043 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label54.c[3783,3796] [2024-10-10 23:55:15,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:55:15,511 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:55:15,529 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label54.c[3783,3796] [2024-10-10 23:55:15,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:55:15,870 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:55:15,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:15 WrapperNode [2024-10-10 23:55:15,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:55:15,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:55:15,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:55:15,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:55:15,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:15" (1/1) ... [2024-10-10 23:55:15,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:15" (1/1) ... [2024-10-10 23:55:16,042 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4135 [2024-10-10 23:55:16,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:55:16,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:55:16,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:55:16,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:55:16,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:15" (1/1) ... [2024-10-10 23:55:16,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:15" (1/1) ... [2024-10-10 23:55:16,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:15" (1/1) ... [2024-10-10 23:55:16,138 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:55:16,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:15" (1/1) ... [2024-10-10 23:55:16,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:15" (1/1) ... [2024-10-10 23:55:16,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:15" (1/1) ... [2024-10-10 23:55:16,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:15" (1/1) ... [2024-10-10 23:55:16,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:15" (1/1) ... [2024-10-10 23:55:16,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:15" (1/1) ... [2024-10-10 23:55:16,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:55:16,361 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:55:16,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:55:16,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:55:16,362 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:15" (1/1) ... [2024-10-10 23:55:16,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:55:16,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:55:16,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:55:16,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:55:16,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:55:16,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:55:16,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:55:16,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:55:16,534 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:55:16,536 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:55:19,107 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2024-10-10 23:55:19,107 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:55:19,147 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:55:19,148 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:55:19,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:55:19 BoogieIcfgContainer [2024-10-10 23:55:19,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:55:19,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:55:19,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:55:19,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:55:19,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:55:14" (1/3) ... [2024-10-10 23:55:19,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db7125b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:55:19, skipping insertion in model container [2024-10-10 23:55:19,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:15" (2/3) ... [2024-10-10 23:55:19,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db7125b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:55:19, skipping insertion in model container [2024-10-10 23:55:19,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:55:19" (3/3) ... [2024-10-10 23:55:19,154 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label54.c [2024-10-10 23:55:19,166 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:55:19,166 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:55:19,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:55:19,226 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;@7c8fb5a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:55:19,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:55:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 695 states, 693 states have (on average 1.9942279942279941) internal successors, (1382), 694 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-10 23:55:19,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:19,236 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] [2024-10-10 23:55:19,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:19,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:19,240 INFO L85 PathProgramCache]: Analyzing trace with hash 57125706, now seen corresponding path program 1 times [2024-10-10 23:55:19,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:19,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287891921] [2024-10-10 23:55:19,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:19,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:19,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:55:19,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:19,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287891921] [2024-10-10 23:55:19,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287891921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:19,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:19,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:55:19,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479031776] [2024-10-10 23:55:19,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:19,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:55:19,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:19,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:55:19,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:55:19,390 INFO L87 Difference]: Start difference. First operand has 695 states, 693 states have (on average 1.9942279942279941) internal successors, (1382), 694 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:19,456 INFO L93 Difference]: Finished difference Result 1389 states and 2763 transitions. [2024-10-10 23:55:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:55:19,458 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-10-10 23:55:19,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:19,470 INFO L225 Difference]: With dead ends: 1389 [2024-10-10 23:55:19,470 INFO L226 Difference]: Without dead ends: 693 [2024-10-10 23:55:19,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:55:19,480 INFO L432 NwaCegarLoop]: 1317 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:19,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1317 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:55:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-10 23:55:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2024-10-10 23:55:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.903179190751445) internal successors, (1317), 692 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1317 transitions. [2024-10-10 23:55:19,554 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1317 transitions. Word has length 33 [2024-10-10 23:55:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:19,556 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1317 transitions. [2024-10-10 23:55:19,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:19,556 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1317 transitions. [2024-10-10 23:55:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-10 23:55:19,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:19,557 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] [2024-10-10 23:55:19,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:55:19,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:19,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:19,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1644818452, now seen corresponding path program 1 times [2024-10-10 23:55:19,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:19,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533711603] [2024-10-10 23:55:19,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:19,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:19,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:55:19,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:19,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533711603] [2024-10-10 23:55:19,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533711603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:19,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:19,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:55:19,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480492028] [2024-10-10 23:55:19,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:19,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:19,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:19,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:19,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:19,716 INFO L87 Difference]: Start difference. First operand 693 states and 1317 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:22,366 INFO L93 Difference]: Finished difference Result 2075 states and 3948 transitions. [2024-10-10 23:55:22,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:22,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-10-10 23:55:22,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:22,372 INFO L225 Difference]: With dead ends: 2075 [2024-10-10 23:55:22,372 INFO L226 Difference]: Without dead ends: 1383 [2024-10-10 23:55:22,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:22,375 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 678 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:22,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 465 Invalid, 2623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2106 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:55:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-10-10 23:55:22,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2024-10-10 23:55:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1382 states have (on average 1.5781476121562952) internal successors, (2181), 1382 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2181 transitions. [2024-10-10 23:55:22,401 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2181 transitions. Word has length 33 [2024-10-10 23:55:22,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:22,402 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 2181 transitions. [2024-10-10 23:55:22,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2181 transitions. [2024-10-10 23:55:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-10 23:55:22,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:22,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:55:22,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:55:22,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:22,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:22,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1036875069, now seen corresponding path program 1 times [2024-10-10 23:55:22,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:22,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502049877] [2024-10-10 23:55:22,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:22,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:55:22,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:22,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502049877] [2024-10-10 23:55:22,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502049877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:22,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:22,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:55:22,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355568231] [2024-10-10 23:55:22,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:22,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:22,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:22,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:22,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:22,530 INFO L87 Difference]: Start difference. First operand 1383 states and 2181 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:25,371 INFO L93 Difference]: Finished difference Result 4145 states and 6540 transitions. [2024-10-10 23:55:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:25,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-10-10 23:55:25,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:25,380 INFO L225 Difference]: With dead ends: 4145 [2024-10-10 23:55:25,380 INFO L226 Difference]: Without dead ends: 2763 [2024-10-10 23:55:25,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:25,383 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 713 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 2620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:25,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 527 Invalid, 2620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:55:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2024-10-10 23:55:25,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763. [2024-10-10 23:55:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.3482983345401882) internal successors, (3724), 2762 states have internal predecessors, (3724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 3724 transitions. [2024-10-10 23:55:25,434 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 3724 transitions. Word has length 99 [2024-10-10 23:55:25,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:25,436 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 3724 transitions. [2024-10-10 23:55:25,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:25,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 3724 transitions. [2024-10-10 23:55:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-10 23:55:25,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:25,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:55:25,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:55:25,443 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:25,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:25,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1557600459, now seen corresponding path program 1 times [2024-10-10 23:55:25,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:25,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717122367] [2024-10-10 23:55:25,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:25,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:55:25,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:25,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717122367] [2024-10-10 23:55:25,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717122367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:25,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:25,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:55:25,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859676853] [2024-10-10 23:55:25,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:25,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:25,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:25,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:25,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:25,573 INFO L87 Difference]: Start difference. First operand 2763 states and 3724 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:27,714 INFO L93 Difference]: Finished difference Result 8285 states and 11169 transitions. [2024-10-10 23:55:27,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:27,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-10-10 23:55:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:27,745 INFO L225 Difference]: With dead ends: 8285 [2024-10-10 23:55:27,745 INFO L226 Difference]: Without dead ends: 5523 [2024-10-10 23:55:27,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:27,752 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 688 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:27,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 433 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:55:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5523 states. [2024-10-10 23:55:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5523 to 5523. [2024-10-10 23:55:27,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5523 states, 5522 states have (on average 1.2296269467584209) internal successors, (6790), 5522 states have internal predecessors, (6790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:27,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5523 states to 5523 states and 6790 transitions. [2024-10-10 23:55:27,823 INFO L78 Accepts]: Start accepts. Automaton has 5523 states and 6790 transitions. Word has length 119 [2024-10-10 23:55:27,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:27,825 INFO L471 AbstractCegarLoop]: Abstraction has 5523 states and 6790 transitions. [2024-10-10 23:55:27,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 5523 states and 6790 transitions. [2024-10-10 23:55:27,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-10 23:55:27,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:27,829 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:55:27,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:55:27,829 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:27,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:27,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1805656097, now seen corresponding path program 1 times [2024-10-10 23:55:27,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:27,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973112978] [2024-10-10 23:55:27,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:27,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-10 23:55:28,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:28,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973112978] [2024-10-10 23:55:28,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973112978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:28,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:28,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:55:28,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362574060] [2024-10-10 23:55:28,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:28,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:55:28,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:28,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:55:28,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:55:28,272 INFO L87 Difference]: Start difference. First operand 5523 states and 6790 transitions. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:31,236 INFO L93 Difference]: Finished difference Result 12425 states and 15031 transitions. [2024-10-10 23:55:31,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:55:31,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2024-10-10 23:55:31,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:31,253 INFO L225 Difference]: With dead ends: 12425 [2024-10-10 23:55:31,253 INFO L226 Difference]: Without dead ends: 6903 [2024-10-10 23:55:31,259 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-10-10 23:55:31,260 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 1873 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4085 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 4113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:31,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 638 Invalid, 4113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4085 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:55:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6903 states. [2024-10-10 23:55:31,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6903 to 6903. [2024-10-10 23:55:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6903 states, 6902 states have (on average 1.191538684439293) internal successors, (8224), 6902 states have internal predecessors, (8224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6903 states to 6903 states and 8224 transitions. [2024-10-10 23:55:31,337 INFO L78 Accepts]: Start accepts. Automaton has 6903 states and 8224 transitions. Word has length 220 [2024-10-10 23:55:31,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:31,337 INFO L471 AbstractCegarLoop]: Abstraction has 6903 states and 8224 transitions. [2024-10-10 23:55:31,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 6903 states and 8224 transitions. [2024-10-10 23:55:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-10-10 23:55:31,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:31,342 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:55:31,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:55:31,342 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:31,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:31,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1642443336, now seen corresponding path program 1 times [2024-10-10 23:55:31,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:31,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465737193] [2024-10-10 23:55:31,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:31,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-10 23:55:31,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:31,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465737193] [2024-10-10 23:55:31,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465737193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:31,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:31,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:55:31,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422573296] [2024-10-10 23:55:31,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:31,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:55:31,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:31,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:55:31,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:55:31,800 INFO L87 Difference]: Start difference. First operand 6903 states and 8224 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:34,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:34,034 INFO L93 Difference]: Finished difference Result 15928 states and 18630 transitions. [2024-10-10 23:55:34,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:55:34,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 402 [2024-10-10 23:55:34,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:34,061 INFO L225 Difference]: With dead ends: 15928 [2024-10-10 23:55:34,062 INFO L226 Difference]: Without dead ends: 8973 [2024-10-10 23:55:34,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:55:34,071 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 529 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 2972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:34,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 634 Invalid, 2972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:55:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8973 states. [2024-10-10 23:55:34,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8973 to 8973. [2024-10-10 23:55:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8973 states, 8972 states have (on average 1.1158047258136425) internal successors, (10011), 8972 states have internal predecessors, (10011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8973 states to 8973 states and 10011 transitions. [2024-10-10 23:55:34,175 INFO L78 Accepts]: Start accepts. Automaton has 8973 states and 10011 transitions. Word has length 402 [2024-10-10 23:55:34,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:34,175 INFO L471 AbstractCegarLoop]: Abstraction has 8973 states and 10011 transitions. [2024-10-10 23:55:34,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:34,176 INFO L276 IsEmpty]: Start isEmpty. Operand 8973 states and 10011 transitions. [2024-10-10 23:55:34,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2024-10-10 23:55:34,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:34,179 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:55:34,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:55:34,180 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:34,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:34,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1490248099, now seen corresponding path program 1 times [2024-10-10 23:55:34,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:34,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573768797] [2024-10-10 23:55:34,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:34,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-10-10 23:55:34,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:34,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573768797] [2024-10-10 23:55:34,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573768797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:34,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:34,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:55:34,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809791203] [2024-10-10 23:55:34,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:34,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:34,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:34,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:34,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:34,475 INFO L87 Difference]: Start difference. First operand 8973 states and 10011 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:36,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:36,691 INFO L93 Difference]: Finished difference Result 21395 states and 24223 transitions. [2024-10-10 23:55:36,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:36,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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 418 [2024-10-10 23:55:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:36,722 INFO L225 Difference]: With dead ends: 21395 [2024-10-10 23:55:36,722 INFO L226 Difference]: Without dead ends: 12423 [2024-10-10 23:55:36,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:36,739 INFO L432 NwaCegarLoop]: 1110 mSDtfsCounter, 659 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:36,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1116 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:55:36,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12423 states. [2024-10-10 23:55:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12423 to 12423. [2024-10-10 23:55:36,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12423 states, 12422 states have (on average 1.098212848172597) internal successors, (13642), 12422 states have internal predecessors, (13642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12423 states to 12423 states and 13642 transitions. [2024-10-10 23:55:36,976 INFO L78 Accepts]: Start accepts. Automaton has 12423 states and 13642 transitions. Word has length 418 [2024-10-10 23:55:36,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:36,977 INFO L471 AbstractCegarLoop]: Abstraction has 12423 states and 13642 transitions. [2024-10-10 23:55:36,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 12423 states and 13642 transitions. [2024-10-10 23:55:36,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2024-10-10 23:55:36,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:36,982 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:55:36,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:55:36,983 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:36,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:36,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1287540008, now seen corresponding path program 1 times [2024-10-10 23:55:36,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:36,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865718216] [2024-10-10 23:55:36,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:36,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:55:37,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:37,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865718216] [2024-10-10 23:55:37,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865718216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:37,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:37,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:55:37,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307927277] [2024-10-10 23:55:37,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:37,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:37,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:37,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:37,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:37,353 INFO L87 Difference]: Start difference. First operand 12423 states and 13642 transitions. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:39,385 INFO L93 Difference]: Finished difference Result 33815 states and 37394 transitions. [2024-10-10 23:55:39,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:39,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 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 425 [2024-10-10 23:55:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:39,416 INFO L225 Difference]: With dead ends: 33815 [2024-10-10 23:55:39,417 INFO L226 Difference]: Without dead ends: 21393 [2024-10-10 23:55:39,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:39,429 INFO L432 NwaCegarLoop]: 970 mSDtfsCounter, 600 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:39,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 976 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:55:39,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21393 states. [2024-10-10 23:55:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21393 to 20703. [2024-10-10 23:55:39,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20703 states, 20702 states have (on average 1.0799922712781374) internal successors, (22358), 20702 states have internal predecessors, (22358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:39,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20703 states to 20703 states and 22358 transitions. [2024-10-10 23:55:39,688 INFO L78 Accepts]: Start accepts. Automaton has 20703 states and 22358 transitions. Word has length 425 [2024-10-10 23:55:39,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:39,688 INFO L471 AbstractCegarLoop]: Abstraction has 20703 states and 22358 transitions. [2024-10-10 23:55:39,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:39,689 INFO L276 IsEmpty]: Start isEmpty. Operand 20703 states and 22358 transitions. [2024-10-10 23:55:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2024-10-10 23:55:39,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:39,694 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:55:39,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:55:39,694 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:39,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:39,695 INFO L85 PathProgramCache]: Analyzing trace with hash 789484855, now seen corresponding path program 1 times [2024-10-10 23:55:39,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:39,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836450108] [2024-10-10 23:55:39,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:39,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-10 23:55:39,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:39,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836450108] [2024-10-10 23:55:39,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836450108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:39,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:39,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:55:39,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125428059] [2024-10-10 23:55:39,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:39,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:39,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:39,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:39,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:39,894 INFO L87 Difference]: Start difference. First operand 20703 states and 22358 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:41,942 INFO L93 Difference]: Finished difference Result 45545 states and 49881 transitions. [2024-10-10 23:55:41,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:41,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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 432 [2024-10-10 23:55:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:41,976 INFO L225 Difference]: With dead ends: 45545 [2024-10-10 23:55:41,976 INFO L226 Difference]: Without dead ends: 22773 [2024-10-10 23:55:41,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:41,993 INFO L432 NwaCegarLoop]: 1111 mSDtfsCounter, 670 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:41,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1117 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 1722 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:55:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22773 states. [2024-10-10 23:55:42,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22773 to 20013. [2024-10-10 23:55:42,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20013 states, 20012 states have (on average 1.0525684589246451) internal successors, (21064), 20012 states have internal predecessors, (21064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20013 states to 20013 states and 21064 transitions. [2024-10-10 23:55:42,218 INFO L78 Accepts]: Start accepts. Automaton has 20013 states and 21064 transitions. Word has length 432 [2024-10-10 23:55:42,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:42,218 INFO L471 AbstractCegarLoop]: Abstraction has 20013 states and 21064 transitions. [2024-10-10 23:55:42,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:42,219 INFO L276 IsEmpty]: Start isEmpty. Operand 20013 states and 21064 transitions. [2024-10-10 23:55:42,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2024-10-10 23:55:42,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:42,224 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:55:42,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:55:42,225 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:42,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:42,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1046585067, now seen corresponding path program 1 times [2024-10-10 23:55:42,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:42,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480515592] [2024-10-10 23:55:42,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:42,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2024-10-10 23:55:42,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:42,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480515592] [2024-10-10 23:55:42,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480515592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:42,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:42,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:55:42,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009853092] [2024-10-10 23:55:42,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:42,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:42,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:42,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:42,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:42,478 INFO L87 Difference]: Start difference. First operand 20013 states and 21064 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:44,148 INFO L93 Difference]: Finished difference Result 43475 states and 46142 transitions. [2024-10-10 23:55:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:44,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 503 [2024-10-10 23:55:44,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:44,176 INFO L225 Difference]: With dead ends: 43475 [2024-10-10 23:55:44,176 INFO L226 Difference]: Without dead ends: 21393 [2024-10-10 23:55:44,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:44,189 INFO L432 NwaCegarLoop]: 927 mSDtfsCounter, 676 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:44,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 933 Invalid, 1960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:55:44,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21393 states. [2024-10-10 23:55:44,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21393 to 21393. [2024-10-10 23:55:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21393 states, 21392 states have (on average 1.0519353029169782) internal successors, (22503), 21392 states have internal predecessors, (22503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:44,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21393 states to 21393 states and 22503 transitions. [2024-10-10 23:55:44,350 INFO L78 Accepts]: Start accepts. Automaton has 21393 states and 22503 transitions. Word has length 503 [2024-10-10 23:55:44,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:44,351 INFO L471 AbstractCegarLoop]: Abstraction has 21393 states and 22503 transitions. [2024-10-10 23:55:44,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:44,351 INFO L276 IsEmpty]: Start isEmpty. Operand 21393 states and 22503 transitions. [2024-10-10 23:55:44,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2024-10-10 23:55:44,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:44,358 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:55:44,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:55:44,358 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:44,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:44,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1632495905, now seen corresponding path program 1 times [2024-10-10 23:55:44,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:44,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295219856] [2024-10-10 23:55:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:44,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2024-10-10 23:55:44,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:44,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295219856] [2024-10-10 23:55:44,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295219856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:44,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:44,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:55:44,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238713926] [2024-10-10 23:55:44,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:44,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:44,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:44,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:44,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:44,759 INFO L87 Difference]: Start difference. First operand 21393 states and 22503 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:46,524 INFO L93 Difference]: Finished difference Result 49685 states and 52689 transitions. [2024-10-10 23:55:46,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:46,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 666 [2024-10-10 23:55:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:46,560 INFO L225 Difference]: With dead ends: 49685 [2024-10-10 23:55:46,561 INFO L226 Difference]: Without dead ends: 28293 [2024-10-10 23:55:46,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:46,578 INFO L432 NwaCegarLoop]: 845 mSDtfsCounter, 696 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:46,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 851 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:55:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28293 states. [2024-10-10 23:55:46,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28293 to 28293. [2024-10-10 23:55:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28293 states, 28292 states have (on average 1.0511098543757953) internal successors, (29738), 28292 states have internal predecessors, (29738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28293 states to 28293 states and 29738 transitions. [2024-10-10 23:55:46,824 INFO L78 Accepts]: Start accepts. Automaton has 28293 states and 29738 transitions. Word has length 666 [2024-10-10 23:55:46,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:46,825 INFO L471 AbstractCegarLoop]: Abstraction has 28293 states and 29738 transitions. [2024-10-10 23:55:46,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 28293 states and 29738 transitions. [2024-10-10 23:55:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2024-10-10 23:55:46,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:46,833 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:55:46,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:55:46,834 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:46,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:46,834 INFO L85 PathProgramCache]: Analyzing trace with hash 619751381, now seen corresponding path program 1 times [2024-10-10 23:55:46,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:46,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627826075] [2024-10-10 23:55:46,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:46,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 746 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-10 23:55:47,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:47,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627826075] [2024-10-10 23:55:47,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627826075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:47,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:47,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:55:47,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451386917] [2024-10-10 23:55:47,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:47,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:47,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:47,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:47,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:47,325 INFO L87 Difference]: Start difference. First operand 28293 states and 29738 transitions. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:49,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:49,258 INFO L93 Difference]: Finished difference Result 66245 states and 70050 transitions. [2024-10-10 23:55:49,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:49,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 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 708 [2024-10-10 23:55:49,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:49,297 INFO L225 Difference]: With dead ends: 66245 [2024-10-10 23:55:49,297 INFO L226 Difference]: Without dead ends: 37953 [2024-10-10 23:55:49,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:49,320 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 602 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:49,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 273 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1813 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:55:49,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37953 states. [2024-10-10 23:55:49,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37953 to 37263. [2024-10-10 23:55:49,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37263 states, 37262 states have (on average 1.047823519939885) internal successors, (39044), 37262 states have internal predecessors, (39044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37263 states to 37263 states and 39044 transitions. [2024-10-10 23:55:49,634 INFO L78 Accepts]: Start accepts. Automaton has 37263 states and 39044 transitions. Word has length 708 [2024-10-10 23:55:49,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:49,635 INFO L471 AbstractCegarLoop]: Abstraction has 37263 states and 39044 transitions. [2024-10-10 23:55:49,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 37263 states and 39044 transitions. [2024-10-10 23:55:49,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1225 [2024-10-10 23:55:49,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:49,648 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:55:49,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:55:49,648 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:49,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:49,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1151256496, now seen corresponding path program 1 times [2024-10-10 23:55:49,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:49,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156785331] [2024-10-10 23:55:49,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:49,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1707 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 1516 trivial. 0 not checked. [2024-10-10 23:55:50,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:50,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156785331] [2024-10-10 23:55:50,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156785331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:50,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:50,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:55:50,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50570674] [2024-10-10 23:55:50,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:50,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:50,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:50,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:50,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:50,424 INFO L87 Difference]: Start difference. First operand 37263 states and 39044 transitions. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:51,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:51,426 INFO L93 Difference]: Finished difference Result 73167 states and 76719 transitions. [2024-10-10 23:55:51,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:51,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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 1224 [2024-10-10 23:55:51,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:51,461 INFO L225 Difference]: With dead ends: 73167 [2024-10-10 23:55:51,462 INFO L226 Difference]: Without dead ends: 36573 [2024-10-10 23:55:51,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:51,480 INFO L432 NwaCegarLoop]: 977 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:51,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 983 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:55:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36573 states. [2024-10-10 23:55:51,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36573 to 36573. [2024-10-10 23:55:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36573 states, 36572 states have (on average 1.0481789347041452) internal successors, (38334), 36572 states have internal predecessors, (38334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36573 states to 36573 states and 38334 transitions. [2024-10-10 23:55:51,920 INFO L78 Accepts]: Start accepts. Automaton has 36573 states and 38334 transitions. Word has length 1224 [2024-10-10 23:55:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:51,920 INFO L471 AbstractCegarLoop]: Abstraction has 36573 states and 38334 transitions. [2024-10-10 23:55:51,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 36573 states and 38334 transitions. [2024-10-10 23:55:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1258 [2024-10-10 23:55:51,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:51,934 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:55:51,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:55:51,934 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:51,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:51,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1772936002, now seen corresponding path program 1 times [2024-10-10 23:55:51,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:51,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265567397] [2024-10-10 23:55:51,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:51,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 807 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2024-10-10 23:55:52,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:52,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265567397] [2024-10-10 23:55:52,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265567397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:52,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:52,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:55:52,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089994806] [2024-10-10 23:55:52,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:52,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:52,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:52,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:52,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:52,661 INFO L87 Difference]: Start difference. First operand 36573 states and 38334 transitions. Second operand has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:54,443 INFO L93 Difference]: Finished difference Result 82805 states and 87210 transitions. [2024-10-10 23:55:54,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:54,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 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 1257 [2024-10-10 23:55:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:54,503 INFO L225 Difference]: With dead ends: 82805 [2024-10-10 23:55:54,504 INFO L226 Difference]: Without dead ends: 46923 [2024-10-10 23:55:54,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:54,532 INFO L432 NwaCegarLoop]: 947 mSDtfsCounter, 452 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:54,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 953 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:55:54,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46923 states. [2024-10-10 23:55:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46923 to 46923. [2024-10-10 23:55:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46923 states, 46922 states have (on average 1.0452879246408935) internal successors, (49047), 46922 states have internal predecessors, (49047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46923 states to 46923 states and 49047 transitions. [2024-10-10 23:55:55,166 INFO L78 Accepts]: Start accepts. Automaton has 46923 states and 49047 transitions. Word has length 1257 [2024-10-10 23:55:55,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:55,170 INFO L471 AbstractCegarLoop]: Abstraction has 46923 states and 49047 transitions. [2024-10-10 23:55:55,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:55:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 46923 states and 49047 transitions. [2024-10-10 23:55:55,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1287 [2024-10-10 23:55:55,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:55,217 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:55:55,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:55:55,218 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:55,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:55,218 INFO L85 PathProgramCache]: Analyzing trace with hash 703191968, now seen corresponding path program 1 times [2024-10-10 23:55:55,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:55,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285400459] [2024-10-10 23:55:55,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:55,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 1167 proven. 330 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2024-10-10 23:55:57,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:57,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285400459] [2024-10-10 23:55:57,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285400459] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:55:57,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436476499] [2024-10-10 23:55:57,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:57,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:55:57,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:55:57,716 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:55:57,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:55:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:58,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:55:58,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:55:58,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 1535 trivial. 0 not checked. [2024-10-10 23:55:58,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:55:58,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436476499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:58,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:55:58,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-10 23:55:58,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121315426] [2024-10-10 23:55:58,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:58,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:58,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:58,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:58,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:55:58,228 INFO L87 Difference]: Start difference. First operand 46923 states and 49047 transitions. Second operand has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:00,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:56:00,107 INFO L93 Difference]: Finished difference Result 92465 states and 96688 transitions. [2024-10-10 23:56:00,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:56:00,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 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 1286 [2024-10-10 23:56:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:56:00,162 INFO L225 Difference]: With dead ends: 92465 [2024-10-10 23:56:00,162 INFO L226 Difference]: Without dead ends: 46233 [2024-10-10 23:56:00,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1292 GetRequests, 1285 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:56:00,197 INFO L432 NwaCegarLoop]: 878 mSDtfsCounter, 725 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:56:00,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 884 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:56:00,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46233 states. [2024-10-10 23:56:00,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46233 to 44853. [2024-10-10 23:56:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44853 states, 44852 states have (on average 1.029006510300544) internal successors, (46153), 44852 states have internal predecessors, (46153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44853 states to 44853 states and 46153 transitions. [2024-10-10 23:56:00,685 INFO L78 Accepts]: Start accepts. Automaton has 44853 states and 46153 transitions. Word has length 1286 [2024-10-10 23:56:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:56:00,686 INFO L471 AbstractCegarLoop]: Abstraction has 44853 states and 46153 transitions. [2024-10-10 23:56:00,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 44853 states and 46153 transitions. [2024-10-10 23:56:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1371 [2024-10-10 23:56:00,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:56:00,703 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:56:00,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 23:56:00,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-10 23:56:00,905 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:56:00,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:56:00,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2012092420, now seen corresponding path program 1 times [2024-10-10 23:56:00,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:56:00,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611480548] [2024-10-10 23:56:00,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:56:00,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:56:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:56:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 1444 proven. 0 refuted. 0 times theorem prover too weak. 701 trivial. 0 not checked. [2024-10-10 23:56:02,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:56:02,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611480548] [2024-10-10 23:56:02,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611480548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:56:02,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:56:02,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:56:02,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500743491] [2024-10-10 23:56:02,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:56:02,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:56:02,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:56:02,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:56:02,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:56:02,103 INFO L87 Difference]: Start difference. First operand 44853 states and 46153 transitions. Second operand has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:56:04,594 INFO L93 Difference]: Finished difference Result 89015 states and 91614 transitions. [2024-10-10 23:56:04,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:56:04,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 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 1370 [2024-10-10 23:56:04,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:56:04,647 INFO L225 Difference]: With dead ends: 89015 [2024-10-10 23:56:04,647 INFO L226 Difference]: Without dead ends: 44853 [2024-10-10 23:56:04,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:56:04,678 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 763 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2674 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 2742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:56:04,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 256 Invalid, 2742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2674 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:56:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44853 states. [2024-10-10 23:56:05,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44853 to 44853. [2024-10-10 23:56:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44853 states, 44852 states have (on average 1.0289842147507358) internal successors, (46152), 44852 states have internal predecessors, (46152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:05,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44853 states to 44853 states and 46152 transitions. [2024-10-10 23:56:05,188 INFO L78 Accepts]: Start accepts. Automaton has 44853 states and 46152 transitions. Word has length 1370 [2024-10-10 23:56:05,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:56:05,189 INFO L471 AbstractCegarLoop]: Abstraction has 44853 states and 46152 transitions. [2024-10-10 23:56:05,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 44853 states and 46152 transitions. [2024-10-10 23:56:05,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1450 [2024-10-10 23:56:05,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:56:05,406 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:56:05,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:56:05,406 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:56:05,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:56:05,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1961379842, now seen corresponding path program 1 times [2024-10-10 23:56:05,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:56:05,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487410653] [2024-10-10 23:56:05,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:56:05,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:56:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:56:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2683 backedges. 685 proven. 246 refuted. 0 times theorem prover too weak. 1752 trivial. 0 not checked. [2024-10-10 23:56:06,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:56:06,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487410653] [2024-10-10 23:56:06,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487410653] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:56:06,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752276982] [2024-10-10 23:56:06,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:56:06,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:56:06,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:56:06,490 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:56:06,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:56:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:56:06,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 1677 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:56:06,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:56:06,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2683 backedges. 726 proven. 0 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2024-10-10 23:56:06,876 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:56:06,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752276982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:56:06,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:56:06,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:56:06,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311486401] [2024-10-10 23:56:06,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:56:06,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:56:06,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:56:06,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:56:06,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:56:06,878 INFO L87 Difference]: Start difference. First operand 44853 states and 46152 transitions. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:56:08,502 INFO L93 Difference]: Finished difference Result 89015 states and 91612 transitions. [2024-10-10 23:56:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:56:08,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 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 1449 [2024-10-10 23:56:08,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:56:08,667 INFO L225 Difference]: With dead ends: 89015 [2024-10-10 23:56:08,667 INFO L226 Difference]: Without dead ends: 44163 [2024-10-10 23:56:08,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1452 GetRequests, 1449 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:56:08,684 INFO L432 NwaCegarLoop]: 798 mSDtfsCounter, 642 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:56:08,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 803 Invalid, 1906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:56:08,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44163 states. [2024-10-10 23:56:08,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44163 to 44163. [2024-10-10 23:56:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44163 states, 44162 states have (on average 1.0244554141569675) internal successors, (45242), 44162 states have internal predecessors, (45242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:09,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44163 states to 44163 states and 45242 transitions. [2024-10-10 23:56:09,035 INFO L78 Accepts]: Start accepts. Automaton has 44163 states and 45242 transitions. Word has length 1449 [2024-10-10 23:56:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:56:09,036 INFO L471 AbstractCegarLoop]: Abstraction has 44163 states and 45242 transitions. [2024-10-10 23:56:09,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 44163 states and 45242 transitions. [2024-10-10 23:56:09,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1489 [2024-10-10 23:56:09,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:56:09,058 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:56:09,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:56:09,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-10 23:56:09,262 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:56:09,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:56:09,263 INFO L85 PathProgramCache]: Analyzing trace with hash -887733118, now seen corresponding path program 1 times [2024-10-10 23:56:09,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:56:09,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98987147] [2024-10-10 23:56:09,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:56:09,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:56:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:56:10,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3220 backedges. 1813 proven. 0 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2024-10-10 23:56:10,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:56:10,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98987147] [2024-10-10 23:56:10,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98987147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:56:10,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:56:10,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:56:10,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129910059] [2024-10-10 23:56:10,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:56:10,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:56:10,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:56:10,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:56:10,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:56:10,336 INFO L87 Difference]: Start difference. First operand 44163 states and 45242 transitions. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:56:12,389 INFO L93 Difference]: Finished difference Result 109715 states and 112582 transitions. [2024-10-10 23:56:12,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:56:12,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 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 1488 [2024-10-10 23:56:12,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:56:12,465 INFO L225 Difference]: With dead ends: 109715 [2024-10-10 23:56:12,465 INFO L226 Difference]: Without dead ends: 65553 [2024-10-10 23:56:12,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:56:12,503 INFO L432 NwaCegarLoop]: 939 mSDtfsCounter, 607 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:56:12,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 945 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:56:12,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65553 states. [2024-10-10 23:56:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65553 to 64863. [2024-10-10 23:56:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64863 states, 64862 states have (on average 1.0197033702321852) internal successors, (66140), 64862 states have internal predecessors, (66140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64863 states to 64863 states and 66140 transitions. [2024-10-10 23:56:13,270 INFO L78 Accepts]: Start accepts. Automaton has 64863 states and 66140 transitions. Word has length 1488 [2024-10-10 23:56:13,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:56:13,271 INFO L471 AbstractCegarLoop]: Abstraction has 64863 states and 66140 transitions. [2024-10-10 23:56:13,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand 64863 states and 66140 transitions. [2024-10-10 23:56:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1645 [2024-10-10 23:56:13,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:56:13,308 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:56:13,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:56:13,308 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:56:13,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:56:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1523842182, now seen corresponding path program 1 times [2024-10-10 23:56:13,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:56:13,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864153962] [2024-10-10 23:56:13,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:56:13,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:56:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:56:14,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2922 backedges. 1286 proven. 0 refuted. 0 times theorem prover too weak. 1636 trivial. 0 not checked. [2024-10-10 23:56:14,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:56:14,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864153962] [2024-10-10 23:56:14,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864153962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:56:14,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:56:14,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:56:14,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376427863] [2024-10-10 23:56:14,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:56:14,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:56:14,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:56:14,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:56:14,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:56:14,362 INFO L87 Difference]: Start difference. First operand 64863 states and 66140 transitions. Second operand has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:56:16,323 INFO L93 Difference]: Finished difference Result 128350 states and 130903 transitions. [2024-10-10 23:56:16,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:56:16,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 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 1644 [2024-10-10 23:56:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:56:16,325 INFO L225 Difference]: With dead ends: 128350 [2024-10-10 23:56:16,325 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:56:16,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:56:16,356 INFO L432 NwaCegarLoop]: 920 mSDtfsCounter, 396 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2399 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 2399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:56:16,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 930 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 2399 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:56:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:56:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:56:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:16,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:56:16,357 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1644 [2024-10-10 23:56:16,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:56:16,357 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:56:16,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:56:16,357 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:56:16,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:56:16,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:56:16,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:56:16,362 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:56:16,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:56:17,122 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:56:17,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:56:17 BoogieIcfgContainer [2024-10-10 23:56:17,144 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:56:17,144 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:56:17,145 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:56:17,145 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:56:17,145 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:55:19" (3/4) ... [2024-10-10 23:56:17,146 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:56:17,190 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-10 23:56:17,194 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:56:17,198 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:56:17,201 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:56:17,445 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:56:17,446 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:56:17,446 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:56:17,446 INFO L158 Benchmark]: Toolchain (without parser) took 62727.84ms. Allocated memory was 138.4MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 56.4MB in the beginning and 6.5GB in the end (delta: -6.5GB). Peak memory consumption was 736.2MB. Max. memory is 16.1GB. [2024-10-10 23:56:17,446 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 138.4MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:56:17,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1150.02ms. Allocated memory was 138.4MB in the beginning and 222.3MB in the end (delta: 83.9MB). Free memory was 56.4MB in the beginning and 160.4MB in the end (delta: -104.0MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2024-10-10 23:56:17,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 171.19ms. Allocated memory is still 222.3MB. Free memory was 160.4MB in the beginning and 117.4MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-10 23:56:17,449 INFO L158 Benchmark]: Boogie Preprocessor took 316.79ms. Allocated memory is still 222.3MB. Free memory was 117.4MB in the beginning and 135.0MB in the end (delta: -17.6MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2024-10-10 23:56:17,450 INFO L158 Benchmark]: RCFGBuilder took 2787.38ms. Allocated memory was 222.3MB in the beginning and 589.3MB in the end (delta: 367.0MB). Free memory was 135.0MB in the beginning and 472.7MB in the end (delta: -337.7MB). Peak memory consumption was 148.8MB. Max. memory is 16.1GB. [2024-10-10 23:56:17,450 INFO L158 Benchmark]: TraceAbstraction took 57994.21ms. Allocated memory was 589.3MB in the beginning and 7.3GB in the end (delta: 6.8GB). Free memory was 471.7MB in the beginning and 6.6GB in the end (delta: -6.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-10 23:56:17,450 INFO L158 Benchmark]: Witness Printer took 301.46ms. Allocated memory is still 7.3GB. Free memory was 6.6GB in the beginning and 6.5GB in the end (delta: 55.6MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-10 23:56:17,451 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.12ms. Allocated memory is still 138.4MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1150.02ms. Allocated memory was 138.4MB in the beginning and 222.3MB in the end (delta: 83.9MB). Free memory was 56.4MB in the beginning and 160.4MB in the end (delta: -104.0MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 171.19ms. Allocated memory is still 222.3MB. Free memory was 160.4MB in the beginning and 117.4MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 316.79ms. Allocated memory is still 222.3MB. Free memory was 117.4MB in the beginning and 135.0MB in the end (delta: -17.6MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. * RCFGBuilder took 2787.38ms. Allocated memory was 222.3MB in the beginning and 589.3MB in the end (delta: 367.0MB). Free memory was 135.0MB in the beginning and 472.7MB in the end (delta: -337.7MB). Peak memory consumption was 148.8MB. Max. memory is 16.1GB. * TraceAbstraction took 57994.21ms. Allocated memory was 589.3MB in the beginning and 7.3GB in the end (delta: 6.8GB). Free memory was 471.7MB in the beginning and 6.6GB in the end (delta: -6.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 301.46ms. Allocated memory is still 7.3GB. Free memory was 6.6GB in the beginning and 6.5GB in the end (delta: 55.6MB). Peak memory consumption was 52.4MB. 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: 121]: 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, 695 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.2s, OverallIterations: 19, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 38.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11969 SdHoareTripleChecker+Valid, 34.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11969 mSDsluCounter, 15034 SdHoareTripleChecker+Invalid, 28.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 5820 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36028 IncrementalHoareTripleChecker+Invalid, 41848 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5820 mSolverCounterUnsat, 14902 mSDtfsCounter, 36028 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2793 GetRequests, 2762 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64863occurred in iteration=18, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 6210 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 16511 NumberOfCodeBlocks, 16511 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 16490 ConstructedInterpolants, 0 QuantifiedInterpolants, 34388 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3143 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 21 InterpolantComputations, 19 PerfectInterpolantSequences, 22560/23136 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: 4269]: Loop Invariant Derived loop invariant: (((((((((((a24 == 3) || ((((a18 == 8) && (a3 <= 115)) && (a15 == 4)) && (a24 == 2))) || (a24 == 0)) || (a24 == 1)) || ((5 == a15) && (a24 == 2))) || ((a15 <= 4) && (a24 == 4))) || ((5 == a15) && (a24 == 4))) || ((((a15 == 4) && (418 <= a3)) && (a24 == 2)) && (a18 == 11))) || (((a24 <= 2) && (a15 <= 4)) && (a18 == 9))) || ((6 <= a15) && (a24 == 2))) || ((((a24 <= 2) && (307 <= a3)) && (a15 <= 4)) && (a3 <= 417))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:56:17,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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