./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label56.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label56.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1bf9c9ed0ac3089dd8a3bb2d319db37780f9f29fcee029bedf598db4408580eb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 10:47:49,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 10:47:49,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 10:47:49,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 10:47:49,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 10:47:49,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 10:47:49,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 10:47:49,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 10:47:49,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 10:47:49,948 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 10:47:49,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 10:47:49,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 10:47:49,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 10:47:49,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 10:47:49,950 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 10:47:49,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 10:47:49,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 10:47:49,951 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 10:47:49,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 10:47:49,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 10:47:49,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 10:47:49,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 10:47:49,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 10:47:49,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 10:47:49,955 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 10:47:49,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 10:47:49,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 10:47:49,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 10:47:49,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 10:47:49,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 10:47:49,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 10:47:49,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 10:47:49,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:47:49,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 10:47:49,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 10:47:49,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 10:47:49,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 10:47:49,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 10:47:49,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 10:47:49,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 10:47:49,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 10:47:49,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 10:47:49,968 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1bf9c9ed0ac3089dd8a3bb2d319db37780f9f29fcee029bedf598db4408580eb [2024-11-18 10:47:50,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 10:47:50,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 10:47:50,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 10:47:50,251 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 10:47:50,251 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 10:47:50,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label56.c [2024-11-18 10:47:51,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 10:47:52,138 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 10:47:52,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label56.c [2024-11-18 10:47:52,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15adf1924/e24c35666d1d451a88e4fea7df4e51ae/FLAG7e78b7561 [2024-11-18 10:47:52,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15adf1924/e24c35666d1d451a88e4fea7df4e51ae [2024-11-18 10:47:52,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 10:47:52,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 10:47:52,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 10:47:52,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 10:47:52,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 10:47:52,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:47:52" (1/1) ... [2024-11-18 10:47:52,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3032335a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:52, skipping insertion in model container [2024-11-18 10:47:52,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:47:52" (1/1) ... [2024-11-18 10:47:52,453 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 10:47:52,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label56.c[3626,3639] [2024-11-18 10:47:53,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:47:53,128 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 10:47:53,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label56.c[3626,3639] [2024-11-18 10:47:53,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:47:53,330 INFO L204 MainTranslator]: Completed translation [2024-11-18 10:47:53,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:53 WrapperNode [2024-11-18 10:47:53,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 10:47:53,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 10:47:53,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 10:47:53,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 10:47:53,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:53" (1/1) ... [2024-11-18 10:47:53,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:53" (1/1) ... [2024-11-18 10:47:53,525 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-11-18 10:47:53,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 10:47:53,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 10:47:53,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 10:47:53,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 10:47:53,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:53" (1/1) ... [2024-11-18 10:47:53,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:53" (1/1) ... [2024-11-18 10:47:53,554 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:53" (1/1) ... [2024-11-18 10:47:53,606 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 10:47:53,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:53" (1/1) ... [2024-11-18 10:47:53,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:53" (1/1) ... [2024-11-18 10:47:53,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:53" (1/1) ... [2024-11-18 10:47:53,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:53" (1/1) ... [2024-11-18 10:47:53,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:53" (1/1) ... [2024-11-18 10:47:53,708 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:53" (1/1) ... [2024-11-18 10:47:53,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 10:47:53,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 10:47:53,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 10:47:53,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 10:47:53,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:53" (1/1) ... [2024-11-18 10:47:53,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:47:53,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:47:53,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 10:47:53,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 10:47:53,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 10:47:53,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 10:47:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 10:47:53,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 10:47:53,876 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 10:47:53,878 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 10:47:55,934 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-11-18 10:47:55,934 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 10:47:55,968 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 10:47:55,968 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 10:47:55,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:47:55 BoogieIcfgContainer [2024-11-18 10:47:55,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 10:47:55,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 10:47:55,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 10:47:55,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 10:47:55,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:47:52" (1/3) ... [2024-11-18 10:47:55,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a2be72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:47:55, skipping insertion in model container [2024-11-18 10:47:55,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:53" (2/3) ... [2024-11-18 10:47:55,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a2be72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:47:55, skipping insertion in model container [2024-11-18 10:47:55,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:47:55" (3/3) ... [2024-11-18 10:47:55,981 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label56.c [2024-11-18 10:47:55,998 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 10:47:55,999 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 10:47:56,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 10:47:56,092 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;@62fce8db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 10:47:56,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 10:47:56,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:47:56,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-18 10:47:56,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:47:56,111 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-11-18 10:47:56,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:47:56,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:47:56,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2113343065, now seen corresponding path program 1 times [2024-11-18 10:47:56,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:47:56,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624048513] [2024-11-18 10:47:56,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:47:56,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:47:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:47:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:47:56,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:47:56,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624048513] [2024-11-18 10:47:56,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624048513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:47:56,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:47:56,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:47:56,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459174353] [2024-11-18 10:47:56,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:47:56,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:47:56,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:47:56,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:47:56,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:47:56,533 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 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-11-18 10:47:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:47:58,229 INFO L93 Difference]: Finished difference Result 1122 states and 2103 transitions. [2024-11-18 10:47:58,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:47:58,231 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-11-18 10:47:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:47:58,246 INFO L225 Difference]: With dead ends: 1122 [2024-11-18 10:47:58,246 INFO L226 Difference]: Without dead ends: 662 [2024-11-18 10:47:58,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:47:58,254 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 327 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-18 10:47:58,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 223 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-18 10:47:58,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-18 10:47:58,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2024-11-18 10:47:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5824508320726172) internal successors, (1046), 661 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:47:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1046 transitions. [2024-11-18 10:47:58,331 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1046 transitions. Word has length 33 [2024-11-18 10:47:58,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:47:58,332 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1046 transitions. [2024-11-18 10:47:58,332 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-11-18 10:47:58,332 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1046 transitions. [2024-11-18 10:47:58,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-18 10:47:58,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:47:58,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:47:58,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 10:47:58,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:47:58,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:47:58,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1042759933, now seen corresponding path program 1 times [2024-11-18 10:47:58,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:47:58,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967344150] [2024-11-18 10:47:58,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:47:58,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:47:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:47:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:47:58,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:47:58,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967344150] [2024-11-18 10:47:58,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967344150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:47:58,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:47:58,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:47:58,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777587764] [2024-11-18 10:47:58,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:47:58,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:47:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:47:58,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:47:58,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:47:58,580 INFO L87 Difference]: Start difference. First operand 662 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:47:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:47:59,725 INFO L93 Difference]: Finished difference Result 1651 states and 2539 transitions. [2024-11-18 10:47:59,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:47:59,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2024-11-18 10:47:59,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:47:59,733 INFO L225 Difference]: With dead ends: 1651 [2024-11-18 10:47:59,733 INFO L226 Difference]: Without dead ends: 991 [2024-11-18 10:47:59,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:47:59,737 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 338 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 10:47:59,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 77 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 10:47:59,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-11-18 10:47:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2024-11-18 10:47:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.3767676767676769) internal successors, (1363), 990 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:47:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1363 transitions. [2024-11-18 10:47:59,777 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1363 transitions. Word has length 104 [2024-11-18 10:47:59,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:47:59,780 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1363 transitions. [2024-11-18 10:47:59,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:47:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1363 transitions. [2024-11-18 10:47:59,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-18 10:47:59,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:47:59,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:47:59,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 10:47:59,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:47:59,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:47:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash 479254088, now seen corresponding path program 1 times [2024-11-18 10:47:59,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:47:59,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173025002] [2024-11-18 10:47:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:47:59,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:47:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:47:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:47:59,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:47:59,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173025002] [2024-11-18 10:47:59,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173025002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:47:59,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:47:59,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:47:59,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763563271] [2024-11-18 10:47:59,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:47:59,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:47:59,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:47:59,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:47:59,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:47:59,983 INFO L87 Difference]: Start difference. First operand 991 states and 1363 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:01,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:48:01,315 INFO L93 Difference]: Finished difference Result 2967 states and 4084 transitions. [2024-11-18 10:48:01,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:48:01,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-11-18 10:48:01,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:48:01,323 INFO L225 Difference]: With dead ends: 2967 [2024-11-18 10:48:01,323 INFO L226 Difference]: Without dead ends: 1978 [2024-11-18 10:48:01,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:48:01,326 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 287 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-18 10:48:01,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 211 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-18 10:48:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2024-11-18 10:48:01,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2024-11-18 10:48:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1978 states, 1977 states have (on average 1.2463328275164391) internal successors, (2464), 1977 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2464 transitions. [2024-11-18 10:48:01,365 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2464 transitions. Word has length 105 [2024-11-18 10:48:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:48:01,366 INFO L471 AbstractCegarLoop]: Abstraction has 1978 states and 2464 transitions. [2024-11-18 10:48:01,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2464 transitions. [2024-11-18 10:48:01,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-18 10:48:01,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:48:01,370 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-18 10:48:01,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 10:48:01,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:48:01,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:48:01,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1162788624, now seen corresponding path program 1 times [2024-11-18 10:48:01,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:48:01,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199791494] [2024-11-18 10:48:01,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:48:01,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:48:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:48:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-18 10:48:01,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:48:01,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199791494] [2024-11-18 10:48:01,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199791494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:48:01,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:48:01,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:48:01,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231145334] [2024-11-18 10:48:01,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:48:01,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:48:01,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:48:01,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:48:01,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:48:01,623 INFO L87 Difference]: Start difference. First operand 1978 states and 2464 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:02,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:48:02,959 INFO L93 Difference]: Finished difference Result 4612 states and 5849 transitions. [2024-11-18 10:48:02,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:48:02,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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 188 [2024-11-18 10:48:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:48:02,971 INFO L225 Difference]: With dead ends: 4612 [2024-11-18 10:48:02,971 INFO L226 Difference]: Without dead ends: 2636 [2024-11-18 10:48:02,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:48:02,979 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 358 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-18 10:48:02,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 156 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-18 10:48:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2024-11-18 10:48:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2307. [2024-11-18 10:48:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.2350390286209887) internal successors, (2848), 2306 states have internal predecessors, (2848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:03,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 2848 transitions. [2024-11-18 10:48:03,034 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 2848 transitions. Word has length 188 [2024-11-18 10:48:03,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:48:03,035 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 2848 transitions. [2024-11-18 10:48:03,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:03,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 2848 transitions. [2024-11-18 10:48:03,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-11-18 10:48:03,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:48:03,041 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:48:03,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 10:48:03,042 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:48:03,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:48:03,043 INFO L85 PathProgramCache]: Analyzing trace with hash -930558623, now seen corresponding path program 1 times [2024-11-18 10:48:03,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:48:03,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909180940] [2024-11-18 10:48:03,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:48:03,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:48:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:48:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-11-18 10:48:03,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:48:03,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909180940] [2024-11-18 10:48:03,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909180940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:48:03,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:48:03,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:48:03,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808936661] [2024-11-18 10:48:03,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:48:03,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:48:03,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:48:03,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:48:03,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:48:03,502 INFO L87 Difference]: Start difference. First operand 2307 states and 2848 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:04,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:48:04,798 INFO L93 Difference]: Finished difference Result 6917 states and 8540 transitions. [2024-11-18 10:48:04,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:48:04,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 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 365 [2024-11-18 10:48:04,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:48:04,813 INFO L225 Difference]: With dead ends: 6917 [2024-11-18 10:48:04,814 INFO L226 Difference]: Without dead ends: 4612 [2024-11-18 10:48:04,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:48:04,817 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 254 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-18 10:48:04,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 120 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-18 10:48:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4612 states. [2024-11-18 10:48:04,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4612 to 4610. [2024-11-18 10:48:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4609 states have (on average 1.206552397483185) internal successors, (5561), 4609 states have internal predecessors, (5561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:04,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 5561 transitions. [2024-11-18 10:48:04,897 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 5561 transitions. Word has length 365 [2024-11-18 10:48:04,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:48:04,898 INFO L471 AbstractCegarLoop]: Abstraction has 4610 states and 5561 transitions. [2024-11-18 10:48:04,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 5561 transitions. [2024-11-18 10:48:04,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2024-11-18 10:48:04,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:48:04,904 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-18 10:48:04,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 10:48:04,905 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:48:04,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:48:04,906 INFO L85 PathProgramCache]: Analyzing trace with hash -569574006, now seen corresponding path program 1 times [2024-11-18 10:48:04,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:48:04,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337866896] [2024-11-18 10:48:04,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:48:04,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:48:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:48:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-18 10:48:05,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:48:05,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337866896] [2024-11-18 10:48:05,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337866896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:48:05,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:48:05,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:48:05,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035922779] [2024-11-18 10:48:05,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:48:05,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:48:05,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:48:05,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:48:05,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:48:05,638 INFO L87 Difference]: Start difference. First operand 4610 states and 5561 transitions. Second operand has 4 states, 4 states have (on average 89.75) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:48:07,118 INFO L93 Difference]: Finished difference Result 9547 states and 11461 transitions. [2024-11-18 10:48:07,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:48:07,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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 389 [2024-11-18 10:48:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:48:07,142 INFO L225 Difference]: With dead ends: 9547 [2024-11-18 10:48:07,143 INFO L226 Difference]: Without dead ends: 4939 [2024-11-18 10:48:07,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 10:48:07,150 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 127 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:48:07,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 322 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-18 10:48:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2024-11-18 10:48:07,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4939. [2024-11-18 10:48:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 4938 states have (on average 1.194005670311867) internal successors, (5896), 4938 states have internal predecessors, (5896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 5896 transitions. [2024-11-18 10:48:07,250 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 5896 transitions. Word has length 389 [2024-11-18 10:48:07,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:48:07,254 INFO L471 AbstractCegarLoop]: Abstraction has 4939 states and 5896 transitions. [2024-11-18 10:48:07,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 5896 transitions. [2024-11-18 10:48:07,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2024-11-18 10:48:07,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:48:07,263 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:48:07,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 10:48:07,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:48:07,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:48:07,264 INFO L85 PathProgramCache]: Analyzing trace with hash -630304164, now seen corresponding path program 1 times [2024-11-18 10:48:07,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:48:07,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847675319] [2024-11-18 10:48:07,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:48:07,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:48:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:48:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-18 10:48:08,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:48:08,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847675319] [2024-11-18 10:48:08,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847675319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:48:08,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:48:08,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 10:48:08,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822218613] [2024-11-18 10:48:08,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:48:08,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 10:48:08,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:48:08,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 10:48:08,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:48:08,177 INFO L87 Difference]: Start difference. First operand 4939 states and 5896 transitions. Second operand has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 6 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:48:09,622 INFO L93 Difference]: Finished difference Result 9406 states and 11302 transitions. [2024-11-18 10:48:09,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 10:48:09,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 6 states have internal predecessors, (395), 0 states have call successors, (0), 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 476 [2024-11-18 10:48:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:48:09,639 INFO L225 Difference]: With dead ends: 9406 [2024-11-18 10:48:09,639 INFO L226 Difference]: Without dead ends: 4610 [2024-11-18 10:48:09,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:48:09,646 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 289 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:48:09,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 290 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-18 10:48:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2024-11-18 10:48:09,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4610. [2024-11-18 10:48:09,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4609 states have (on average 1.0744196137990887) internal successors, (4952), 4609 states have internal predecessors, (4952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:09,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 4952 transitions. [2024-11-18 10:48:09,728 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 4952 transitions. Word has length 476 [2024-11-18 10:48:09,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:48:09,728 INFO L471 AbstractCegarLoop]: Abstraction has 4610 states and 4952 transitions. [2024-11-18 10:48:09,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 6 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 4952 transitions. [2024-11-18 10:48:09,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2024-11-18 10:48:09,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:48:09,737 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:48:09,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 10:48:09,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:48:09,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:48:09,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1569956550, now seen corresponding path program 1 times [2024-11-18 10:48:09,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:48:09,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406608351] [2024-11-18 10:48:09,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:48:09,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:48:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:48:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-18 10:48:10,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:48:10,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406608351] [2024-11-18 10:48:10,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406608351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:48:10,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:48:10,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:48:10,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547213611] [2024-11-18 10:48:10,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:48:10,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:48:10,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:48:10,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:48:10,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:48:10,477 INFO L87 Difference]: Start difference. First operand 4610 states and 4952 transitions. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:11,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:48:11,864 INFO L93 Difference]: Finished difference Result 12839 states and 13874 transitions. [2024-11-18 10:48:11,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:48:11,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 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 504 [2024-11-18 10:48:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:48:11,890 INFO L225 Difference]: With dead ends: 12839 [2024-11-18 10:48:11,890 INFO L226 Difference]: Without dead ends: 8560 [2024-11-18 10:48:11,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:48:11,898 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 307 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-18 10:48:11,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 97 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-18 10:48:11,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8560 states. [2024-11-18 10:48:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8560 to 8229. [2024-11-18 10:48:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0710986874088477) internal successors, (8813), 8228 states have internal predecessors, (8813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8813 transitions. [2024-11-18 10:48:12,065 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8813 transitions. Word has length 504 [2024-11-18 10:48:12,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:48:12,065 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8813 transitions. [2024-11-18 10:48:12,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:12,066 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8813 transitions. [2024-11-18 10:48:12,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2024-11-18 10:48:12,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:48:12,079 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-18 10:48:12,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 10:48:12,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:48:12,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:48:12,081 INFO L85 PathProgramCache]: Analyzing trace with hash 571424121, now seen corresponding path program 1 times [2024-11-18 10:48:12,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:48:12,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069532450] [2024-11-18 10:48:12,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:48:12,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:48:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:48:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-18 10:48:12,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:48:12,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069532450] [2024-11-18 10:48:12,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069532450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:48:12,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:48:12,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:48:12,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501265663] [2024-11-18 10:48:12,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:48:12,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:48:12,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:48:12,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:48:12,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:48:12,776 INFO L87 Difference]: Start difference. First operand 8229 states and 8813 transitions. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:48:13,529 INFO L93 Difference]: Finished difference Result 19417 states and 20959 transitions. [2024-11-18 10:48:13,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:48:13,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 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 608 [2024-11-18 10:48:13,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:48:13,556 INFO L225 Difference]: With dead ends: 19417 [2024-11-18 10:48:13,556 INFO L226 Difference]: Without dead ends: 11848 [2024-11-18 10:48:13,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:48:13,568 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 222 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 10:48:13,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 40 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 10:48:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2024-11-18 10:48:13,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 10861. [2024-11-18 10:48:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10861 states, 10860 states have (on average 1.077255985267035) internal successors, (11699), 10860 states have internal predecessors, (11699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11699 transitions. [2024-11-18 10:48:13,759 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11699 transitions. Word has length 608 [2024-11-18 10:48:13,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:48:13,760 INFO L471 AbstractCegarLoop]: Abstraction has 10861 states and 11699 transitions. [2024-11-18 10:48:13,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11699 transitions. [2024-11-18 10:48:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 866 [2024-11-18 10:48:13,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:48:13,774 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:48:13,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 10:48:13,774 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:48:13,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:48:13,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1907997465, now seen corresponding path program 1 times [2024-11-18 10:48:13,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:48:13,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410487050] [2024-11-18 10:48:13,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:48:13,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:48:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:48:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1758 backedges. 1092 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2024-11-18 10:48:15,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:48:15,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410487050] [2024-11-18 10:48:15,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410487050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:48:15,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:48:15,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:48:15,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448007021] [2024-11-18 10:48:15,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:48:15,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:48:15,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:48:15,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:48:15,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:48:15,133 INFO L87 Difference]: Start difference. First operand 10861 states and 11699 transitions. Second operand has 4 states, 4 states have (on average 134.25) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:16,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:48:16,298 INFO L93 Difference]: Finished difference Result 21391 states and 23065 transitions. [2024-11-18 10:48:16,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:48:16,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 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 865 [2024-11-18 10:48:16,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:48:16,316 INFO L225 Difference]: With dead ends: 21391 [2024-11-18 10:48:16,316 INFO L226 Difference]: Without dead ends: 10861 [2024-11-18 10:48:16,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:48:16,327 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 268 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 10:48:16,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 123 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 10:48:16,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2024-11-18 10:48:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 10861. [2024-11-18 10:48:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10861 states, 10860 states have (on average 1.0767955801104971) internal successors, (11694), 10860 states have internal predecessors, (11694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11694 transitions. [2024-11-18 10:48:16,467 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11694 transitions. Word has length 865 [2024-11-18 10:48:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:48:16,468 INFO L471 AbstractCegarLoop]: Abstraction has 10861 states and 11694 transitions. [2024-11-18 10:48:16,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11694 transitions. [2024-11-18 10:48:16,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2024-11-18 10:48:16,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:48:16,483 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:48:16,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 10:48:16,483 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:48:16,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:48:16,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1686983655, now seen corresponding path program 1 times [2024-11-18 10:48:16,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:48:16,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145641182] [2024-11-18 10:48:16,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:48:16,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:48:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:48:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1819 backedges. 1127 proven. 0 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2024-11-18 10:48:17,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:48:17,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145641182] [2024-11-18 10:48:17,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145641182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:48:17,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:48:17,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:48:17,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19947834] [2024-11-18 10:48:17,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:48:17,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:48:17,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:48:17,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:48:17,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:48:17,144 INFO L87 Difference]: Start difference. First operand 10861 states and 11694 transitions. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:48:18,097 INFO L93 Difference]: Finished difference Result 24023 states and 26019 transitions. [2024-11-18 10:48:18,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:48:18,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 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 926 [2024-11-18 10:48:18,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:48:18,124 INFO L225 Difference]: With dead ends: 24023 [2024-11-18 10:48:18,124 INFO L226 Difference]: Without dead ends: 13822 [2024-11-18 10:48:18,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:48:18,137 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 10:48:18,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 437 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 10:48:18,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2024-11-18 10:48:18,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 12835. [2024-11-18 10:48:18,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12835 states, 12834 states have (on average 1.0661524076671343) internal successors, (13683), 12834 states have internal predecessors, (13683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13683 transitions. [2024-11-18 10:48:18,306 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13683 transitions. Word has length 926 [2024-11-18 10:48:18,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:48:18,308 INFO L471 AbstractCegarLoop]: Abstraction has 12835 states and 13683 transitions. [2024-11-18 10:48:18,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13683 transitions. [2024-11-18 10:48:18,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1002 [2024-11-18 10:48:18,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:48:18,365 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:48:18,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 10:48:18,365 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:48:18,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:48:18,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1879071471, now seen corresponding path program 1 times [2024-11-18 10:48:18,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:48:18,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976878640] [2024-11-18 10:48:18,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:48:18,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:48:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:48:19,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2269 backedges. 1176 proven. 0 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2024-11-18 10:48:19,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:48:19,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976878640] [2024-11-18 10:48:19,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976878640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:48:19,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:48:19,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:48:19,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301827181] [2024-11-18 10:48:19,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:48:19,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:48:19,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:48:19,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:48:19,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:48:19,095 INFO L87 Difference]: Start difference. First operand 12835 states and 13683 transitions. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:48:19,901 INFO L93 Difference]: Finished difference Result 29616 states and 31665 transitions. [2024-11-18 10:48:19,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:48:19,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 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 1001 [2024-11-18 10:48:19,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:48:19,926 INFO L225 Difference]: With dead ends: 29616 [2024-11-18 10:48:19,926 INFO L226 Difference]: Without dead ends: 15467 [2024-11-18 10:48:19,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:48:19,942 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 270 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 10:48:19,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 430 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 10:48:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15467 states. [2024-11-18 10:48:20,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15467 to 15467. [2024-11-18 10:48:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15467 states, 15466 states have (on average 1.0510797879218932) internal successors, (16256), 15466 states have internal predecessors, (16256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15467 states to 15467 states and 16256 transitions. [2024-11-18 10:48:20,123 INFO L78 Accepts]: Start accepts. Automaton has 15467 states and 16256 transitions. Word has length 1001 [2024-11-18 10:48:20,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:48:20,124 INFO L471 AbstractCegarLoop]: Abstraction has 15467 states and 16256 transitions. [2024-11-18 10:48:20,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 15467 states and 16256 transitions. [2024-11-18 10:48:20,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1297 [2024-11-18 10:48:20,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:48:20,151 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-18 10:48:20,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 10:48:20,151 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:48:20,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:48:20,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1278609055, now seen corresponding path program 1 times [2024-11-18 10:48:20,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:48:20,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228812836] [2024-11-18 10:48:20,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:48:20,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:48:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:48:21,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3345 backedges. 1128 proven. 0 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2024-11-18 10:48:21,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:48:21,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228812836] [2024-11-18 10:48:21,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228812836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:48:21,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:48:21,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:48:21,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637494340] [2024-11-18 10:48:21,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:48:21,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:48:21,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:48:21,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:48:21,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:48:21,766 INFO L87 Difference]: Start difference. First operand 15467 states and 16256 transitions. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:48:22,489 INFO L93 Difference]: Finished difference Result 30274 states and 31848 transitions. [2024-11-18 10:48:22,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:48:22,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 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 1296 [2024-11-18 10:48:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:48:22,513 INFO L225 Difference]: With dead ends: 30274 [2024-11-18 10:48:22,513 INFO L226 Difference]: Without dead ends: 15467 [2024-11-18 10:48:22,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:48:22,526 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 169 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 10:48:22,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 371 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 10:48:22,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15467 states. [2024-11-18 10:48:22,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15467 to 14809. [2024-11-18 10:48:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14809 states, 14808 states have (on average 1.039843327930848) internal successors, (15398), 14808 states have internal predecessors, (15398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15398 transitions. [2024-11-18 10:48:22,697 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15398 transitions. Word has length 1296 [2024-11-18 10:48:22,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:48:22,698 INFO L471 AbstractCegarLoop]: Abstraction has 14809 states and 15398 transitions. [2024-11-18 10:48:22,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:22,699 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15398 transitions. [2024-11-18 10:48:22,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1313 [2024-11-18 10:48:22,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:48:22,722 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:48:22,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 10:48:22,723 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:48:22,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:48:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash -701448478, now seen corresponding path program 1 times [2024-11-18 10:48:22,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:48:22,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927330347] [2024-11-18 10:48:22,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:48:22,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:48:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:48:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3579 backedges. 1167 proven. 0 refuted. 0 times theorem prover too weak. 2412 trivial. 0 not checked. [2024-11-18 10:48:23,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:48:23,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927330347] [2024-11-18 10:48:23,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927330347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:48:23,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:48:23,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:48:23,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588952964] [2024-11-18 10:48:23,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:48:23,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:48:23,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:48:23,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:48:23,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:48:23,775 INFO L87 Difference]: Start difference. First operand 14809 states and 15398 transitions. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:48:24,494 INFO L93 Difference]: Finished difference Result 32246 states and 33587 transitions. [2024-11-18 10:48:24,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:48:24,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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 1312 [2024-11-18 10:48:24,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:48:24,496 INFO L225 Difference]: With dead ends: 32246 [2024-11-18 10:48:24,496 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 10:48:24,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:48:24,510 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 170 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 10:48:24,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 409 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 10:48:24,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 10:48:24,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 10:48:24,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 10:48:24,512 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1312 [2024-11-18 10:48:24,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:48:24,512 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 10:48:24,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:48:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 10:48:24,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 10:48:24,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 10:48:24,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-18 10:48:24,519 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:48:24,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 10:48:25,181 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 10:48:25,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:48:25 BoogieIcfgContainer [2024-11-18 10:48:25,199 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 10:48:25,200 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 10:48:25,200 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 10:48:25,200 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 10:48:25,201 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:47:55" (3/4) ... [2024-11-18 10:48:25,204 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 10:48:25,233 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-18 10:48:25,238 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 10:48:25,240 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 10:48:25,242 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 10:48:25,464 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 10:48:25,464 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 10:48:25,464 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 10:48:25,465 INFO L158 Benchmark]: Toolchain (without parser) took 33078.77ms. Allocated memory was 136.3MB in the beginning and 1.1GB in the end (delta: 960.5MB). Free memory was 78.0MB in the beginning and 928.9MB in the end (delta: -850.8MB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. [2024-11-18 10:48:25,466 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 136.3MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 10:48:25,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 944.85ms. Allocated memory was 136.3MB in the beginning and 195.0MB in the end (delta: 58.7MB). Free memory was 78.0MB in the beginning and 125.1MB in the end (delta: -47.0MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2024-11-18 10:48:25,466 INFO L158 Benchmark]: Boogie Procedure Inliner took 193.28ms. Allocated memory is still 195.0MB. Free memory was 125.1MB in the beginning and 101.0MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-18 10:48:25,467 INFO L158 Benchmark]: Boogie Preprocessor took 202.35ms. Allocated memory is still 195.0MB. Free memory was 101.0MB in the beginning and 66.2MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-18 10:48:25,467 INFO L158 Benchmark]: RCFGBuilder took 2238.77ms. Allocated memory was 195.0MB in the beginning and 278.9MB in the end (delta: 83.9MB). Free memory was 66.2MB in the beginning and 199.9MB in the end (delta: -133.8MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2024-11-18 10:48:25,468 INFO L158 Benchmark]: TraceAbstraction took 29227.74ms. Allocated memory was 278.9MB in the beginning and 1.1GB in the end (delta: 817.9MB). Free memory was 199.9MB in the beginning and 955.1MB in the end (delta: -755.1MB). Peak memory consumption was 636.3MB. Max. memory is 16.1GB. [2024-11-18 10:48:25,468 INFO L158 Benchmark]: Witness Printer took 264.53ms. Allocated memory is still 1.1GB. Free memory was 955.1MB in the beginning and 928.9MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-18 10:48:25,469 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.33ms. Allocated memory is still 136.3MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 944.85ms. Allocated memory was 136.3MB in the beginning and 195.0MB in the end (delta: 58.7MB). Free memory was 78.0MB in the beginning and 125.1MB in the end (delta: -47.0MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 193.28ms. Allocated memory is still 195.0MB. Free memory was 125.1MB in the beginning and 101.0MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 202.35ms. Allocated memory is still 195.0MB. Free memory was 101.0MB in the beginning and 66.2MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * RCFGBuilder took 2238.77ms. Allocated memory was 195.0MB in the beginning and 278.9MB in the end (delta: 83.9MB). Free memory was 66.2MB in the beginning and 199.9MB in the end (delta: -133.8MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. * TraceAbstraction took 29227.74ms. Allocated memory was 278.9MB in the beginning and 1.1GB in the end (delta: 817.9MB). Free memory was 199.9MB in the beginning and 955.1MB in the end (delta: -755.1MB). Peak memory consumption was 636.3MB. Max. memory is 16.1GB. * Witness Printer took 264.53ms. Allocated memory is still 1.1GB. Free memory was 955.1MB in the beginning and 928.9MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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: 116]: 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, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.5s, OverallIterations: 14, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3606 SdHoareTripleChecker+Valid, 15.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3606 mSDsluCounter, 3306 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 2490 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14518 IncrementalHoareTripleChecker+Invalid, 17008 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2490 mSolverCounterUnsat, 3145 mSDtfsCounter, 14518 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15467occurred in iteration=12, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 3294 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 8172 NumberOfCodeBlocks, 8172 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 8158 ConstructedInterpolants, 0 QuantifiedInterpolants, 19624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 15089/15089 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1783]: Loop Invariant Derived loop invariant: ((((((a16 == 8) || (a16 == 9)) || ((a12 <= 7) && (a16 <= 11))) || (((a15 <= 3) && (5 != a12)) && (11 <= a16))) || ((a15 <= 3) && (a12 == 8))) || ((a15 == 3) && (11 <= a16))) RESULT: Ultimate proved your program to be correct! [2024-11-18 10:48:25,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE