./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_label26.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_label26.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 4ebd5aed45c5461e176385745bb70c1ebeb4378f3074685fcb814a1b840527ca --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:58:18,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:58:18,121 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:58:18,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:58:18,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:58:18,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:58:18,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:58:18,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:58:18,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:58:18,156 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:58:18,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:58:18,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:58:18,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:58:18,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:58:18,160 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:58:18,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:58:18,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:58:18,161 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:58:18,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:58:18,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:58:18,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:58:18,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:58:18,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:58:18,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:58:18,163 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:58:18,163 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:58:18,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:58:18,164 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:58:18,164 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:58:18,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:58:18,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:58:18,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:58:18,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:58:18,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:58:18,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:58:18,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:58:18,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:58:18,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:58:18,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:58:18,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:58:18,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:58:18,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:58:18,169 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 -> 4ebd5aed45c5461e176385745bb70c1ebeb4378f3074685fcb814a1b840527ca [2024-10-10 23:58:18,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:58:18,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:58:18,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:58:18,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:58:18,456 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:58:18,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label26.c [2024-10-10 23:58:19,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:58:20,544 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:58:20,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label26.c [2024-10-10 23:58:20,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/96bf23079/2475733446b642a7ad584bb22b872f58/FLAG87bc66b1d [2024-10-10 23:58:20,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/96bf23079/2475733446b642a7ad584bb22b872f58 [2024-10-10 23:58:20,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:58:20,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:58:20,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:58:20,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:58:20,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:58:20,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:58:20" (1/1) ... [2024-10-10 23:58:20,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302cd5d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:58:20, skipping insertion in model container [2024-10-10 23:58:20,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:58:20" (1/1) ... [2024-10-10 23:58:20,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:58:21,111 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_label26.c[3735,3748] [2024-10-10 23:58:22,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:58:22,290 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:58:22,312 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_label26.c[3735,3748] [2024-10-10 23:58:23,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:58:23,124 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:58:23,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:58:23 WrapperNode [2024-10-10 23:58:23,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:58:23,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:58:23,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:58:23,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:58:23,135 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:58:23" (1/1) ... [2024-10-10 23:58:23,224 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:58:23" (1/1) ... [2024-10-10 23:58:23,948 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9431 [2024-10-10 23:58:23,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:58:23,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:58:23,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:58:23,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:58:23,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:58:23" (1/1) ... [2024-10-10 23:58:23,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:58:23" (1/1) ... [2024-10-10 23:58:24,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:58:23" (1/1) ... [2024-10-10 23:58:24,476 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:58:24,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:58:23" (1/1) ... [2024-10-10 23:58:24,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:58:23" (1/1) ... [2024-10-10 23:58:24,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:58:23" (1/1) ... [2024-10-10 23:58:24,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:58:23" (1/1) ... [2024-10-10 23:58:24,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:58:23" (1/1) ... [2024-10-10 23:58:24,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:58:23" (1/1) ... [2024-10-10 23:58:25,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:58:25,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:58:25,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:58:25,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:58:25,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:58:23" (1/1) ... [2024-10-10 23:58:25,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:58:25,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:58:25,252 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:58:25,258 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:58:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:58:25,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:58:25,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:58:25,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:58:25,405 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:58:25,408 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:58:33,405 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2024-10-10 23:58:33,406 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:58:33,493 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:58:33,493 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:58:33,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:58:33 BoogieIcfgContainer [2024-10-10 23:58:33,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:58:33,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:58:33,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:58:33,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:58:33,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:58:20" (1/3) ... [2024-10-10 23:58:33,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216087a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:58:33, skipping insertion in model container [2024-10-10 23:58:33,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:58:23" (2/3) ... [2024-10-10 23:58:33,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216087a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:58:33, skipping insertion in model container [2024-10-10 23:58:33,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:58:33" (3/3) ... [2024-10-10 23:58:33,504 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem19_label26.c [2024-10-10 23:58:33,522 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:58:33,522 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:58:33,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:58:33,647 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;@391d91db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:58:33,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:58:33,659 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:58:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-10 23:58:33,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:33,668 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] [2024-10-10 23:58:33,669 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:33,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:33,674 INFO L85 PathProgramCache]: Analyzing trace with hash -989768492, now seen corresponding path program 1 times [2024-10-10 23:58:33,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:33,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105618078] [2024-10-10 23:58:33,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:33,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:33,884 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:58:33,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:33,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105618078] [2024-10-10 23:58:33,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105618078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:33,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:33,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:58:33,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212316] [2024-10-10 23:58:33,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:33,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:58:33,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:33,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:58:33,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:58:33,930 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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:58:34,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:34,047 INFO L93 Difference]: Finished difference Result 3371 states and 6405 transitions. [2024-10-10 23:58:34,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:58:34,049 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-10 23:58:34,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:34,074 INFO L225 Difference]: With dead ends: 3371 [2024-10-10 23:58:34,074 INFO L226 Difference]: Without dead ends: 1684 [2024-10-10 23:58:34,087 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:58:34,092 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:58:34,093 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:58:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2024-10-10 23:58:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2024-10-10 23:58:34,198 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:58:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2024-10-10 23:58:34,217 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 25 [2024-10-10 23:58:34,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:34,217 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2024-10-10 23:58:34,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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:58:34,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2024-10-10 23:58:34,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-10 23:58:34,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:34,218 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] [2024-10-10 23:58:34,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:58:34,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:34,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:34,222 INFO L85 PathProgramCache]: Analyzing trace with hash 378612451, now seen corresponding path program 1 times [2024-10-10 23:58:34,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:34,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003862449] [2024-10-10 23:58:34,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:34,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:34,377 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:58:34,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:34,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003862449] [2024-10-10 23:58:34,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003862449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:34,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:34,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:58:34,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315961225] [2024-10-10 23:58:34,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:34,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:58:34,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:34,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:58:34,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:58:34,384 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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:58:40,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:40,971 INFO L93 Difference]: Finished difference Result 4862 states and 9131 transitions. [2024-10-10 23:58:40,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:58:40,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-10 23:58:40,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:40,988 INFO L225 Difference]: With dead ends: 4862 [2024-10-10 23:58:40,989 INFO L226 Difference]: Without dead ends: 3179 [2024-10-10 23:58:40,994 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:58:40,996 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 1622 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 4141 mSolverCounterSat, 2020 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 6161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2020 IncrementalHoareTripleChecker+Valid, 4141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:40,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1622 Valid, 1110 Invalid, 6161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2020 Valid, 4141 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-10-10 23:58:41,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2024-10-10 23:58:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 3121. [2024-10-10 23:58:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 3120 states have (on average 1.728525641025641) internal successors, (5393), 3120 states have internal predecessors, (5393), 0 states have call successors, (0), 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:58:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 5393 transitions. [2024-10-10 23:58:41,090 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 5393 transitions. Word has length 25 [2024-10-10 23:58:41,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:41,091 INFO L471 AbstractCegarLoop]: Abstraction has 3121 states and 5393 transitions. [2024-10-10 23:58:41,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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:58:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 5393 transitions. [2024-10-10 23:58:41,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-10 23:58:41,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:41,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:41,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:58:41,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:41,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:41,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1422873151, now seen corresponding path program 1 times [2024-10-10 23:58:41,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:41,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913570218] [2024-10-10 23:58:41,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:41,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:41,315 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:58:41,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:41,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913570218] [2024-10-10 23:58:41,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913570218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:41,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:41,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:58:41,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642557515] [2024-10-10 23:58:41,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:41,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:58:41,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:41,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:58:41,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:58:41,319 INFO L87 Difference]: Start difference. First operand 3121 states and 5393 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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:58:47,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:47,574 INFO L93 Difference]: Finished difference Result 9134 states and 15859 transitions. [2024-10-10 23:58:47,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:58:47,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-10-10 23:58:47,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:47,596 INFO L225 Difference]: With dead ends: 9134 [2024-10-10 23:58:47,596 INFO L226 Difference]: Without dead ends: 6014 [2024-10-10 23:58:47,600 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:58:47,601 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 2533 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 5119 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 5553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:47,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 990 Invalid, 5553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5119 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-10 23:58:47,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2024-10-10 23:58:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 6012. [2024-10-10 23:58:47,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 6011 states have (on average 1.6709366162036268) internal successors, (10044), 6011 states have internal predecessors, (10044), 0 states have call successors, (0), 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:58:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 10044 transitions. [2024-10-10 23:58:47,715 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 10044 transitions. Word has length 93 [2024-10-10 23:58:47,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:47,716 INFO L471 AbstractCegarLoop]: Abstraction has 6012 states and 10044 transitions. [2024-10-10 23:58:47,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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:58:47,720 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 10044 transitions. [2024-10-10 23:58:47,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-10 23:58:47,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:47,722 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:47,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:58:47,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:47,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:47,725 INFO L85 PathProgramCache]: Analyzing trace with hash 49676604, now seen corresponding path program 1 times [2024-10-10 23:58:47,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:47,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763397004] [2024-10-10 23:58:47,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:47,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:58:47,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:47,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763397004] [2024-10-10 23:58:47,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763397004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:47,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:47,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:58:47,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635867922] [2024-10-10 23:58:47,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:47,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:58:47,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:47,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:58:47,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:58:47,885 INFO L87 Difference]: Start difference. First operand 6012 states and 10044 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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:58:53,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:53,582 INFO L93 Difference]: Finished difference Result 17597 states and 29554 transitions. [2024-10-10 23:58:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:58:53,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-10 23:58:53,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:58:53,624 INFO L225 Difference]: With dead ends: 17597 [2024-10-10 23:58:53,624 INFO L226 Difference]: Without dead ends: 11586 [2024-10-10 23:58:53,634 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:58:53,635 INFO L432 NwaCegarLoop]: 1497 mSDtfsCounter, 1534 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4336 mSolverCounterSat, 1470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 5806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1470 IncrementalHoareTripleChecker+Valid, 4336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:58:53,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 1716 Invalid, 5806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1470 Valid, 4336 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-10 23:58:53,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11586 states. [2024-10-10 23:58:53,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11586 to 11551. [2024-10-10 23:58:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11551 states, 11550 states have (on average 1.4577489177489178) internal successors, (16837), 11550 states have internal predecessors, (16837), 0 states have call successors, (0), 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:58:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11551 states to 11551 states and 16837 transitions. [2024-10-10 23:58:53,852 INFO L78 Accepts]: Start accepts. Automaton has 11551 states and 16837 transitions. Word has length 96 [2024-10-10 23:58:53,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:58:53,853 INFO L471 AbstractCegarLoop]: Abstraction has 11551 states and 16837 transitions. [2024-10-10 23:58:53,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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:58:53,854 INFO L276 IsEmpty]: Start isEmpty. Operand 11551 states and 16837 transitions. [2024-10-10 23:58:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-10 23:58:53,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:58:53,861 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:53,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:58:53,861 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:58:53,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:58:53,862 INFO L85 PathProgramCache]: Analyzing trace with hash 918498637, now seen corresponding path program 1 times [2024-10-10 23:58:53,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:58:53,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9052099] [2024-10-10 23:58:53,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:58:53,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:58:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:58:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:58:54,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:58:54,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9052099] [2024-10-10 23:58:54,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9052099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:58:54,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:58:54,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:58:54,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438326285] [2024-10-10 23:58:54,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:58:54,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:58:54,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:58:54,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:58:54,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:58:54,095 INFO L87 Difference]: Start difference. First operand 11551 states and 16837 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:58:59,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:58:59,961 INFO L93 Difference]: Finished difference Result 34261 states and 50006 transitions. [2024-10-10 23:58:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:58:59,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-10-10 23:58:59,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:59:00,017 INFO L225 Difference]: With dead ends: 34261 [2024-10-10 23:59:00,017 INFO L226 Difference]: Without dead ends: 22711 [2024-10-10 23:59:00,038 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:00,040 INFO L432 NwaCegarLoop]: 1848 mSDtfsCounter, 1750 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 4316 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 2121 SdHoareTripleChecker+Invalid, 5746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:59:00,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 2121 Invalid, 5746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4316 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-10-10 23:59:00,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22711 states. [2024-10-10 23:59:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22711 to 22686. [2024-10-10 23:59:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22686 states, 22685 states have (on average 1.281948424068768) internal successors, (29081), 22685 states have internal predecessors, (29081), 0 states have call successors, (0), 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:00,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22686 states to 22686 states and 29081 transitions. [2024-10-10 23:59:00,450 INFO L78 Accepts]: Start accepts. Automaton has 22686 states and 29081 transitions. Word has length 122 [2024-10-10 23:59:00,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:59:00,450 INFO L471 AbstractCegarLoop]: Abstraction has 22686 states and 29081 transitions. [2024-10-10 23:59:00,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:59:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 22686 states and 29081 transitions. [2024-10-10 23:59:00,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2024-10-10 23:59:00,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:59:00,458 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:59:00,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:59:00,458 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:59:00,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:59:00,459 INFO L85 PathProgramCache]: Analyzing trace with hash 940638309, now seen corresponding path program 1 times [2024-10-10 23:59:00,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:59:00,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445661954] [2024-10-10 23:59:00,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:59:00,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:59:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:59:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-10 23:59:01,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:59:01,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445661954] [2024-10-10 23:59:01,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445661954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:59:01,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:59:01,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:59:01,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916776968] [2024-10-10 23:59:01,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:59:01,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:59:01,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:59:01,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:59:01,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:59:01,722 INFO L87 Difference]: Start difference. First operand 22686 states and 29081 transitions. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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:09,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:59:09,845 INFO L93 Difference]: Finished difference Result 57743 states and 72060 transitions. [2024-10-10 23:59:09,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:59:09,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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 404 [2024-10-10 23:59:09,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:59:09,927 INFO L225 Difference]: With dead ends: 57743 [2024-10-10 23:59:09,927 INFO L226 Difference]: Without dead ends: 35058 [2024-10-10 23:59:09,950 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:09,953 INFO L432 NwaCegarLoop]: 1789 mSDtfsCounter, 3752 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 9617 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3752 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 9789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 9617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:59:09,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3752 Valid, 2146 Invalid, 9789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 9617 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-10-10 23:59:09,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35058 states. [2024-10-10 23:59:10,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35058 to 33648. [2024-10-10 23:59:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33648 states, 33647 states have (on average 1.2262608850714773) internal successors, (41260), 33647 states have internal predecessors, (41260), 0 states have call successors, (0), 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:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33648 states to 33648 states and 41260 transitions. [2024-10-10 23:59:10,383 INFO L78 Accepts]: Start accepts. Automaton has 33648 states and 41260 transitions. Word has length 404 [2024-10-10 23:59:10,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:59:10,385 INFO L471 AbstractCegarLoop]: Abstraction has 33648 states and 41260 transitions. [2024-10-10 23:59:10,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 33648 states and 41260 transitions. [2024-10-10 23:59:10,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2024-10-10 23:59:10,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:59:10,402 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:59:10,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:59:10,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:59:10,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:59:10,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1200894984, now seen corresponding path program 1 times [2024-10-10 23:59:10,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:59:10,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588247409] [2024-10-10 23:59:10,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:59:10,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:59:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:59:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 388 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-10 23:59:11,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:59:11,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588247409] [2024-10-10 23:59:11,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588247409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:59:11,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:59:11,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:59:11,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269450622] [2024-10-10 23:59:11,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:59:11,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:59:11,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:59:11,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:59:11,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:59:11,885 INFO L87 Difference]: Start difference. First operand 33648 states and 41260 transitions. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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:19,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:59:19,818 INFO L93 Difference]: Finished difference Result 90599 states and 108577 transitions. [2024-10-10 23:59:19,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:59:19,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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 611 [2024-10-10 23:59:19,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:59:19,901 INFO L225 Difference]: With dead ends: 90599 [2024-10-10 23:59:19,901 INFO L226 Difference]: Without dead ends: 56952 [2024-10-10 23:59:19,929 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:19,929 INFO L432 NwaCegarLoop]: 1747 mSDtfsCounter, 3757 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 9353 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3757 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 9615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 9353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:59:19,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3757 Valid, 2099 Invalid, 9615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 9353 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-10-10 23:59:19,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56952 states. [2024-10-10 23:59:20,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56952 to 52813. [2024-10-10 23:59:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52813 states, 52812 states have (on average 1.1742028326895402) internal successors, (62012), 52812 states have internal predecessors, (62012), 0 states have call successors, (0), 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:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52813 states to 52813 states and 62012 transitions. [2024-10-10 23:59:20,551 INFO L78 Accepts]: Start accepts. Automaton has 52813 states and 62012 transitions. Word has length 611 [2024-10-10 23:59:20,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:59:20,552 INFO L471 AbstractCegarLoop]: Abstraction has 52813 states and 62012 transitions. [2024-10-10 23:59:20,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 52813 states and 62012 transitions. [2024-10-10 23:59:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2024-10-10 23:59:20,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:59:20,567 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:59:20,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:59:20,567 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:59:20,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:59:20,568 INFO L85 PathProgramCache]: Analyzing trace with hash -741880866, now seen corresponding path program 1 times [2024-10-10 23:59:20,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:59:20,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5807105] [2024-10-10 23:59:20,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:59:20,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:59:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:59:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 608 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2024-10-10 23:59:21,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:59:21,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5807105] [2024-10-10 23:59:21,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5807105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:59:21,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:59:21,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:59:21,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311912260] [2024-10-10 23:59:21,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:59:21,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:59:21,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:59:21,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:59:21,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:59:21,708 INFO L87 Difference]: Start difference. First operand 52813 states and 62012 transitions. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:59:27,057 INFO L93 Difference]: Finished difference Result 108386 states and 126802 transitions. [2024-10-10 23:59:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:59:27,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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 639 [2024-10-10 23:59:27,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:59:27,130 INFO L225 Difference]: With dead ends: 108386 [2024-10-10 23:59:27,130 INFO L226 Difference]: Without dead ends: 55543 [2024-10-10 23:59:27,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:59:27,154 INFO L432 NwaCegarLoop]: 1766 mSDtfsCounter, 1151 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5714 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 5722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:59:27,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1944 Invalid, 5722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5714 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-10 23:59:27,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55543 states. [2024-10-10 23:59:27,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55543 to 55543. [2024-10-10 23:59:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55543 states, 55542 states have (on average 1.1657304382269273) internal successors, (64747), 55542 states have internal predecessors, (64747), 0 states have call successors, (0), 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:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55543 states to 55543 states and 64747 transitions. [2024-10-10 23:59:27,731 INFO L78 Accepts]: Start accepts. Automaton has 55543 states and 64747 transitions. Word has length 639 [2024-10-10 23:59:27,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:59:27,732 INFO L471 AbstractCegarLoop]: Abstraction has 55543 states and 64747 transitions. [2024-10-10 23:59:27,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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:27,732 INFO L276 IsEmpty]: Start isEmpty. Operand 55543 states and 64747 transitions. [2024-10-10 23:59:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2024-10-10 23:59:27,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:59:27,739 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:59:27,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:59:27,739 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:59:27,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:59:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1805162235, now seen corresponding path program 1 times [2024-10-10 23:59:27,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:59:27,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57347549] [2024-10-10 23:59:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:59:27,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:59:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:59:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-10-10 23:59:28,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:59:28,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57347549] [2024-10-10 23:59:28,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57347549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:59:28,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:59:28,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:59:28,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790153614] [2024-10-10 23:59:28,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:59:28,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:59:28,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:59:28,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:59:28,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:59:28,515 INFO L87 Difference]: Start difference. First operand 55543 states and 64747 transitions. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:59:34,409 INFO L93 Difference]: Finished difference Result 134342 states and 159875 transitions. [2024-10-10 23:59:34,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:59:34,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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 724 [2024-10-10 23:59:34,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:59:34,502 INFO L225 Difference]: With dead ends: 134342 [2024-10-10 23:59:34,502 INFO L226 Difference]: Without dead ends: 81530 [2024-10-10 23:59:34,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:59:34,531 INFO L432 NwaCegarLoop]: 3118 mSDtfsCounter, 1392 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 4624 mSolverCounterSat, 1160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 5784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1160 IncrementalHoareTripleChecker+Valid, 4624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:59:34,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 3317 Invalid, 5784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1160 Valid, 4624 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-10 23:59:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81530 states. [2024-10-10 23:59:35,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81530 to 81512. [2024-10-10 23:59:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81512 states, 81511 states have (on average 1.133785624026205) internal successors, (92416), 81511 states have internal predecessors, (92416), 0 states have call successors, (0), 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:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81512 states to 81512 states and 92416 transitions. [2024-10-10 23:59:35,668 INFO L78 Accepts]: Start accepts. Automaton has 81512 states and 92416 transitions. Word has length 724 [2024-10-10 23:59:35,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:59:35,669 INFO L471 AbstractCegarLoop]: Abstraction has 81512 states and 92416 transitions. [2024-10-10 23:59:35,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 81512 states and 92416 transitions. [2024-10-10 23:59:35,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2024-10-10 23:59:35,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:59:35,675 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:59:35,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:59:35,676 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:59:35,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:59:35,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1215316658, now seen corresponding path program 1 times [2024-10-10 23:59:35,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:59:35,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013027838] [2024-10-10 23:59:35,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:59:35,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:59:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat