./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/Problem17_label25.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/Problem17_label25.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 244b722e357e7e628c9da22f49af73d4219044ff60ec5c18a778f01607618372 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:46:26,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:46:26,221 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:46:26,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:46:26,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:46:26,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:46:26,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:46:26,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:46:26,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:46:26,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:46:26,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:46:26,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:46:26,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:46:26,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:46:26,260 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:46:26,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:46:26,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:46:26,261 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:46:26,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:46:26,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:46:26,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:46:26,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:46:26,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:46:26,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:46:26,265 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:46:26,266 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:46:26,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:46:26,266 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:46:26,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:46:26,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:46:26,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:46:26,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:46:26,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:46:26,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:46:26,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:46:26,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:46:26,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:46:26,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:46:26,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:46:26,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:46:26,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:46:26,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:46:26,271 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 -> 244b722e357e7e628c9da22f49af73d4219044ff60ec5c18a778f01607618372 [2024-10-10 23:46:26,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:46:26,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:46:26,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:46:26,567 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:46:26,567 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:46:26,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label25.c [2024-10-10 23:46:28,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:46:28,437 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:46:28,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label25.c [2024-10-10 23:46:28,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/96eb8f96b/868c58ba43bf4142b88742016c3e6ac3/FLAG7a54f5ac5 [2024-10-10 23:46:28,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/96eb8f96b/868c58ba43bf4142b88742016c3e6ac3 [2024-10-10 23:46:28,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:46:28,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:46:28,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:46:28,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:46:28,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:46:28,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:46:28" (1/1) ... [2024-10-10 23:46:28,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7da813f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:28, skipping insertion in model container [2024-10-10 23:46:28,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:46:28" (1/1) ... [2024-10-10 23:46:28,769 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:46:29,022 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/Problem17_label25.c[3642,3655] [2024-10-10 23:46:29,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:46:29,553 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:46:29,579 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/Problem17_label25.c[3642,3655] [2024-10-10 23:46:29,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:46:29,886 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:46:29,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:29 WrapperNode [2024-10-10 23:46:29,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:46:29,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:46:29,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:46:29,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:46:29,895 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:46:29" (1/1) ... [2024-10-10 23:46:29,952 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:46:29" (1/1) ... [2024-10-10 23:46:30,225 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-10 23:46:30,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:46:30,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:46:30,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:46:30,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:46:30,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:29" (1/1) ... [2024-10-10 23:46:30,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:29" (1/1) ... [2024-10-10 23:46:30,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:29" (1/1) ... [2024-10-10 23:46:30,512 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:46:30,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:29" (1/1) ... [2024-10-10 23:46:30,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:29" (1/1) ... [2024-10-10 23:46:30,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:29" (1/1) ... [2024-10-10 23:46:30,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:29" (1/1) ... [2024-10-10 23:46:30,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:29" (1/1) ... [2024-10-10 23:46:30,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:29" (1/1) ... [2024-10-10 23:46:30,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:46:30,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:46:30,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:46:30,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:46:30,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:29" (1/1) ... [2024-10-10 23:46:30,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:46:30,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:46:30,796 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:46:30,798 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:46:30,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:46:30,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:46:30,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:46:30,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:46:30,900 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:46:30,902 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:46:34,125 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-10 23:46:34,125 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:46:34,203 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:46:34,206 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:46:34,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:46:34 BoogieIcfgContainer [2024-10-10 23:46:34,208 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:46:34,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:46:34,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:46:34,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:46:34,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:46:28" (1/3) ... [2024-10-10 23:46:34,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d905bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:46:34, skipping insertion in model container [2024-10-10 23:46:34,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:46:29" (2/3) ... [2024-10-10 23:46:34,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d905bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:46:34, skipping insertion in model container [2024-10-10 23:46:34,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:46:34" (3/3) ... [2024-10-10 23:46:34,219 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label25.c [2024-10-10 23:46:34,237 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:46:34,237 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:46:34,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:46:34,342 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;@1a5a559c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:46:34,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:46:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 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:46:34,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-10 23:46:34,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:34,360 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] [2024-10-10 23:46:34,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:34,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:34,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1538132335, now seen corresponding path program 1 times [2024-10-10 23:46:34,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:34,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399683911] [2024-10-10 23:46:34,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:34,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:34,566 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:46:34,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:34,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399683911] [2024-10-10 23:46:34,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399683911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:34,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:34,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:34,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746037148] [2024-10-10 23:46:34,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:34,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:46:34,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:34,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:46:34,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:46:34,602 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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:46:34,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:34,687 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-10 23:46:34,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:46:34,694 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-10 23:46:34,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:34,710 INFO L225 Difference]: With dead ends: 1055 [2024-10-10 23:46:34,710 INFO L226 Difference]: Without dead ends: 526 [2024-10-10 23:46:34,716 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:46:34,723 INFO L432 NwaCegarLoop]: 935 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, 935 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:46:34,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:46:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-10 23:46:34,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-10 23:46:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 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:46:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-10 23:46:34,825 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 22 [2024-10-10 23:46:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:34,826 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-10 23:46:34,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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:46:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-10 23:46:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-10 23:46:34,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:34,828 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] [2024-10-10 23:46:34,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:46:34,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:34,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:34,830 INFO L85 PathProgramCache]: Analyzing trace with hash 413992905, now seen corresponding path program 1 times [2024-10-10 23:46:34,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:34,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598111067] [2024-10-10 23:46:34,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:34,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:34,981 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:46:34,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:34,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598111067] [2024-10-10 23:46:34,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598111067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:34,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:34,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:34,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272351359] [2024-10-10 23:46:34,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:34,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:34,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:34,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:34,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:34,989 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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:46:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:37,167 INFO L93 Difference]: Finished difference Result 1501 states and 2698 transitions. [2024-10-10 23:46:37,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:37,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-10 23:46:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:37,173 INFO L225 Difference]: With dead ends: 1501 [2024-10-10 23:46:37,174 INFO L226 Difference]: Without dead ends: 976 [2024-10-10 23:46:37,176 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:46:37,177 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 449 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:37,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 448 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:46:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-10 23:46:37,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 970. [2024-10-10 23:46:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5541795665634675) internal successors, (1506), 969 states have internal predecessors, (1506), 0 states have call successors, (0), 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:46:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1506 transitions. [2024-10-10 23:46:37,231 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1506 transitions. Word has length 22 [2024-10-10 23:46:37,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:37,231 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1506 transitions. [2024-10-10 23:46:37,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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:46:37,232 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1506 transitions. [2024-10-10 23:46:37,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-10 23:46:37,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:37,234 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:46:37,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:46:37,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:37,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:37,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1995396162, now seen corresponding path program 1 times [2024-10-10 23:46:37,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:37,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108329632] [2024-10-10 23:46:37,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:37,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:37,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:37,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108329632] [2024-10-10 23:46:37,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108329632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:37,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:37,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:37,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552693267] [2024-10-10 23:46:37,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:37,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:37,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:37,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:37,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:37,490 INFO L87 Difference]: Start difference. First operand 970 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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:46:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:39,521 INFO L93 Difference]: Finished difference Result 2812 states and 4380 transitions. [2024-10-10 23:46:39,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:39,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-10 23:46:39,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:39,530 INFO L225 Difference]: With dead ends: 2812 [2024-10-10 23:46:39,530 INFO L226 Difference]: Without dead ends: 1843 [2024-10-10 23:46:39,533 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:46:39,536 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:39,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 577 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:46:39,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-10-10 23:46:39,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1840. [2024-10-10 23:46:39,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3501903208265362) internal successors, (2483), 1839 states have internal predecessors, (2483), 0 states have call successors, (0), 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:46:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2483 transitions. [2024-10-10 23:46:39,587 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2483 transitions. Word has length 89 [2024-10-10 23:46:39,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:39,588 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2483 transitions. [2024-10-10 23:46:39,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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:46:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2483 transitions. [2024-10-10 23:46:39,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-10 23:46:39,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:39,593 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:39,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:46:39,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:39,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:39,595 INFO L85 PathProgramCache]: Analyzing trace with hash -8549380, now seen corresponding path program 1 times [2024-10-10 23:46:39,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:39,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951990698] [2024-10-10 23:46:39,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:39,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:39,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:39,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951990698] [2024-10-10 23:46:39,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951990698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:39,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:39,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:39,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482620924] [2024-10-10 23:46:39,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:39,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:39,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:39,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:39,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:39,869 INFO L87 Difference]: Start difference. First operand 1840 states and 2483 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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:46:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:42,182 INFO L93 Difference]: Finished difference Result 4551 states and 6281 transitions. [2024-10-10 23:46:42,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:42,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-10 23:46:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:42,194 INFO L225 Difference]: With dead ends: 4551 [2024-10-10 23:46:42,194 INFO L226 Difference]: Without dead ends: 2712 [2024-10-10 23:46:42,198 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:46:42,199 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 484 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:42,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 883 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:46:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2024-10-10 23:46:42,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2710. [2024-10-10 23:46:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2709 states have (on average 1.3004798818752308) internal successors, (3523), 2709 states have internal predecessors, (3523), 0 states have call successors, (0), 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:46:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3523 transitions. [2024-10-10 23:46:42,246 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3523 transitions. Word has length 92 [2024-10-10 23:46:42,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:42,247 INFO L471 AbstractCegarLoop]: Abstraction has 2710 states and 3523 transitions. [2024-10-10 23:46:42,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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:46:42,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3523 transitions. [2024-10-10 23:46:42,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-10 23:46:42,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:42,251 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:42,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:46:42,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:42,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:42,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1059193644, now seen corresponding path program 1 times [2024-10-10 23:46:42,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:42,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894726561] [2024-10-10 23:46:42,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:42,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-10 23:46:42,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:42,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894726561] [2024-10-10 23:46:42,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894726561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:42,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:42,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:46:42,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099733774] [2024-10-10 23:46:42,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:42,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:42,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:42,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:42,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:42,538 INFO L87 Difference]: Start difference. First operand 2710 states and 3523 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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:46:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:44,287 INFO L93 Difference]: Finished difference Result 7983 states and 10360 transitions. [2024-10-10 23:46:44,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:44,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 161 [2024-10-10 23:46:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:44,304 INFO L225 Difference]: With dead ends: 7983 [2024-10-10 23:46:44,305 INFO L226 Difference]: Without dead ends: 4420 [2024-10-10 23:46:44,312 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:46:44,314 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:44,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:46:44,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4420 states. [2024-10-10 23:46:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4420 to 3570. [2024-10-10 23:46:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3570 states, 3569 states have (on average 1.177640795741104) internal successors, (4203), 3569 states have internal predecessors, (4203), 0 states have call successors, (0), 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:46:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 4203 transitions. [2024-10-10 23:46:44,379 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 4203 transitions. Word has length 161 [2024-10-10 23:46:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:44,380 INFO L471 AbstractCegarLoop]: Abstraction has 3570 states and 4203 transitions. [2024-10-10 23:46:44,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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:46:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 4203 transitions. [2024-10-10 23:46:44,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-10 23:46:44,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:44,382 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:44,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:46:44,383 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:44,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:44,383 INFO L85 PathProgramCache]: Analyzing trace with hash -961544538, now seen corresponding path program 1 times [2024-10-10 23:46:44,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:44,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63847099] [2024-10-10 23:46:44,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:44,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:44,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63847099] [2024-10-10 23:46:44,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63847099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:44,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:44,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:44,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982781203] [2024-10-10 23:46:44,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:44,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:44,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:44,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:44,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:44,621 INFO L87 Difference]: Start difference. First operand 3570 states and 4203 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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:46:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:46,138 INFO L93 Difference]: Finished difference Result 9272 states and 11086 transitions. [2024-10-10 23:46:46,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:46,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2024-10-10 23:46:46,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:46,157 INFO L225 Difference]: With dead ends: 9272 [2024-10-10 23:46:46,157 INFO L226 Difference]: Without dead ends: 5703 [2024-10-10 23:46:46,163 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:46:46,164 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:46,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 781 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:46:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2024-10-10 23:46:46,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 5703. [2024-10-10 23:46:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5703 states, 5702 states have (on average 1.1595931252192213) internal successors, (6612), 5702 states have internal predecessors, (6612), 0 states have call successors, (0), 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:46:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5703 states to 5703 states and 6612 transitions. [2024-10-10 23:46:46,263 INFO L78 Accepts]: Start accepts. Automaton has 5703 states and 6612 transitions. Word has length 174 [2024-10-10 23:46:46,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:46,267 INFO L471 AbstractCegarLoop]: Abstraction has 5703 states and 6612 transitions. [2024-10-10 23:46:46,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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:46:46,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 6612 transitions. [2024-10-10 23:46:46,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-10 23:46:46,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:46,270 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:46,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:46:46,271 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:46,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:46,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2137519051, now seen corresponding path program 1 times [2024-10-10 23:46:46,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:46,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41533189] [2024-10-10 23:46:46,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:46,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:46:46,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:46,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41533189] [2024-10-10 23:46:46,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41533189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:46,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:46,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:46,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728454736] [2024-10-10 23:46:46,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:46,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:46,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:46,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:46,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:46,430 INFO L87 Difference]: Start difference. First operand 5703 states and 6612 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:48,040 INFO L93 Difference]: Finished difference Result 14375 states and 16775 transitions. [2024-10-10 23:46:48,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:48,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2024-10-10 23:46:48,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:48,062 INFO L225 Difference]: With dead ends: 14375 [2024-10-10 23:46:48,062 INFO L226 Difference]: Without dead ends: 8672 [2024-10-10 23:46:48,111 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:46:48,113 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 427 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:48,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 442 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:46:48,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8672 states. [2024-10-10 23:46:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8672 to 5676. [2024-10-10 23:46:48,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5676 states, 5675 states have (on average 1.157885462555066) internal successors, (6571), 5675 states have internal predecessors, (6571), 0 states have call successors, (0), 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:46:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5676 states to 5676 states and 6571 transitions. [2024-10-10 23:46:48,202 INFO L78 Accepts]: Start accepts. Automaton has 5676 states and 6571 transitions. Word has length 176 [2024-10-10 23:46:48,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:48,202 INFO L471 AbstractCegarLoop]: Abstraction has 5676 states and 6571 transitions. [2024-10-10 23:46:48,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:46:48,203 INFO L276 IsEmpty]: Start isEmpty. Operand 5676 states and 6571 transitions. [2024-10-10 23:46:48,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-10 23:46:48,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:48,206 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:48,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:46:48,206 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:48,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:48,207 INFO L85 PathProgramCache]: Analyzing trace with hash 78038217, now seen corresponding path program 1 times [2024-10-10 23:46:48,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:48,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032692957] [2024-10-10 23:46:48,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:48,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-10 23:46:48,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:48,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032692957] [2024-10-10 23:46:48,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032692957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:48,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:48,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:48,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543573919] [2024-10-10 23:46:48,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:48,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:48,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:48,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:48,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:48,399 INFO L87 Difference]: Start difference. First operand 5676 states and 6571 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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:46:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:49,922 INFO L93 Difference]: Finished difference Result 14314 states and 16679 transitions. [2024-10-10 23:46:49,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:49,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 254 [2024-10-10 23:46:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:49,945 INFO L225 Difference]: With dead ends: 14314 [2024-10-10 23:46:49,945 INFO L226 Difference]: Without dead ends: 7789 [2024-10-10 23:46:49,953 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:46:49,957 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 383 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:49,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 844 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:46:49,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7789 states. [2024-10-10 23:46:50,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7789 to 7789. [2024-10-10 23:46:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7789 states, 7788 states have (on average 1.11864406779661) internal successors, (8712), 7788 states have internal predecessors, (8712), 0 states have call successors, (0), 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:46:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7789 states to 7789 states and 8712 transitions. [2024-10-10 23:46:50,150 INFO L78 Accepts]: Start accepts. Automaton has 7789 states and 8712 transitions. Word has length 254 [2024-10-10 23:46:50,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:50,150 INFO L471 AbstractCegarLoop]: Abstraction has 7789 states and 8712 transitions. [2024-10-10 23:46:50,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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:46:50,151 INFO L276 IsEmpty]: Start isEmpty. Operand 7789 states and 8712 transitions. [2024-10-10 23:46:50,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2024-10-10 23:46:50,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:50,157 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:50,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:46:50,158 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:50,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:50,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1074751524, now seen corresponding path program 1 times [2024-10-10 23:46:50,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:50,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759523323] [2024-10-10 23:46:50,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:50,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-10 23:46:50,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:50,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759523323] [2024-10-10 23:46:50,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759523323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:50,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:50,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:50,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104650501] [2024-10-10 23:46:50,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:50,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:50,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:50,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:50,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:50,438 INFO L87 Difference]: Start difference. First operand 7789 states and 8712 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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:46:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:52,222 INFO L93 Difference]: Finished difference Result 18557 states and 20948 transitions. [2024-10-10 23:46:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:46:52,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 294 [2024-10-10 23:46:52,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:52,247 INFO L225 Difference]: With dead ends: 18557 [2024-10-10 23:46:52,248 INFO L226 Difference]: Without dead ends: 10769 [2024-10-10 23:46:52,257 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:46:52,258 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 481 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:52,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 328 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:46:52,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10769 states. [2024-10-10 23:46:52,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10769 to 9915. [2024-10-10 23:46:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9915 states, 9914 states have (on average 1.1232600363122855) internal successors, (11136), 9914 states have internal predecessors, (11136), 0 states have call successors, (0), 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:46:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9915 states to 9915 states and 11136 transitions. [2024-10-10 23:46:52,405 INFO L78 Accepts]: Start accepts. Automaton has 9915 states and 11136 transitions. Word has length 294 [2024-10-10 23:46:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:52,406 INFO L471 AbstractCegarLoop]: Abstraction has 9915 states and 11136 transitions. [2024-10-10 23:46:52,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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:46:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 9915 states and 11136 transitions. [2024-10-10 23:46:52,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-10-10 23:46:52,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:52,412 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:52,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:46:52,413 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:52,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:52,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1255848112, now seen corresponding path program 1 times [2024-10-10 23:46:52,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:52,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055960707] [2024-10-10 23:46:52,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:52,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 41 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:53,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:53,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055960707] [2024-10-10 23:46:53,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055960707] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:46:53,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419449605] [2024-10-10 23:46:53,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:53,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:46:53,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:46:53,036 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:46:53,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:46:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:53,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 23:46:53,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:46:53,751 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 21 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:53,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:46:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:46:54,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419449605] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:46:54,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:46:54,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 7 [2024-10-10 23:46:54,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727623263] [2024-10-10 23:46:54,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:54,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:46:54,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:54,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:46:54,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:46:54,236 INFO L87 Difference]: Start difference. First operand 9915 states and 11136 transitions. Second operand has 5 states, 5 states have (on average 62.2) internal successors, (311), 4 states have internal predecessors, (311), 0 states have call successors, (0), 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:46:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:46:57,544 INFO L93 Difference]: Finished difference Result 32642 states and 37071 transitions. [2024-10-10 23:46:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:46:57,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 62.2) internal successors, (311), 4 states have internal predecessors, (311), 0 states have call successors, (0), 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 311 [2024-10-10 23:46:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:46:57,587 INFO L225 Difference]: With dead ends: 32642 [2024-10-10 23:46:57,587 INFO L226 Difference]: Without dead ends: 22299 [2024-10-10 23:46:57,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:46:57,604 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1543 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2816 mSolverCounterSat, 1038 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 3854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1038 IncrementalHoareTripleChecker+Valid, 2816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:46:57,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 217 Invalid, 3854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1038 Valid, 2816 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-10 23:46:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22299 states. [2024-10-10 23:46:57,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22299 to 20169. [2024-10-10 23:46:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20169 states, 20168 states have (on average 1.130999603332011) internal successors, (22810), 20168 states have internal predecessors, (22810), 0 states have call successors, (0), 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:46:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20169 states to 20169 states and 22810 transitions. [2024-10-10 23:46:57,911 INFO L78 Accepts]: Start accepts. Automaton has 20169 states and 22810 transitions. Word has length 311 [2024-10-10 23:46:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:46:57,912 INFO L471 AbstractCegarLoop]: Abstraction has 20169 states and 22810 transitions. [2024-10-10 23:46:57,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.2) internal successors, (311), 4 states have internal predecessors, (311), 0 states have call successors, (0), 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:46:57,912 INFO L276 IsEmpty]: Start isEmpty. Operand 20169 states and 22810 transitions. [2024-10-10 23:46:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-10 23:46:57,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:46:57,918 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:46:57,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:46:58,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-10 23:46:58,121 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:46:58,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:46:58,122 INFO L85 PathProgramCache]: Analyzing trace with hash 993600413, now seen corresponding path program 1 times [2024-10-10 23:46:58,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:46:58,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859352413] [2024-10-10 23:46:58,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:46:58,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:46:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:46:58,702 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:46:58,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:46:58,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859352413] [2024-10-10 23:46:58,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859352413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:46:58,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:46:58,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:46:58,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216113423] [2024-10-10 23:46:58,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:46:58,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:46:58,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:46:58,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:46:58,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:46:58,705 INFO L87 Difference]: Start difference. First operand 20169 states and 22810 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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:47:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:00,529 INFO L93 Difference]: Finished difference Result 49720 states and 56258 transitions. [2024-10-10 23:47:00,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:00,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 334 [2024-10-10 23:47:00,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:00,582 INFO L225 Difference]: With dead ends: 49720 [2024-10-10 23:47:00,582 INFO L226 Difference]: Without dead ends: 29552 [2024-10-10 23:47:00,603 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:47:00,604 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 435 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:00,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 877 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:47:00,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29552 states. [2024-10-10 23:47:00,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29552 to 27407. [2024-10-10 23:47:00,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27407 states, 27406 states have (on average 1.1210318908268262) internal successors, (30723), 27406 states have internal predecessors, (30723), 0 states have call successors, (0), 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:47:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27407 states to 27407 states and 30723 transitions. [2024-10-10 23:47:00,988 INFO L78 Accepts]: Start accepts. Automaton has 27407 states and 30723 transitions. Word has length 334 [2024-10-10 23:47:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:00,989 INFO L471 AbstractCegarLoop]: Abstraction has 27407 states and 30723 transitions. [2024-10-10 23:47:00,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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:47:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 27407 states and 30723 transitions. [2024-10-10 23:47:00,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-10-10 23:47:00,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:00,997 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-10 23:47:00,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:47:00,998 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:00,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:00,999 INFO L85 PathProgramCache]: Analyzing trace with hash -244847185, now seen corresponding path program 1 times [2024-10-10 23:47:00,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:00,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844590535] [2024-10-10 23:47:00,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:00,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:47:01,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:01,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844590535] [2024-10-10 23:47:01,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844590535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:01,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:01,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:01,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116187931] [2024-10-10 23:47:01,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:01,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:01,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:01,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:01,245 INFO L87 Difference]: Start difference. First operand 27407 states and 30723 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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:47:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:03,001 INFO L93 Difference]: Finished difference Result 68023 states and 76174 transitions. [2024-10-10 23:47:03,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:03,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 382 [2024-10-10 23:47:03,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:03,064 INFO L225 Difference]: With dead ends: 68023 [2024-10-10 23:47:03,064 INFO L226 Difference]: Without dead ends: 40617 [2024-10-10 23:47:03,089 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:47:03,090 INFO L432 NwaCegarLoop]: 710 mSDtfsCounter, 421 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:03,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 753 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:47:03,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40617 states. [2024-10-10 23:47:03,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40617 to 37614. [2024-10-10 23:47:03,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37614 states, 37613 states have (on average 1.1138967910031106) internal successors, (41897), 37613 states have internal predecessors, (41897), 0 states have call successors, (0), 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:47:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37614 states to 37614 states and 41897 transitions. [2024-10-10 23:47:03,535 INFO L78 Accepts]: Start accepts. Automaton has 37614 states and 41897 transitions. Word has length 382 [2024-10-10 23:47:03,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:03,535 INFO L471 AbstractCegarLoop]: Abstraction has 37614 states and 41897 transitions. [2024-10-10 23:47:03,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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:47:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 37614 states and 41897 transitions. [2024-10-10 23:47:03,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2024-10-10 23:47:03,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:03,546 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-10 23:47:03,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:47:03,547 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:03,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:03,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1688826673, now seen corresponding path program 1 times [2024-10-10 23:47:03,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:03,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003291523] [2024-10-10 23:47:03,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:47:04,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:04,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003291523] [2024-10-10 23:47:04,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003291523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:04,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:04,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:47:04,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586100376] [2024-10-10 23:47:04,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:04,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:47:04,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:04,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:47:04,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:47:04,165 INFO L87 Difference]: Start difference. First operand 37614 states and 41897 transitions. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 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:47:06,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:06,809 INFO L93 Difference]: Finished difference Result 99094 states and 109990 transitions. [2024-10-10 23:47:06,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:47:06,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 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:47:06,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:06,885 INFO L225 Difference]: With dead ends: 99094 [2024-10-10 23:47:06,885 INFO L226 Difference]: Without dead ends: 61481 [2024-10-10 23:47:06,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:47:06,910 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 729 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:06,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 184 Invalid, 2901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 2403 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:47:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61481 states. [2024-10-10 23:47:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61481 to 56362. [2024-10-10 23:47:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56362 states, 56361 states have (on average 1.1103600007097105) internal successors, (62581), 56361 states have internal predecessors, (62581), 0 states have call successors, (0), 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:47:07,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56362 states to 56362 states and 62581 transitions. [2024-10-10 23:47:07,508 INFO L78 Accepts]: Start accepts. Automaton has 56362 states and 62581 transitions. Word has length 404 [2024-10-10 23:47:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:07,509 INFO L471 AbstractCegarLoop]: Abstraction has 56362 states and 62581 transitions. [2024-10-10 23:47:07,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 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:47:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 56362 states and 62581 transitions. [2024-10-10 23:47:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-10-10 23:47:07,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:07,800 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:07,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:47:07,808 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:07,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:07,809 INFO L85 PathProgramCache]: Analyzing trace with hash 412683164, now seen corresponding path program 1 times [2024-10-10 23:47:07,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:07,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986121422] [2024-10-10 23:47:07,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:07,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:08,250 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-10 23:47:08,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:08,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986121422] [2024-10-10 23:47:08,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986121422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:08,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:08,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:08,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158167566] [2024-10-10 23:47:08,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:08,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:08,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:08,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:08,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:08,254 INFO L87 Difference]: Start difference. First operand 56362 states and 62581 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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:47:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:10,167 INFO L93 Difference]: Finished difference Result 123356 states and 137707 transitions. [2024-10-10 23:47:10,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:10,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 426 [2024-10-10 23:47:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:10,399 INFO L225 Difference]: With dead ends: 123356 [2024-10-10 23:47:10,403 INFO L226 Difference]: Without dead ends: 64429 [2024-10-10 23:47:10,459 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:47:10,460 INFO L432 NwaCegarLoop]: 659 mSDtfsCounter, 511 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:10,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 709 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:47:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64429 states. [2024-10-10 23:47:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64429 to 64420. [2024-10-10 23:47:11,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64420 states, 64419 states have (on average 1.1002033561526878) internal successors, (70874), 64419 states have internal predecessors, (70874), 0 states have call successors, (0), 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:47:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64420 states to 64420 states and 70874 transitions. [2024-10-10 23:47:11,511 INFO L78 Accepts]: Start accepts. Automaton has 64420 states and 70874 transitions. Word has length 426 [2024-10-10 23:47:11,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:11,512 INFO L471 AbstractCegarLoop]: Abstraction has 64420 states and 70874 transitions. [2024-10-10 23:47:11,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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:47:11,512 INFO L276 IsEmpty]: Start isEmpty. Operand 64420 states and 70874 transitions. [2024-10-10 23:47:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-10-10 23:47:11,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:11,524 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:11,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:47:11,524 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:11,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:11,525 INFO L85 PathProgramCache]: Analyzing trace with hash 320225370, now seen corresponding path program 1 times [2024-10-10 23:47:11,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:11,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085750057] [2024-10-10 23:47:11,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:11,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-10-10 23:47:12,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:12,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085750057] [2024-10-10 23:47:12,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085750057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:12,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:12,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:12,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703869240] [2024-10-10 23:47:12,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:12,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:12,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:12,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:12,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:12,042 INFO L87 Difference]: Start difference. First operand 64420 states and 70874 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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:47:13,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:13,899 INFO L93 Difference]: Finished difference Result 140767 states and 155005 transitions. [2024-10-10 23:47:13,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:13,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 471 [2024-10-10 23:47:13,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:13,985 INFO L225 Difference]: With dead ends: 140767 [2024-10-10 23:47:13,985 INFO L226 Difference]: Without dead ends: 73790 [2024-10-10 23:47:14,022 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:47:14,023 INFO L432 NwaCegarLoop]: 727 mSDtfsCounter, 436 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:14,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 782 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:47:14,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73790 states. [2024-10-10 23:47:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73790 to 72498. [2024-10-10 23:47:15,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72498 states, 72497 states have (on average 1.091589996827455) internal successors, (79137), 72497 states have internal predecessors, (79137), 0 states have call successors, (0), 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:47:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72498 states to 72498 states and 79137 transitions. [2024-10-10 23:47:15,107 INFO L78 Accepts]: Start accepts. Automaton has 72498 states and 79137 transitions. Word has length 471 [2024-10-10 23:47:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:15,108 INFO L471 AbstractCegarLoop]: Abstraction has 72498 states and 79137 transitions. [2024-10-10 23:47:15,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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:47:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 72498 states and 79137 transitions. [2024-10-10 23:47:15,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2024-10-10 23:47:15,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:15,333 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:47:15,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:47:15,334 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:15,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:15,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1694072045, now seen corresponding path program 1 times [2024-10-10 23:47:15,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:15,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132452571] [2024-10-10 23:47:15,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:15,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 299 proven. 82 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 23:47:16,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:16,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132452571] [2024-10-10 23:47:16,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132452571] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:47:16,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484568537] [2024-10-10 23:47:16,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:16,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:47:16,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:47:16,968 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:47:16,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:47:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:17,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 23:47:17,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:47:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 299 proven. 82 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 23:47:17,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:47:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 299 proven. 82 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 23:47:19,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484568537] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:47:19,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:47:19,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-10-10 23:47:19,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352274330] [2024-10-10 23:47:19,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:47:19,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 23:47:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:19,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 23:47:19,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-10 23:47:19,230 INFO L87 Difference]: Start difference. First operand 72498 states and 79137 transitions. Second operand has 10 states, 10 states have (on average 97.3) internal successors, (973), 9 states have internal predecessors, (973), 0 states have call successors, (0), 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:47:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:25,482 INFO L93 Difference]: Finished difference Result 188444 states and 205407 transitions. [2024-10-10 23:47:25,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 23:47:25,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 97.3) internal successors, (973), 9 states have internal predecessors, (973), 0 states have call successors, (0), 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 475 [2024-10-10 23:47:25,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:25,614 INFO L225 Difference]: With dead ends: 188444 [2024-10-10 23:47:25,614 INFO L226 Difference]: Without dead ends: 115947 [2024-10-10 23:47:25,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 956 GetRequests, 945 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-10-10 23:47:25,640 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 2770 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 7501 mSolverCounterSat, 950 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2770 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 8451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 950 IncrementalHoareTripleChecker+Valid, 7501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:25,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2770 Valid, 450 Invalid, 8451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [950 Valid, 7501 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-10 23:47:25,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115947 states. [2024-10-10 23:47:27,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115947 to 109134. [2024-10-10 23:47:27,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109134 states, 109133 states have (on average 1.0838059981857) internal successors, (118279), 109133 states have internal predecessors, (118279), 0 states have call successors, (0), 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:47:27,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109134 states to 109134 states and 118279 transitions. [2024-10-10 23:47:27,492 INFO L78 Accepts]: Start accepts. Automaton has 109134 states and 118279 transitions. Word has length 475 [2024-10-10 23:47:27,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:27,492 INFO L471 AbstractCegarLoop]: Abstraction has 109134 states and 118279 transitions. [2024-10-10 23:47:27,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 97.3) internal successors, (973), 9 states have internal predecessors, (973), 0 states have call successors, (0), 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:47:27,493 INFO L276 IsEmpty]: Start isEmpty. Operand 109134 states and 118279 transitions. [2024-10-10 23:47:27,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2024-10-10 23:47:27,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:27,501 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:27,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:47:27,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 23:47:27,702 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:27,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:27,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1733455588, now seen corresponding path program 1 times [2024-10-10 23:47:27,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:27,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304341351] [2024-10-10 23:47:27,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:27,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-10 23:47:28,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:28,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304341351] [2024-10-10 23:47:28,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304341351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:28,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:28,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:28,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301007030] [2024-10-10 23:47:28,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:28,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:28,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:28,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:28,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:28,733 INFO L87 Difference]: Start difference. First operand 109134 states and 118279 transitions. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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:47:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:30,901 INFO L93 Difference]: Finished difference Result 228928 states and 247907 transitions. [2024-10-10 23:47:30,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:30,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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 538 [2024-10-10 23:47:30,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:31,039 INFO L225 Difference]: With dead ends: 228928 [2024-10-10 23:47:31,040 INFO L226 Difference]: Without dead ends: 120645 [2024-10-10 23:47:31,098 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:47:31,098 INFO L432 NwaCegarLoop]: 709 mSDtfsCounter, 312 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:31,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 761 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:47:31,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120645 states. [2024-10-10 23:47:32,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120645 to 116796. [2024-10-10 23:47:32,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116796 states, 116795 states have (on average 1.0802345990838649) internal successors, (126166), 116795 states have internal predecessors, (126166), 0 states have call successors, (0), 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:47:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116796 states to 116796 states and 126166 transitions. [2024-10-10 23:47:33,117 INFO L78 Accepts]: Start accepts. Automaton has 116796 states and 126166 transitions. Word has length 538 [2024-10-10 23:47:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:33,118 INFO L471 AbstractCegarLoop]: Abstraction has 116796 states and 126166 transitions. [2024-10-10 23:47:33,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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:47:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 116796 states and 126166 transitions. [2024-10-10 23:47:33,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2024-10-10 23:47:33,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:33,126 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:33,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:47:33,126 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:33,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:33,127 INFO L85 PathProgramCache]: Analyzing trace with hash -287653876, now seen corresponding path program 1 times [2024-10-10 23:47:33,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:33,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394609866] [2024-10-10 23:47:33,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:33,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-10 23:47:33,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:33,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394609866] [2024-10-10 23:47:33,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394609866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:33,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:33,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:33,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762183663] [2024-10-10 23:47:33,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:33,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:33,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:33,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:33,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:33,862 INFO L87 Difference]: Start difference. First operand 116796 states and 126166 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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:47:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:35,762 INFO L93 Difference]: Finished difference Result 243820 states and 263711 transitions. [2024-10-10 23:47:35,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:35,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 551 [2024-10-10 23:47:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:36,323 INFO L225 Difference]: With dead ends: 243820 [2024-10-10 23:47:36,324 INFO L226 Difference]: Without dead ends: 127450 [2024-10-10 23:47:36,343 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:47:36,344 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 286 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:36,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 728 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:47:36,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127450 states. [2024-10-10 23:47:37,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127450 to 122337. [2024-10-10 23:47:37,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122337 states, 122336 states have (on average 1.076461548522103) internal successors, (131690), 122336 states have internal predecessors, (131690), 0 states have call successors, (0), 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:47:38,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122337 states to 122337 states and 131690 transitions. [2024-10-10 23:47:38,041 INFO L78 Accepts]: Start accepts. Automaton has 122337 states and 131690 transitions. Word has length 551 [2024-10-10 23:47:38,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:38,042 INFO L471 AbstractCegarLoop]: Abstraction has 122337 states and 131690 transitions. [2024-10-10 23:47:38,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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:47:38,042 INFO L276 IsEmpty]: Start isEmpty. Operand 122337 states and 131690 transitions. [2024-10-10 23:47:38,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2024-10-10 23:47:38,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:38,060 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:38,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:47:38,061 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:38,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:38,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1928044184, now seen corresponding path program 1 times [2024-10-10 23:47:38,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:38,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556233717] [2024-10-10 23:47:38,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:38,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-10-10 23:47:39,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:39,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556233717] [2024-10-10 23:47:39,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556233717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:39,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:39,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:39,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409649130] [2024-10-10 23:47:39,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:39,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:39,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:39,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:39,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:39,116 INFO L87 Difference]: Start difference. First operand 122337 states and 131690 transitions. Second operand has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)