./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label35.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2d3fb052b8e038151f16c8d029b12273ed341a0155bb0d7b51eb13f54c8fdf19 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:59:20,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:59:20,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:59:20,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:59:20,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:59:20,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:59:20,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:59:20,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:59:20,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:59:20,422 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:59:20,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:59:20,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:59:20,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:59:20,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:59:20,426 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:59:20,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:59:20,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:59:20,427 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:59:20,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:59:20,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:59:20,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:59:20,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:59:20,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:59:20,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:59:20,429 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:59:20,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:59:20,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:59:20,430 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:59:20,430 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:59:20,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:59:20,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:59:20,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:59:20,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:59:20,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:59:20,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:59:20,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:59:20,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:59:20,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:59:20,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:59:20,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:59:20,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:59:20,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:59:20,434 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2d3fb052b8e038151f16c8d029b12273ed341a0155bb0d7b51eb13f54c8fdf19 [2024-10-10 23:59:20,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:59:20,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:59:20,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:59:20,733 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:59:20,734 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:59:20,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label35.c [2024-10-10 23:59:22,140 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:59:22,750 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:59:22,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label35.c [2024-10-10 23:59:22,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/11b07904f/4d0cfa1f81fc4542a5ee295ce7ab70fa/FLAGe484d4881 [2024-10-10 23:59:22,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/11b07904f/4d0cfa1f81fc4542a5ee295ce7ab70fa [2024-10-10 23:59:22,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:59:22,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:59:22,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:59:22,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:59:22,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:59:22,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:59:22" (1/1) ... [2024-10-10 23:59:22,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4691bb4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:22, skipping insertion in model container [2024-10-10 23:59:22,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:59:22" (1/1) ... [2024-10-10 23:59:23,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:59:23,320 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label35.c[5290,5303] [2024-10-10 23:59:24,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:59:24,474 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:59:24,497 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label35.c[5290,5303] [2024-10-10 23:59:25,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:59:25,259 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:59:25,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:25 WrapperNode [2024-10-10 23:59:25,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:59:25,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:59:25,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:59:25,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:59:25,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:25" (1/1) ... [2024-10-10 23:59:25,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:25" (1/1) ... [2024-10-10 23:59:26,260 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9431 [2024-10-10 23:59:26,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:59:26,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:59:26,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:59:26,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:59:26,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:25" (1/1) ... [2024-10-10 23:59:26,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:25" (1/1) ... [2024-10-10 23:59:26,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:25" (1/1) ... [2024-10-10 23:59:26,886 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:59:26,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:25" (1/1) ... [2024-10-10 23:59:26,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:25" (1/1) ... [2024-10-10 23:59:27,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:25" (1/1) ... [2024-10-10 23:59:27,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:25" (1/1) ... [2024-10-10 23:59:27,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:25" (1/1) ... [2024-10-10 23:59:27,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:25" (1/1) ... [2024-10-10 23:59:27,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:59:27,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:59:27,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:59:27,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:59:27,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:25" (1/1) ... [2024-10-10 23:59:27,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:59:27,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:59:27,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:59:27,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:59:27,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:59:27,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:59:27,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:59:27,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:59:27,905 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:59:27,909 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:59:35,775 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2024-10-10 23:59:35,775 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:59:35,892 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:59:35,893 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:59:35,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:59:35 BoogieIcfgContainer [2024-10-10 23:59:35,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:59:35,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:59:35,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:59:35,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:59:35,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:59:22" (1/3) ... [2024-10-10 23:59:35,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f349c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:59:35, skipping insertion in model container [2024-10-10 23:59:35,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:59:25" (2/3) ... [2024-10-10 23:59:35,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f349c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:59:35, skipping insertion in model container [2024-10-10 23:59:35,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:59:35" (3/3) ... [2024-10-10 23:59:35,906 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem19_label35.c [2024-10-10 23:59:35,924 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:59:35,925 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:59:36,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:59:36,061 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;@4b5d3abd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:59:36,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:59:36,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:59:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 23:59:36,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:59:36,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:59:36,086 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:59:36,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:59:36,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1802380408, now seen corresponding path program 1 times [2024-10-10 23:59:36,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:59:36,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542652284] [2024-10-10 23:59:36,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:59:36,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:59:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:59:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:59:36,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:59:36,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542652284] [2024-10-10 23:59:36,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542652284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:59:36,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:59:36,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:59:36,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856697366] [2024-10-10 23:59:36,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:59:36,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:59:36,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:59:36,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:59:36,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:59:36,328 INFO L87 Difference]: Start difference. First operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:59:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:59:36,455 INFO L93 Difference]: Finished difference Result 3371 states and 6405 transitions. [2024-10-10 23:59:36,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:59:36,458 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-10 23:59:36,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:59:36,485 INFO L225 Difference]: With dead ends: 3371 [2024-10-10 23:59:36,485 INFO L226 Difference]: Without dead ends: 1684 [2024-10-10 23:59:36,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:59:36,496 INFO L432 NwaCegarLoop]: 3138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:59:36,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3138 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:59:36,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2024-10-10 23:59:36,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2024-10-10 23:59:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.8645276292335116) internal successors, (3138), 1683 states have internal predecessors, (3138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:59:36,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2024-10-10 23:59:36,609 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 38 [2024-10-10 23:59:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:59:36,610 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2024-10-10 23:59:36,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:59:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2024-10-10 23:59:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 23:59:36,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:59:36,612 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:59:36,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:59:36,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:59:36,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:59:36,613 INFO L85 PathProgramCache]: Analyzing trace with hash -878155672, now seen corresponding path program 1 times [2024-10-10 23:59:36,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:59:36,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620180788] [2024-10-10 23:59:36,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:59:36,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:59:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:59:36,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:59:36,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:59:36,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620180788] [2024-10-10 23:59:36,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620180788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:59:36,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:59:36,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:59:36,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500821848] [2024-10-10 23:59:36,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:59:36,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:59:36,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:59:36,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:59:36,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:59:36,848 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:59:43,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:59:43,110 INFO L93 Difference]: Finished difference Result 4789 states and 8995 transitions. [2024-10-10 23:59:43,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:59:43,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-10 23:59:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:59:43,129 INFO L225 Difference]: With dead ends: 4789 [2024-10-10 23:59:43,129 INFO L226 Difference]: Without dead ends: 3106 [2024-10-10 23:59:43,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:59:43,135 INFO L432 NwaCegarLoop]: 1212 mSDtfsCounter, 1510 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4579 mSolverCounterSat, 1050 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 5629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1050 IncrementalHoareTripleChecker+Valid, 4579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:59:43,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1390 Invalid, 5629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1050 Valid, 4579 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-10 23:59:43,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2024-10-10 23:59:43,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3105. [2024-10-10 23:59:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3105 states, 3104 states have (on average 1.653028350515464) internal successors, (5131), 3104 states have internal predecessors, (5131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:59:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3105 states to 3105 states and 5131 transitions. [2024-10-10 23:59:43,221 INFO L78 Accepts]: Start accepts. Automaton has 3105 states and 5131 transitions. Word has length 38 [2024-10-10 23:59:43,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:59:43,222 INFO L471 AbstractCegarLoop]: Abstraction has 3105 states and 5131 transitions. [2024-10-10 23:59:43,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:59:43,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3105 states and 5131 transitions. [2024-10-10 23:59:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-10 23:59:43,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:59:43,226 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:59:43,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:59:43,227 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:59:43,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:59:43,227 INFO L85 PathProgramCache]: Analyzing trace with hash -690523453, now seen corresponding path program 1 times [2024-10-10 23:59:43,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:59:43,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669746106] [2024-10-10 23:59:43,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:59:43,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:59:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:59:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:59:43,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:59:43,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669746106] [2024-10-10 23:59:43,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669746106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:59:43,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:59:43,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:59:43,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449199623] [2024-10-10 23:59:43,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:59:43,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:59:43,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:59:43,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:59:43,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:59:43,694 INFO L87 Difference]: Start difference. First operand 3105 states and 5131 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:59:54,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:59:54,323 INFO L93 Difference]: Finished difference Result 10390 states and 16942 transitions. [2024-10-10 23:59:54,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:59:54,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-10-10 23:59:54,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:59:54,351 INFO L225 Difference]: With dead ends: 10390 [2024-10-10 23:59:54,352 INFO L226 Difference]: Without dead ends: 7286 [2024-10-10 23:59:54,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:59:54,357 INFO L432 NwaCegarLoop]: 1840 mSDtfsCounter, 4207 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 11123 mSolverCounterSat, 1405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4207 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 12528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1405 IncrementalHoareTripleChecker+Valid, 11123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:59:54,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4207 Valid, 2102 Invalid, 12528 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1405 Valid, 11123 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2024-10-10 23:59:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7286 states. [2024-10-10 23:59:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7286 to 7235. [2024-10-10 23:59:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7235 states, 7234 states have (on average 1.52156483273431) internal successors, (11007), 7234 states have internal predecessors, (11007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:59:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7235 states to 7235 states and 11007 transitions. [2024-10-10 23:59:54,505 INFO L78 Accepts]: Start accepts. Automaton has 7235 states and 11007 transitions. Word has length 107 [2024-10-10 23:59:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:59:54,506 INFO L471 AbstractCegarLoop]: Abstraction has 7235 states and 11007 transitions. [2024-10-10 23:59:54,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:59:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 7235 states and 11007 transitions. [2024-10-10 23:59:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-10-10 23:59:54,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:59:54,510 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:59:54,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:59:54,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:59:54,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:59:54,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1872918850, now seen corresponding path program 1 times [2024-10-10 23:59:54,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:59:54,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086908059] [2024-10-10 23:59:54,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:59:54,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:59:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:59:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:59:55,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:59:55,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086908059] [2024-10-10 23:59:55,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086908059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:59:55,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:59:55,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:59:55,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928543130] [2024-10-10 23:59:55,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:59:55,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:59:55,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:59:55,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:59:55,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:59:55,219 INFO L87 Difference]: Start difference. First operand 7235 states and 11007 transitions. Second operand has 4 states, 4 states have (on average 68.25) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:00,197 INFO L93 Difference]: Finished difference Result 13135 states and 20667 transitions. [2024-10-11 00:00:00,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:00:00,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2024-10-11 00:00:00,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:00,226 INFO L225 Difference]: With dead ends: 13135 [2024-10-11 00:00:00,226 INFO L226 Difference]: Without dead ends: 7235 [2024-10-11 00:00:00,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:00:00,240 INFO L432 NwaCegarLoop]: 1765 mSDtfsCounter, 1151 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5713 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 5721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:00,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1943 Invalid, 5721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5713 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-11 00:00:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7235 states. [2024-10-11 00:00:00,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7235 to 7235. [2024-10-11 00:00:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7235 states, 7234 states have (on average 1.5203207077688692) internal successors, (10998), 7234 states have internal predecessors, (10998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7235 states to 7235 states and 10998 transitions. [2024-10-11 00:00:00,388 INFO L78 Accepts]: Start accepts. Automaton has 7235 states and 10998 transitions. Word has length 273 [2024-10-11 00:00:00,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:00,390 INFO L471 AbstractCegarLoop]: Abstraction has 7235 states and 10998 transitions. [2024-10-11 00:00:00,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 7235 states and 10998 transitions. [2024-10-11 00:00:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2024-10-11 00:00:00,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:00,407 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:00,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 00:00:00,407 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:00,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:00,408 INFO L85 PathProgramCache]: Analyzing trace with hash -922791497, now seen corresponding path program 1 times [2024-10-11 00:00:00,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:00,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046105547] [2024-10-11 00:00:00,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:00,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-10-11 00:00:01,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:01,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046105547] [2024-10-11 00:00:01,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046105547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:01,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:01,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:00:01,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130476668] [2024-10-11 00:00:01,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:01,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:00:01,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:01,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:00:01,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:01,094 INFO L87 Difference]: Start difference. First operand 7235 states and 10998 transitions. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:06,529 INFO L93 Difference]: Finished difference Result 15841 states and 24471 transitions. [2024-10-11 00:00:06,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:00:06,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 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 590 [2024-10-11 00:00:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:06,599 INFO L225 Difference]: With dead ends: 15841 [2024-10-11 00:00:06,600 INFO L226 Difference]: Without dead ends: 9972 [2024-10-11 00:00:06,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:06,613 INFO L432 NwaCegarLoop]: 702 mSDtfsCounter, 1396 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3928 mSolverCounterSat, 1671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 5599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1671 IncrementalHoareTripleChecker+Valid, 3928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:06,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 752 Invalid, 5599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1671 Valid, 3928 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-10-11 00:00:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9972 states. [2024-10-11 00:00:06,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9972 to 9968. [2024-10-11 00:00:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9968 states, 9967 states have (on average 1.3901876191431726) internal successors, (13856), 9967 states have internal predecessors, (13856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 13856 transitions. [2024-10-11 00:00:06,870 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 13856 transitions. Word has length 590 [2024-10-11 00:00:06,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:06,872 INFO L471 AbstractCegarLoop]: Abstraction has 9968 states and 13856 transitions. [2024-10-11 00:00:06,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 13856 transitions. [2024-10-11 00:00:06,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2024-10-11 00:00:06,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:06,887 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:06,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 00:00:06,888 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:06,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:06,889 INFO L85 PathProgramCache]: Analyzing trace with hash -777315966, now seen corresponding path program 1 times [2024-10-11 00:00:06,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:06,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679613143] [2024-10-11 00:00:06,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:06,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-11 00:00:07,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:07,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679613143] [2024-10-11 00:00:07,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679613143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:07,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:07,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:00:07,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826487670] [2024-10-11 00:00:07,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:07,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:00:07,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:07,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:00:07,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:07,540 INFO L87 Difference]: Start difference. First operand 9968 states and 13856 transitions. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:13,753 INFO L93 Difference]: Finished difference Result 26932 states and 38506 transitions. [2024-10-11 00:00:13,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:00:13,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 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 593 [2024-10-11 00:00:13,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:13,804 INFO L225 Difference]: With dead ends: 26932 [2024-10-11 00:00:13,805 INFO L226 Difference]: Without dead ends: 18330 [2024-10-11 00:00:13,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:13,822 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 2119 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 5114 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2119 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 5548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:13,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2119 Valid, 980 Invalid, 5548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5114 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-10-11 00:00:13,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18330 states. [2024-10-11 00:00:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18330 to 18328. [2024-10-11 00:00:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18328 states, 18327 states have (on average 1.378621705680144) internal successors, (25266), 18327 states have internal predecessors, (25266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18328 states to 18328 states and 25266 transitions. [2024-10-11 00:00:14,147 INFO L78 Accepts]: Start accepts. Automaton has 18328 states and 25266 transitions. Word has length 593 [2024-10-11 00:00:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:14,149 INFO L471 AbstractCegarLoop]: Abstraction has 18328 states and 25266 transitions. [2024-10-11 00:00:14,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 18328 states and 25266 transitions. [2024-10-11 00:00:14,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2024-10-11 00:00:14,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:14,163 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:14,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 00:00:14,163 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:14,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash 921332531, now seen corresponding path program 1 times [2024-10-11 00:00:14,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:14,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818678535] [2024-10-11 00:00:14,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:00:14,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:14,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818678535] [2024-10-11 00:00:14,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818678535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:14,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:14,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:00:14,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408031729] [2024-10-11 00:00:14,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:14,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:00:14,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:14,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:00:14,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:14,816 INFO L87 Difference]: Start difference. First operand 18328 states and 25266 transitions. Second operand has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:20,609 INFO L93 Difference]: Finished difference Result 43576 states and 60753 transitions. [2024-10-11 00:00:20,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:00:20,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 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 607 [2024-10-11 00:00:20,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:20,673 INFO L225 Difference]: With dead ends: 43576 [2024-10-11 00:00:20,673 INFO L226 Difference]: Without dead ends: 26614 [2024-10-11 00:00:20,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:20,706 INFO L432 NwaCegarLoop]: 3096 mSDtfsCounter, 1384 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 5007 mSolverCounterSat, 907 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 3269 SdHoareTripleChecker+Invalid, 5914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 907 IncrementalHoareTripleChecker+Valid, 5007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:20,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 3269 Invalid, 5914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [907 Valid, 5007 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-11 00:00:20,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26614 states. [2024-10-11 00:00:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26614 to 26553. [2024-10-11 00:00:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26553 states, 26552 states have (on average 1.3130460982223562) internal successors, (34864), 26552 states have internal predecessors, (34864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26553 states to 26553 states and 34864 transitions. [2024-10-11 00:00:21,137 INFO L78 Accepts]: Start accepts. Automaton has 26553 states and 34864 transitions. Word has length 607 [2024-10-11 00:00:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:21,138 INFO L471 AbstractCegarLoop]: Abstraction has 26553 states and 34864 transitions. [2024-10-11 00:00:21,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:21,139 INFO L276 IsEmpty]: Start isEmpty. Operand 26553 states and 34864 transitions. [2024-10-11 00:00:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2024-10-11 00:00:21,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:21,149 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:21,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 00:00:21,150 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:21,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:21,151 INFO L85 PathProgramCache]: Analyzing trace with hash -103630193, now seen corresponding path program 1 times [2024-10-11 00:00:21,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:21,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886572482] [2024-10-11 00:00:21,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:21,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-11 00:00:21,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:21,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886572482] [2024-10-11 00:00:21,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886572482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:21,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:21,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:00:21,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333902860] [2024-10-11 00:00:21,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:21,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:00:21,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:21,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:00:21,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:21,842 INFO L87 Difference]: Start difference. First operand 26553 states and 34864 transitions. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 2 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:27,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:27,771 INFO L93 Difference]: Finished difference Result 76526 states and 101355 transitions. [2024-10-11 00:00:27,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:00:27,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 2 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 616 [2024-10-11 00:00:27,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:27,855 INFO L225 Difference]: With dead ends: 76526 [2024-10-11 00:00:27,855 INFO L226 Difference]: Without dead ends: 51339 [2024-10-11 00:00:27,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:27,901 INFO L432 NwaCegarLoop]: 1778 mSDtfsCounter, 1351 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 4299 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 5729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:27,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 2047 Invalid, 5729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4299 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-11 00:00:27,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51339 states. [2024-10-11 00:00:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51339 to 49953. [2024-10-11 00:00:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49953 states, 49952 states have (on average 1.2075992953235106) internal successors, (60322), 49952 states have internal predecessors, (60322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49953 states to 49953 states and 60322 transitions. [2024-10-11 00:00:28,674 INFO L78 Accepts]: Start accepts. Automaton has 49953 states and 60322 transitions. Word has length 616 [2024-10-11 00:00:28,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:28,676 INFO L471 AbstractCegarLoop]: Abstraction has 49953 states and 60322 transitions. [2024-10-11 00:00:28,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 2 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 49953 states and 60322 transitions. [2024-10-11 00:00:28,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2024-10-11 00:00:28,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:28,683 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:28,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 00:00:28,683 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:28,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1123246932, now seen corresponding path program 1 times [2024-10-11 00:00:28,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:28,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870386388] [2024-10-11 00:00:28,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:28,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-10-11 00:00:29,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:29,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870386388] [2024-10-11 00:00:29,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870386388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:29,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:29,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:00:29,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242086677] [2024-10-11 00:00:29,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:29,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:00:29,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:29,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:00:29,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:29,252 INFO L87 Difference]: Start difference. First operand 49953 states and 60322 transitions. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:34,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:00:34,580 INFO L93 Difference]: Finished difference Result 114948 states and 140831 transitions. [2024-10-11 00:00:34,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:00:34,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 629 [2024-10-11 00:00:34,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:00:34,665 INFO L225 Difference]: With dead ends: 114948 [2024-10-11 00:00:34,665 INFO L226 Difference]: Without dead ends: 66361 [2024-10-11 00:00:34,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:00:34,697 INFO L432 NwaCegarLoop]: 3145 mSDtfsCounter, 1404 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 3750 mSolverCounterSat, 1637 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 3333 SdHoareTripleChecker+Invalid, 5387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1637 IncrementalHoareTripleChecker+Valid, 3750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-11 00:00:34,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 3333 Invalid, 5387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1637 Valid, 3750 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-11 00:00:34,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66361 states. [2024-10-11 00:00:35,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66361 to 63622. [2024-10-11 00:00:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63622 states, 63621 states have (on average 1.1817953191556247) internal successors, (75187), 63621 states have internal predecessors, (75187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:35,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63622 states to 63622 states and 75187 transitions. [2024-10-11 00:00:35,790 INFO L78 Accepts]: Start accepts. Automaton has 63622 states and 75187 transitions. Word has length 629 [2024-10-11 00:00:35,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:00:35,791 INFO L471 AbstractCegarLoop]: Abstraction has 63622 states and 75187 transitions. [2024-10-11 00:00:35,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:00:35,791 INFO L276 IsEmpty]: Start isEmpty. Operand 63622 states and 75187 transitions. [2024-10-11 00:00:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 823 [2024-10-11 00:00:35,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:00:35,800 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:00:35,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 00:00:35,800 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:00:35,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:00:35,803 INFO L85 PathProgramCache]: Analyzing trace with hash -420498759, now seen corresponding path program 1 times [2024-10-11 00:00:35,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:00:35,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532160903] [2024-10-11 00:00:35,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:00:35,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:00:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:00:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-10-11 00:00:36,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:00:36,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532160903] [2024-10-11 00:00:36,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532160903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:00:36,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:00:36,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:00:36,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858666923] [2024-10-11 00:00:36,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:00:36,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:00:36,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:00:36,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:00:36,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:00:36,890 INFO L87 Difference]: Start difference. First operand 63622 states and 75187 transitions. Second operand has 4 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)