./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label56.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label56.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77c0c06cf345be89a7bfdea692ab0197740d9f5ad98baaf39e02029ee2fea03a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:12:50,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:12:50,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:12:50,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:12:50,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:12:50,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:12:50,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:12:50,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:12:50,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:12:50,406 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:12:50,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:12:50,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:12:50,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:12:50,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:12:50,412 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:12:50,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:12:50,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:12:50,412 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:12:50,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:12:50,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:12:50,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:12:50,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:12:50,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:12:50,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:12:50,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:12:50,416 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:12:50,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:12:50,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:12:50,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:12:50,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:12:50,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:12:50,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:12:50,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:12:50,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:12:50,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:12:50,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:12:50,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:12:50,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:12:50,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:12:50,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:12:50,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:12:50,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:12:50,421 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77c0c06cf345be89a7bfdea692ab0197740d9f5ad98baaf39e02029ee2fea03a [2024-11-08 11:12:50,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:12:50,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:12:50,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:12:50,670 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:12:50,670 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:12:50,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label56.c [2024-11-08 11:12:51,966 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:12:52,185 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:12:52,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label56.c [2024-11-08 11:12:52,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8847d5c1c/b25a1bb37a4a4a3b81758ea41f9fae5d/FLAG8c6e4fd5c [2024-11-08 11:12:52,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8847d5c1c/b25a1bb37a4a4a3b81758ea41f9fae5d [2024-11-08 11:12:52,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:12:52,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:12:52,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:12:52,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:12:52,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:12:52,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:12:52" (1/1) ... [2024-11-08 11:12:52,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f0862e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52, skipping insertion in model container [2024-11-08 11:12:52,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:12:52" (1/1) ... [2024-11-08 11:12:52,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:12:52,568 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label56.c[5994,6007] [2024-11-08 11:12:52,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:12:52,784 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:12:52,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label56.c[5994,6007] [2024-11-08 11:12:52,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:12:52,943 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:12:52,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52 WrapperNode [2024-11-08 11:12:52,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:12:52,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:12:52,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:12:52,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:12:52,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 11:12:52,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 11:12:53,026 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-08 11:12:53,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:12:53,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:12:53,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:12:53,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:12:53,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 11:12:53,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 11:12:53,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 11:12:53,093 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:12:53,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 11:12:53,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 11:12:53,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 11:12:53,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 11:12:53,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 11:12:53,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 11:12:53,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:12:53,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:12:53,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:12:53,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:12:53,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (1/1) ... [2024-11-08 11:12:53,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:12:53,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:12:53,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:12:53,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:12:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:12:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:12:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:12:53,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:12:53,310 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:12:53,312 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:12:54,511 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-08 11:12:54,511 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:12:54,530 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:12:54,530 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:12:54,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:12:54 BoogieIcfgContainer [2024-11-08 11:12:54,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:12:54,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:12:54,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:12:54,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:12:54,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:12:52" (1/3) ... [2024-11-08 11:12:54,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba138e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:12:54, skipping insertion in model container [2024-11-08 11:12:54,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:12:52" (2/3) ... [2024-11-08 11:12:54,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba138e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:12:54, skipping insertion in model container [2024-11-08 11:12:54,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:12:54" (3/3) ... [2024-11-08 11:12:54,538 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label56.c [2024-11-08 11:12:54,551 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:12:54,551 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:12:54,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:12:54,605 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;@331687fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:12:54,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:12:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 11:12:54,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:54,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:12:54,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:54,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:54,628 INFO L85 PathProgramCache]: Analyzing trace with hash 751578873, now seen corresponding path program 1 times [2024-11-08 11:12:54,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:54,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600959729] [2024-11-08 11:12:54,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:54,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:12:54,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:54,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600959729] [2024-11-08 11:12:54,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600959729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:54,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:54,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:12:54,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906066736] [2024-11-08 11:12:54,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:54,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:54,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:54,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:54,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:54,981 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:55,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:55,778 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2024-11-08 11:12:55,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:55,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2024-11-08 11:12:55,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:55,790 INFO L225 Difference]: With dead ends: 776 [2024-11-08 11:12:55,790 INFO L226 Difference]: Without dead ends: 413 [2024-11-08 11:12:55,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:55,795 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 186 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:55,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:12:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-08 11:12:55,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2024-11-08 11:12:55,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2024-11-08 11:12:55,840 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 41 [2024-11-08 11:12:55,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:55,841 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2024-11-08 11:12:55,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2024-11-08 11:12:55,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 11:12:55,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:55,843 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-08 11:12:55,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:12:55,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:55,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:55,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1616931328, now seen corresponding path program 1 times [2024-11-08 11:12:55,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:55,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918131990] [2024-11-08 11:12:55,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:55,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:12:55,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918131990] [2024-11-08 11:12:55,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918131990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:55,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:55,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:12:55,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898824684] [2024-11-08 11:12:55,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:55,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:55,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:55,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:55,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:55,987 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:56,810 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2024-11-08 11:12:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:56,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-11-08 11:12:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:56,815 INFO L225 Difference]: With dead ends: 1209 [2024-11-08 11:12:56,815 INFO L226 Difference]: Without dead ends: 800 [2024-11-08 11:12:56,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:56,817 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:56,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 122 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:12:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-08 11:12:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2024-11-08 11:12:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3842239185750635) internal successors, (1088), 786 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1088 transitions. [2024-11-08 11:12:56,842 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1088 transitions. Word has length 109 [2024-11-08 11:12:56,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:56,843 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1088 transitions. [2024-11-08 11:12:56,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:56,843 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1088 transitions. [2024-11-08 11:12:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 11:12:56,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:56,845 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:12:56,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:12:56,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:56,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:56,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1753081093, now seen corresponding path program 1 times [2024-11-08 11:12:56,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:56,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161640556] [2024-11-08 11:12:56,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:56,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:12:57,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:57,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161640556] [2024-11-08 11:12:57,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161640556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:57,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:57,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:12:57,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842668190] [2024-11-08 11:12:57,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:57,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:57,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:57,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:57,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:57,155 INFO L87 Difference]: Start difference. First operand 787 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:57,784 INFO L93 Difference]: Finished difference Result 1942 states and 2629 transitions. [2024-11-08 11:12:57,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:57,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-11-08 11:12:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:57,788 INFO L225 Difference]: With dead ends: 1942 [2024-11-08 11:12:57,788 INFO L226 Difference]: Without dead ends: 1157 [2024-11-08 11:12:57,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:57,790 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:57,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:12:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-08 11:12:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-11-08 11:12:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277056277056277) internal successors, (1475), 1155 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1475 transitions. [2024-11-08 11:12:57,808 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1475 transitions. Word has length 111 [2024-11-08 11:12:57,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:57,808 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1475 transitions. [2024-11-08 11:12:57,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1475 transitions. [2024-11-08 11:12:57,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 11:12:57,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:57,811 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:12:57,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:12:57,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:57,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:57,811 INFO L85 PathProgramCache]: Analyzing trace with hash -299670212, now seen corresponding path program 1 times [2024-11-08 11:12:57,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:57,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786660048] [2024-11-08 11:12:57,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:57,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:57,968 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:12:57,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:57,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786660048] [2024-11-08 11:12:57,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786660048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:57,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:57,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:12:57,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087395963] [2024-11-08 11:12:57,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:57,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:57,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:57,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:57,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:57,971 INFO L87 Difference]: Start difference. First operand 1156 states and 1475 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:58,588 INFO L93 Difference]: Finished difference Result 2691 states and 3513 transitions. [2024-11-08 11:12:58,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:58,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2024-11-08 11:12:58,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:58,593 INFO L225 Difference]: With dead ends: 2691 [2024-11-08 11:12:58,593 INFO L226 Difference]: Without dead ends: 1721 [2024-11-08 11:12:58,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:58,595 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 165 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:58,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 336 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:12:58,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2024-11-08 11:12:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1528. [2024-11-08 11:12:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1528 states, 1527 states have (on average 1.260641781270465) internal successors, (1925), 1527 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 1925 transitions. [2024-11-08 11:12:58,615 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 1925 transitions. Word has length 153 [2024-11-08 11:12:58,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:58,615 INFO L471 AbstractCegarLoop]: Abstraction has 1528 states and 1925 transitions. [2024-11-08 11:12:58,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:58,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1925 transitions. [2024-11-08 11:12:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 11:12:58,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:58,618 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:12:58,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:12:58,619 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:58,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:58,619 INFO L85 PathProgramCache]: Analyzing trace with hash 13927688, now seen corresponding path program 1 times [2024-11-08 11:12:58,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:58,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816521567] [2024-11-08 11:12:58,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:58,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 11:12:58,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:58,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816521567] [2024-11-08 11:12:58,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816521567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:58,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:58,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:12:58,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338196089] [2024-11-08 11:12:58,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:58,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:58,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:58,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:58,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:58,826 INFO L87 Difference]: Start difference. First operand 1528 states and 1925 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:59,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:12:59,514 INFO L93 Difference]: Finished difference Result 4160 states and 5315 transitions. [2024-11-08 11:12:59,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:12:59,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 223 [2024-11-08 11:12:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:12:59,521 INFO L225 Difference]: With dead ends: 4160 [2024-11-08 11:12:59,521 INFO L226 Difference]: Without dead ends: 2634 [2024-11-08 11:12:59,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:59,524 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 173 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:12:59,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 352 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:12:59,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2024-11-08 11:12:59,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2634. [2024-11-08 11:12:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2633 states have (on average 1.2468666919863274) internal successors, (3283), 2633 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 3283 transitions. [2024-11-08 11:12:59,565 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 3283 transitions. Word has length 223 [2024-11-08 11:12:59,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:12:59,566 INFO L471 AbstractCegarLoop]: Abstraction has 2634 states and 3283 transitions. [2024-11-08 11:12:59,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:12:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 3283 transitions. [2024-11-08 11:12:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 11:12:59,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:12:59,569 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:12:59,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:12:59,569 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:12:59,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:12:59,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1861643749, now seen corresponding path program 1 times [2024-11-08 11:12:59,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:12:59,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008277575] [2024-11-08 11:12:59,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:12:59,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:12:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:12:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-08 11:12:59,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:12:59,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008277575] [2024-11-08 11:12:59,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008277575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:12:59,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:12:59,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:12:59,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078454648] [2024-11-08 11:12:59,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:12:59,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:12:59,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:12:59,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:12:59,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:12:59,680 INFO L87 Difference]: Start difference. First operand 2634 states and 3283 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:00,268 INFO L93 Difference]: Finished difference Result 6553 states and 8157 transitions. [2024-11-08 11:13:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:00,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 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 234 [2024-11-08 11:13:00,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:00,280 INFO L225 Difference]: With dead ends: 6553 [2024-11-08 11:13:00,280 INFO L226 Difference]: Without dead ends: 3921 [2024-11-08 11:13:00,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:00,285 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:00,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 155 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:13:00,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3921 states. [2024-11-08 11:13:00,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3921 to 3185. [2024-11-08 11:13:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3185 states, 3184 states have (on average 1.1699120603015076) internal successors, (3725), 3184 states have internal predecessors, (3725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 3725 transitions. [2024-11-08 11:13:00,333 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 3725 transitions. Word has length 234 [2024-11-08 11:13:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:00,334 INFO L471 AbstractCegarLoop]: Abstraction has 3185 states and 3725 transitions. [2024-11-08 11:13:00,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 3725 transitions. [2024-11-08 11:13:00,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-08 11:13:00,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:00,337 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:00,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:13:00,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:00,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:00,338 INFO L85 PathProgramCache]: Analyzing trace with hash 748674339, now seen corresponding path program 1 times [2024-11-08 11:13:00,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:00,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649255359] [2024-11-08 11:13:00,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:00,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-08 11:13:00,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:00,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649255359] [2024-11-08 11:13:00,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649255359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:00,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:00,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:00,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464199813] [2024-11-08 11:13:00,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:00,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:00,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:00,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:00,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:00,518 INFO L87 Difference]: Start difference. First operand 3185 states and 3725 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:01,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:01,168 INFO L93 Difference]: Finished difference Result 7108 states and 8338 transitions. [2024-11-08 11:13:01,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:01,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 250 [2024-11-08 11:13:01,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:01,178 INFO L225 Difference]: With dead ends: 7108 [2024-11-08 11:13:01,178 INFO L226 Difference]: Without dead ends: 3925 [2024-11-08 11:13:01,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:01,183 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 160 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:01,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 372 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:13:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2024-11-08 11:13:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3736. [2024-11-08 11:13:01,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3736 states, 3735 states have (on average 1.1606425702811245) internal successors, (4335), 3735 states have internal predecessors, (4335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 4335 transitions. [2024-11-08 11:13:01,266 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 4335 transitions. Word has length 250 [2024-11-08 11:13:01,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:01,270 INFO L471 AbstractCegarLoop]: Abstraction has 3736 states and 4335 transitions. [2024-11-08 11:13:01,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 4335 transitions. [2024-11-08 11:13:01,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-08 11:13:01,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:01,273 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:01,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:13:01,273 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:01,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:01,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1804774869, now seen corresponding path program 1 times [2024-11-08 11:13:01,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:01,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203293244] [2024-11-08 11:13:01,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:01,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-08 11:13:01,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:01,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203293244] [2024-11-08 11:13:01,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203293244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:01,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:01,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:01,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232515345] [2024-11-08 11:13:01,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:01,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:01,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:01,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:01,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:01,650 INFO L87 Difference]: Start difference. First operand 3736 states and 4335 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:02,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:02,250 INFO L93 Difference]: Finished difference Result 8579 states and 9918 transitions. [2024-11-08 11:13:02,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:02,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 263 [2024-11-08 11:13:02,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:02,261 INFO L225 Difference]: With dead ends: 8579 [2024-11-08 11:13:02,261 INFO L226 Difference]: Without dead ends: 4845 [2024-11-08 11:13:02,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:02,266 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 179 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:02,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 390 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:13:02,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4845 states. [2024-11-08 11:13:02,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4845 to 4844. [2024-11-08 11:13:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4844 states, 4843 states have (on average 1.1525913689861655) internal successors, (5582), 4843 states have internal predecessors, (5582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4844 states to 4844 states and 5582 transitions. [2024-11-08 11:13:02,326 INFO L78 Accepts]: Start accepts. Automaton has 4844 states and 5582 transitions. Word has length 263 [2024-11-08 11:13:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:02,326 INFO L471 AbstractCegarLoop]: Abstraction has 4844 states and 5582 transitions. [2024-11-08 11:13:02,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:02,327 INFO L276 IsEmpty]: Start isEmpty. Operand 4844 states and 5582 transitions. [2024-11-08 11:13:02,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-08 11:13:02,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:02,330 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:02,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:13:02,330 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:02,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:02,330 INFO L85 PathProgramCache]: Analyzing trace with hash -789875443, now seen corresponding path program 1 times [2024-11-08 11:13:02,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:02,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597954295] [2024-11-08 11:13:02,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:02,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:13:02,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:02,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597954295] [2024-11-08 11:13:02,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597954295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:02,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:02,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:02,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852022486] [2024-11-08 11:13:02,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:02,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:13:02,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:02,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:13:02,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:13:02,676 INFO L87 Difference]: Start difference. First operand 4844 states and 5582 transitions. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:03,745 INFO L93 Difference]: Finished difference Result 13562 states and 15894 transitions. [2024-11-08 11:13:03,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:13:03,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2024-11-08 11:13:03,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:03,765 INFO L225 Difference]: With dead ends: 13562 [2024-11-08 11:13:03,765 INFO L226 Difference]: Without dead ends: 9088 [2024-11-08 11:13:03,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:13:03,771 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 205 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:03,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 130 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:13:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2024-11-08 11:13:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 8897. [2024-11-08 11:13:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8897 states, 8896 states have (on average 1.1535521582733812) internal successors, (10262), 8896 states have internal predecessors, (10262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8897 states to 8897 states and 10262 transitions. [2024-11-08 11:13:03,886 INFO L78 Accepts]: Start accepts. Automaton has 8897 states and 10262 transitions. Word has length 272 [2024-11-08 11:13:03,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:03,887 INFO L471 AbstractCegarLoop]: Abstraction has 8897 states and 10262 transitions. [2024-11-08 11:13:03,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 8897 states and 10262 transitions. [2024-11-08 11:13:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-11-08 11:13:03,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:03,897 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:03,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:13:03,898 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:03,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:03,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1520405194, now seen corresponding path program 1 times [2024-11-08 11:13:03,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:03,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559049274] [2024-11-08 11:13:03,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:03,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-08 11:13:04,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:04,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559049274] [2024-11-08 11:13:04,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559049274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:04,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:04,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:04,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925326966] [2024-11-08 11:13:04,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:04,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:04,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:04,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:04,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:04,064 INFO L87 Difference]: Start difference. First operand 8897 states and 10262 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:04,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:04,721 INFO L93 Difference]: Finished difference Result 19635 states and 22699 transitions. [2024-11-08 11:13:04,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:04,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 300 [2024-11-08 11:13:04,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:04,738 INFO L225 Difference]: With dead ends: 19635 [2024-11-08 11:13:04,739 INFO L226 Difference]: Without dead ends: 11108 [2024-11-08 11:13:04,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:04,748 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 195 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:04,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 72 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:13:04,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11108 states. [2024-11-08 11:13:04,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11108 to 10737. [2024-11-08 11:13:04,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10737 states, 10736 states have (on average 1.1461438152011922) internal successors, (12305), 10736 states have internal predecessors, (12305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10737 states to 10737 states and 12305 transitions. [2024-11-08 11:13:04,971 INFO L78 Accepts]: Start accepts. Automaton has 10737 states and 12305 transitions. Word has length 300 [2024-11-08 11:13:04,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:04,971 INFO L471 AbstractCegarLoop]: Abstraction has 10737 states and 12305 transitions. [2024-11-08 11:13:04,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:04,972 INFO L276 IsEmpty]: Start isEmpty. Operand 10737 states and 12305 transitions. [2024-11-08 11:13:04,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2024-11-08 11:13:04,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:04,977 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:04,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:13:04,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:04,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:04,978 INFO L85 PathProgramCache]: Analyzing trace with hash -582865195, now seen corresponding path program 1 times [2024-11-08 11:13:04,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:04,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248395286] [2024-11-08 11:13:04,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:04,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-08 11:13:05,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:05,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248395286] [2024-11-08 11:13:05,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248395286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:05,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:05,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:13:05,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421137408] [2024-11-08 11:13:05,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:05,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:05,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:05,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:05,320 INFO L87 Difference]: Start difference. First operand 10737 states and 12305 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:05,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:05,877 INFO L93 Difference]: Finished difference Result 23502 states and 26923 transitions. [2024-11-08 11:13:05,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:05,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 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 302 [2024-11-08 11:13:05,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:05,897 INFO L225 Difference]: With dead ends: 23502 [2024-11-08 11:13:05,897 INFO L226 Difference]: Without dead ends: 13135 [2024-11-08 11:13:05,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:05,908 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 73 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:05,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 162 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:13:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13135 states. [2024-11-08 11:13:06,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13135 to 10737. [2024-11-08 11:13:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10737 states, 10736 states have (on average 1.1461438152011922) internal successors, (12305), 10736 states have internal predecessors, (12305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10737 states to 10737 states and 12305 transitions. [2024-11-08 11:13:06,138 INFO L78 Accepts]: Start accepts. Automaton has 10737 states and 12305 transitions. Word has length 302 [2024-11-08 11:13:06,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:06,138 INFO L471 AbstractCegarLoop]: Abstraction has 10737 states and 12305 transitions. [2024-11-08 11:13:06,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:06,139 INFO L276 IsEmpty]: Start isEmpty. Operand 10737 states and 12305 transitions. [2024-11-08 11:13:06,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-11-08 11:13:06,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:06,149 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-08 11:13:06,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:13:06,149 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:06,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:06,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2113040803, now seen corresponding path program 1 times [2024-11-08 11:13:06,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:06,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449119565] [2024-11-08 11:13:06,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:06,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-08 11:13:06,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:06,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449119565] [2024-11-08 11:13:06,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449119565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:06,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:06,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:06,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812977175] [2024-11-08 11:13:06,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:06,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:06,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:06,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:06,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:06,348 INFO L87 Difference]: Start difference. First operand 10737 states and 12305 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:07,017 INFO L93 Difference]: Finished difference Result 21102 states and 24226 transitions. [2024-11-08 11:13:07,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:07,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 377 [2024-11-08 11:13:07,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:07,047 INFO L225 Difference]: With dead ends: 21102 [2024-11-08 11:13:07,054 INFO L226 Difference]: Without dead ends: 10735 [2024-11-08 11:13:07,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:07,076 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 142 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:07,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 302 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:13:07,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10735 states. [2024-11-08 11:13:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10735 to 10735. [2024-11-08 11:13:07,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10735 states, 10734 states have (on average 1.1424445686603317) internal successors, (12263), 10734 states have internal predecessors, (12263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10735 states to 10735 states and 12263 transitions. [2024-11-08 11:13:07,386 INFO L78 Accepts]: Start accepts. Automaton has 10735 states and 12263 transitions. Word has length 377 [2024-11-08 11:13:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:07,390 INFO L471 AbstractCegarLoop]: Abstraction has 10735 states and 12263 transitions. [2024-11-08 11:13:07,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 10735 states and 12263 transitions. [2024-11-08 11:13:07,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2024-11-08 11:13:07,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:07,416 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:13:07,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:13:07,416 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:07,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:07,421 INFO L85 PathProgramCache]: Analyzing trace with hash 231637248, now seen corresponding path program 1 times [2024-11-08 11:13:07,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:07,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676291622] [2024-11-08 11:13:07,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:07,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2024-11-08 11:13:07,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676291622] [2024-11-08 11:13:07,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676291622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:07,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:07,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:07,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660387926] [2024-11-08 11:13:07,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:07,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:07,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:07,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:07,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:07,880 INFO L87 Difference]: Start difference. First operand 10735 states and 12263 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:08,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:08,447 INFO L93 Difference]: Finished difference Result 22755 states and 26004 transitions. [2024-11-08 11:13:08,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:08,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 391 [2024-11-08 11:13:08,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:08,469 INFO L225 Difference]: With dead ends: 22755 [2024-11-08 11:13:08,469 INFO L226 Difference]: Without dead ends: 12390 [2024-11-08 11:13:08,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:08,481 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 178 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:08,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 151 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:13:08,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12390 states. [2024-11-08 11:13:08,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12390 to 8522. [2024-11-08 11:13:08,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8522 states, 8521 states have (on average 1.1475178969604507) internal successors, (9778), 8521 states have internal predecessors, (9778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8522 states to 8522 states and 9778 transitions. [2024-11-08 11:13:08,653 INFO L78 Accepts]: Start accepts. Automaton has 8522 states and 9778 transitions. Word has length 391 [2024-11-08 11:13:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:08,653 INFO L471 AbstractCegarLoop]: Abstraction has 8522 states and 9778 transitions. [2024-11-08 11:13:08,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 8522 states and 9778 transitions. [2024-11-08 11:13:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2024-11-08 11:13:08,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:08,663 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:13:08,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 11:13:08,664 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:08,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:08,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1234284050, now seen corresponding path program 1 times [2024-11-08 11:13:08,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:08,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855517851] [2024-11-08 11:13:08,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:08,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-08 11:13:09,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:09,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855517851] [2024-11-08 11:13:09,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855517851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:09,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:09,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:09,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396761156] [2024-11-08 11:13:09,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:09,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:09,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:09,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:09,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:09,038 INFO L87 Difference]: Start difference. First operand 8522 states and 9778 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:09,614 INFO L93 Difference]: Finished difference Result 18529 states and 21265 transitions. [2024-11-08 11:13:09,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:09,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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 413 [2024-11-08 11:13:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:09,626 INFO L225 Difference]: With dead ends: 18529 [2024-11-08 11:13:09,626 INFO L226 Difference]: Without dead ends: 10009 [2024-11-08 11:13:09,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:09,634 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 67 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:09,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 172 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:13:09,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10009 states. [2024-11-08 11:13:09,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10009 to 9810. [2024-11-08 11:13:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9810 states, 9809 states have (on average 1.1300846161688245) internal successors, (11085), 9809 states have internal predecessors, (11085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9810 states to 9810 states and 11085 transitions. [2024-11-08 11:13:09,718 INFO L78 Accepts]: Start accepts. Automaton has 9810 states and 11085 transitions. Word has length 413 [2024-11-08 11:13:09,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:09,719 INFO L471 AbstractCegarLoop]: Abstraction has 9810 states and 11085 transitions. [2024-11-08 11:13:09,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 9810 states and 11085 transitions. [2024-11-08 11:13:09,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-08 11:13:09,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:09,729 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:09,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 11:13:09,729 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:09,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:09,729 INFO L85 PathProgramCache]: Analyzing trace with hash -187531985, now seen corresponding path program 1 times [2024-11-08 11:13:09,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:09,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39595567] [2024-11-08 11:13:09,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:09,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-08 11:13:10,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:10,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39595567] [2024-11-08 11:13:10,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39595567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:10,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:10,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:10,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681795400] [2024-11-08 11:13:10,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:10,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:10,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:10,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:10,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:10,035 INFO L87 Difference]: Start difference. First operand 9810 states and 11085 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:10,665 INFO L93 Difference]: Finished difference Result 19444 states and 21991 transitions. [2024-11-08 11:13:10,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:10,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 494 [2024-11-08 11:13:10,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:10,676 INFO L225 Difference]: With dead ends: 19444 [2024-11-08 11:13:10,676 INFO L226 Difference]: Without dead ends: 9818 [2024-11-08 11:13:10,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:10,683 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 63 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:10,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 360 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:13:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9818 states. [2024-11-08 11:13:10,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9818 to 9808. [2024-11-08 11:13:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9808 states, 9807 states have (on average 1.1007443662689915) internal successors, (10795), 9807 states have internal predecessors, (10795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:10,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9808 states to 9808 states and 10795 transitions. [2024-11-08 11:13:10,771 INFO L78 Accepts]: Start accepts. Automaton has 9808 states and 10795 transitions. Word has length 494 [2024-11-08 11:13:10,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:10,772 INFO L471 AbstractCegarLoop]: Abstraction has 9808 states and 10795 transitions. [2024-11-08 11:13:10,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand 9808 states and 10795 transitions. [2024-11-08 11:13:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2024-11-08 11:13:10,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:10,781 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:10,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 11:13:10,781 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:10,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:10,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1135290674, now seen corresponding path program 1 times [2024-11-08 11:13:10,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:10,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793749977] [2024-11-08 11:13:10,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:10,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-11-08 11:13:11,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:11,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793749977] [2024-11-08 11:13:11,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793749977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:11,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:11,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:11,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135419402] [2024-11-08 11:13:11,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:11,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:11,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:11,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:11,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:11,127 INFO L87 Difference]: Start difference. First operand 9808 states and 10795 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:11,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:11,747 INFO L93 Difference]: Finished difference Result 21280 states and 23445 transitions. [2024-11-08 11:13:11,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:11,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 501 [2024-11-08 11:13:11,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:11,759 INFO L225 Difference]: With dead ends: 21280 [2024-11-08 11:13:11,760 INFO L226 Difference]: Without dead ends: 11842 [2024-11-08 11:13:11,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:11,767 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:11,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 126 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:13:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11842 states. [2024-11-08 11:13:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11842 to 10917. [2024-11-08 11:13:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10917 states, 10916 states have (on average 1.0979296445584463) internal successors, (11985), 10916 states have internal predecessors, (11985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10917 states to 10917 states and 11985 transitions. [2024-11-08 11:13:11,865 INFO L78 Accepts]: Start accepts. Automaton has 10917 states and 11985 transitions. Word has length 501 [2024-11-08 11:13:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:11,865 INFO L471 AbstractCegarLoop]: Abstraction has 10917 states and 11985 transitions. [2024-11-08 11:13:11,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:11,866 INFO L276 IsEmpty]: Start isEmpty. Operand 10917 states and 11985 transitions. [2024-11-08 11:13:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2024-11-08 11:13:11,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:11,876 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:11,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 11:13:11,876 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:11,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:11,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1489523097, now seen corresponding path program 1 times [2024-11-08 11:13:11,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:11,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221721505] [2024-11-08 11:13:11,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:11,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-08 11:13:12,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:12,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221721505] [2024-11-08 11:13:12,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221721505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:12,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:12,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:12,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239126475] [2024-11-08 11:13:12,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:12,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:13:12,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:12,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:13:12,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:13:12,483 INFO L87 Difference]: Start difference. First operand 10917 states and 11985 transitions. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:13,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:13,517 INFO L93 Difference]: Finished difference Result 28476 states and 31258 transitions. [2024-11-08 11:13:13,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:13:13,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 511 [2024-11-08 11:13:13,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:13,536 INFO L225 Difference]: With dead ends: 28476 [2024-11-08 11:13:13,537 INFO L226 Difference]: Without dead ends: 17377 [2024-11-08 11:13:13,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:13:13,548 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 222 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:13,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 73 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 11:13:13,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17377 states. [2024-11-08 11:13:13,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17377 to 16455. [2024-11-08 11:13:13,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16455 states, 16454 states have (on average 1.092378752886836) internal successors, (17974), 16454 states have internal predecessors, (17974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16455 states to 16455 states and 17974 transitions. [2024-11-08 11:13:13,738 INFO L78 Accepts]: Start accepts. Automaton has 16455 states and 17974 transitions. Word has length 511 [2024-11-08 11:13:13,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:13,738 INFO L471 AbstractCegarLoop]: Abstraction has 16455 states and 17974 transitions. [2024-11-08 11:13:13,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:13,739 INFO L276 IsEmpty]: Start isEmpty. Operand 16455 states and 17974 transitions. [2024-11-08 11:13:13,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2024-11-08 11:13:13,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:13,762 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-11-08 11:13:13,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 11:13:13,762 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:13,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:13,763 INFO L85 PathProgramCache]: Analyzing trace with hash -430183781, now seen corresponding path program 1 times [2024-11-08 11:13:13,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:13,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719886319] [2024-11-08 11:13:13,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:13,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 877 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-08 11:13:14,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:14,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719886319] [2024-11-08 11:13:14,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719886319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:14,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:14,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:14,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578707858] [2024-11-08 11:13:14,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:14,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:14,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:14,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:14,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:14,237 INFO L87 Difference]: Start difference. First operand 16455 states and 17974 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:14,823 INFO L93 Difference]: Finished difference Result 34205 states and 37381 transitions. [2024-11-08 11:13:14,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:14,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 607 [2024-11-08 11:13:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:14,840 INFO L225 Difference]: With dead ends: 34205 [2024-11-08 11:13:14,840 INFO L226 Difference]: Without dead ends: 18120 [2024-11-08 11:13:14,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:14,852 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 136 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:14,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 141 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:13:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18120 states. [2024-11-08 11:13:14,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18120 to 16271. [2024-11-08 11:13:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16271 states, 16270 states have (on average 1.0920712968653965) internal successors, (17768), 16270 states have internal predecessors, (17768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16271 states to 16271 states and 17768 transitions. [2024-11-08 11:13:15,006 INFO L78 Accepts]: Start accepts. Automaton has 16271 states and 17768 transitions. Word has length 607 [2024-11-08 11:13:15,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:15,006 INFO L471 AbstractCegarLoop]: Abstraction has 16271 states and 17768 transitions. [2024-11-08 11:13:15,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:15,006 INFO L276 IsEmpty]: Start isEmpty. Operand 16271 states and 17768 transitions. [2024-11-08 11:13:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2024-11-08 11:13:15,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:15,020 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:15,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 11:13:15,021 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:15,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:15,021 INFO L85 PathProgramCache]: Analyzing trace with hash 522658155, now seen corresponding path program 1 times [2024-11-08 11:13:15,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:15,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667443615] [2024-11-08 11:13:15,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:15,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:15,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 693 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2024-11-08 11:13:15,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:15,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667443615] [2024-11-08 11:13:15,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667443615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:15,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:15,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:15,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188100677] [2024-11-08 11:13:15,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:15,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:15,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:15,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:15,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:15,252 INFO L87 Difference]: Start difference. First operand 16271 states and 17768 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-11-08 11:13:15,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:15,902 INFO L93 Difference]: Finished difference Result 33827 states and 36954 transitions. [2024-11-08 11:13:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:15,902 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 635 [2024-11-08 11:13:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:15,919 INFO L225 Difference]: With dead ends: 33827 [2024-11-08 11:13:15,920 INFO L226 Difference]: Without dead ends: 17926 [2024-11-08 11:13:15,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:15,930 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 66 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:15,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 337 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:13:15,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17926 states. [2024-11-08 11:13:16,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17926 to 14972. [2024-11-08 11:13:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14972 states, 14971 states have (on average 1.09030792866208) internal successors, (16323), 14971 states have internal predecessors, (16323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14972 states to 14972 states and 16323 transitions. [2024-11-08 11:13:16,092 INFO L78 Accepts]: Start accepts. Automaton has 14972 states and 16323 transitions. Word has length 635 [2024-11-08 11:13:16,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:16,092 INFO L471 AbstractCegarLoop]: Abstraction has 14972 states and 16323 transitions. [2024-11-08 11:13:16,092 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-11-08 11:13:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 14972 states and 16323 transitions. [2024-11-08 11:13:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2024-11-08 11:13:16,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:16,109 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:16,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 11:13:16,109 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:16,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:16,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1081395098, now seen corresponding path program 1 times [2024-11-08 11:13:16,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:16,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84128429] [2024-11-08 11:13:16,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:16,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 837 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2024-11-08 11:13:17,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:17,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84128429] [2024-11-08 11:13:17,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84128429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:17,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:17,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 11:13:17,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078360818] [2024-11-08 11:13:17,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:17,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 11:13:17,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:17,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 11:13:17,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:13:17,435 INFO L87 Difference]: Start difference. First operand 14972 states and 16323 transitions. Second operand has 7 states, 7 states have (on average 59.0) internal successors, (413), 6 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:18,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:18,948 INFO L93 Difference]: Finished difference Result 35475 states and 38640 transitions. [2024-11-08 11:13:18,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 11:13:18,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 59.0) internal successors, (413), 6 states have internal predecessors, (413), 0 states have call successors, (0), 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 662 [2024-11-08 11:13:18,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:18,968 INFO L225 Difference]: With dead ends: 35475 [2024-11-08 11:13:18,968 INFO L226 Difference]: Without dead ends: 20873 [2024-11-08 11:13:18,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:13:18,978 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 214 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 2421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:18,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 230 Invalid, 2421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:13:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20873 states. [2024-11-08 11:13:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20873 to 20681. [2024-11-08 11:13:19,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20681 states, 20680 states have (on average 1.0872823984526112) internal successors, (22485), 20680 states have internal predecessors, (22485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20681 states to 20681 states and 22485 transitions. [2024-11-08 11:13:19,254 INFO L78 Accepts]: Start accepts. Automaton has 20681 states and 22485 transitions. Word has length 662 [2024-11-08 11:13:19,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:19,255 INFO L471 AbstractCegarLoop]: Abstraction has 20681 states and 22485 transitions. [2024-11-08 11:13:19,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.0) internal successors, (413), 6 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 20681 states and 22485 transitions. [2024-11-08 11:13:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2024-11-08 11:13:19,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:19,279 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:19,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 11:13:19,279 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:19,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:19,280 INFO L85 PathProgramCache]: Analyzing trace with hash -118562656, now seen corresponding path program 1 times [2024-11-08 11:13:19,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:19,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449782706] [2024-11-08 11:13:19,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:19,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 1119 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-08 11:13:19,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:19,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449782706] [2024-11-08 11:13:19,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449782706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:19,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:19,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:19,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636067792] [2024-11-08 11:13:19,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:19,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:19,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:19,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:19,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:19,827 INFO L87 Difference]: Start difference. First operand 20681 states and 22485 transitions. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:20,455 INFO L93 Difference]: Finished difference Result 43382 states and 47189 transitions. [2024-11-08 11:13:20,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:20,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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 670 [2024-11-08 11:13:20,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:20,479 INFO L225 Difference]: With dead ends: 43382 [2024-11-08 11:13:20,480 INFO L226 Difference]: Without dead ends: 23071 [2024-11-08 11:13:20,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:20,493 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 123 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:20,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 309 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:13:20,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23071 states. [2024-11-08 11:13:20,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23071 to 15523. [2024-11-08 11:13:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15523 states, 15522 states have (on average 1.089099342868187) internal successors, (16905), 15522 states have internal predecessors, (16905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:20,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15523 states to 15523 states and 16905 transitions. [2024-11-08 11:13:20,651 INFO L78 Accepts]: Start accepts. Automaton has 15523 states and 16905 transitions. Word has length 670 [2024-11-08 11:13:20,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:20,652 INFO L471 AbstractCegarLoop]: Abstraction has 15523 states and 16905 transitions. [2024-11-08 11:13:20,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 15523 states and 16905 transitions. [2024-11-08 11:13:20,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2024-11-08 11:13:20,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:20,665 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:20,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 11:13:20,665 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:20,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:20,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2057566227, now seen corresponding path program 1 times [2024-11-08 11:13:20,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:20,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171484900] [2024-11-08 11:13:20,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:20,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:21,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 859 proven. 8 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2024-11-08 11:13:21,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:21,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171484900] [2024-11-08 11:13:21,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171484900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:13:21,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922441379] [2024-11-08 11:13:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:21,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:13:21,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:13:21,685 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:13:21,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:13:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:21,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 11:13:21,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:13:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 746 proven. 121 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2024-11-08 11:13:23,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:13:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 746 proven. 121 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2024-11-08 11:13:26,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922441379] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 11:13:26,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 11:13:26,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2024-11-08 11:13:26,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467358387] [2024-11-08 11:13:26,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 11:13:26,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 11:13:26,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:26,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 11:13:26,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-08 11:13:26,102 INFO L87 Difference]: Start difference. First operand 15523 states and 16905 transitions. Second operand has 11 states, 11 states have (on average 90.0909090909091) internal successors, (991), 10 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:29,491 INFO L93 Difference]: Finished difference Result 37123 states and 40299 transitions. [2024-11-08 11:13:29,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 11:13:29,492 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 90.0909090909091) internal successors, (991), 10 states have internal predecessors, (991), 0 states have call successors, (0), 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 672 [2024-11-08 11:13:29,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:29,513 INFO L225 Difference]: With dead ends: 37123 [2024-11-08 11:13:29,514 INFO L226 Difference]: Without dead ends: 21784 [2024-11-08 11:13:29,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1365 GetRequests, 1340 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2024-11-08 11:13:29,525 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1392 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 3940 mSolverCounterSat, 566 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 4506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 566 IncrementalHoareTripleChecker+Valid, 3940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:29,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 160 Invalid, 4506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [566 Valid, 3940 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 11:13:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21784 states. [2024-11-08 11:13:29,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21784 to 12200. [2024-11-08 11:13:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12200 states, 12199 states have (on average 1.0650873022378884) internal successors, (12993), 12199 states have internal predecessors, (12993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:29,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12200 states to 12200 states and 12993 transitions. [2024-11-08 11:13:29,690 INFO L78 Accepts]: Start accepts. Automaton has 12200 states and 12993 transitions. Word has length 672 [2024-11-08 11:13:29,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:29,694 INFO L471 AbstractCegarLoop]: Abstraction has 12200 states and 12993 transitions. [2024-11-08 11:13:29,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.0909090909091) internal successors, (991), 10 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:29,695 INFO L276 IsEmpty]: Start isEmpty. Operand 12200 states and 12993 transitions. [2024-11-08 11:13:29,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2024-11-08 11:13:29,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:29,712 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:29,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 11:13:29,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-08 11:13:29,914 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:29,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:29,914 INFO L85 PathProgramCache]: Analyzing trace with hash -896075539, now seen corresponding path program 1 times [2024-11-08 11:13:29,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:29,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340196374] [2024-11-08 11:13:29,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:29,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 1039 proven. 64 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-11-08 11:13:30,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:30,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340196374] [2024-11-08 11:13:30,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340196374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:13:30,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574183980] [2024-11-08 11:13:30,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:30,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:13:30,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:13:30,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:13:30,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 11:13:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:31,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:13:31,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:13:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 1103 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-11-08 11:13:31,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:13:31,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574183980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:31,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:13:31,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:13:31,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669490502] [2024-11-08 11:13:31,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:31,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:31,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:31,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:31,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:13:31,136 INFO L87 Difference]: Start difference. First operand 12200 states and 12993 transitions. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:31,663 INFO L93 Difference]: Finished difference Result 25329 states and 26993 transitions. [2024-11-08 11:13:31,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:31,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 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 687 [2024-11-08 11:13:31,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:31,676 INFO L225 Difference]: With dead ends: 25329 [2024-11-08 11:13:31,676 INFO L226 Difference]: Without dead ends: 13315 [2024-11-08 11:13:31,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:13:31,685 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 77 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:31,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 320 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:13:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13315 states. [2024-11-08 11:13:31,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13315 to 12200. [2024-11-08 11:13:31,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12200 states, 12199 states have (on average 1.0624641364046232) internal successors, (12961), 12199 states have internal predecessors, (12961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12200 states to 12200 states and 12961 transitions. [2024-11-08 11:13:31,784 INFO L78 Accepts]: Start accepts. Automaton has 12200 states and 12961 transitions. Word has length 687 [2024-11-08 11:13:31,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:31,784 INFO L471 AbstractCegarLoop]: Abstraction has 12200 states and 12961 transitions. [2024-11-08 11:13:31,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:31,784 INFO L276 IsEmpty]: Start isEmpty. Operand 12200 states and 12961 transitions. [2024-11-08 11:13:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2024-11-08 11:13:31,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:31,793 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:31,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 11:13:31,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-08 11:13:31,994 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:31,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:31,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1829428589, now seen corresponding path program 1 times [2024-11-08 11:13:31,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:31,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540002515] [2024-11-08 11:13:31,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:31,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 1192 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2024-11-08 11:13:32,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:32,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540002515] [2024-11-08 11:13:32,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540002515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:32,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:32,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:32,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007882123] [2024-11-08 11:13:32,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:32,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:32,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:32,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:32,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:32,475 INFO L87 Difference]: Start difference. First operand 12200 states and 12961 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:33,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:33,049 INFO L93 Difference]: Finished difference Result 25330 states and 26933 transitions. [2024-11-08 11:13:33,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:33,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 716 [2024-11-08 11:13:33,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:33,061 INFO L225 Difference]: With dead ends: 25330 [2024-11-08 11:13:33,061 INFO L226 Difference]: Without dead ends: 13500 [2024-11-08 11:13:33,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:33,068 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 131 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:33,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 102 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:13:33,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13500 states. [2024-11-08 11:13:33,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13500 to 12016. [2024-11-08 11:13:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12016 states, 12015 states have (on average 1.0620058260507699) internal successors, (12760), 12015 states have internal predecessors, (12760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:33,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12016 states to 12016 states and 12760 transitions. [2024-11-08 11:13:33,162 INFO L78 Accepts]: Start accepts. Automaton has 12016 states and 12760 transitions. Word has length 716 [2024-11-08 11:13:33,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:33,163 INFO L471 AbstractCegarLoop]: Abstraction has 12016 states and 12760 transitions. [2024-11-08 11:13:33,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:33,163 INFO L276 IsEmpty]: Start isEmpty. Operand 12016 states and 12760 transitions. [2024-11-08 11:13:33,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2024-11-08 11:13:33,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:33,171 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:13:33,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 11:13:33,172 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:33,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:33,172 INFO L85 PathProgramCache]: Analyzing trace with hash -207250752, now seen corresponding path program 1 times [2024-11-08 11:13:33,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:33,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447615874] [2024-11-08 11:13:33,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:33,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 1292 proven. 0 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-11-08 11:13:33,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:33,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447615874] [2024-11-08 11:13:33,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447615874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:33,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:33,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:33,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630638550] [2024-11-08 11:13:33,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:33,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:33,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:33,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:33,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:33,560 INFO L87 Difference]: Start difference. First operand 12016 states and 12760 transitions. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:34,052 INFO L93 Difference]: Finished difference Result 23106 states and 24550 transitions. [2024-11-08 11:13:34,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:34,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 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 750 [2024-11-08 11:13:34,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:34,063 INFO L225 Difference]: With dead ends: 23106 [2024-11-08 11:13:34,064 INFO L226 Difference]: Without dead ends: 11460 [2024-11-08 11:13:34,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:34,071 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 65 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:34,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 268 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:13:34,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11460 states. [2024-11-08 11:13:34,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11460 to 9616. [2024-11-08 11:13:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9616 states, 9615 states have (on average 1.0582423296931878) internal successors, (10175), 9615 states have internal predecessors, (10175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9616 states to 9616 states and 10175 transitions. [2024-11-08 11:13:34,159 INFO L78 Accepts]: Start accepts. Automaton has 9616 states and 10175 transitions. Word has length 750 [2024-11-08 11:13:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:34,160 INFO L471 AbstractCegarLoop]: Abstraction has 9616 states and 10175 transitions. [2024-11-08 11:13:34,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 9616 states and 10175 transitions. [2024-11-08 11:13:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2024-11-08 11:13:34,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:34,168 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-11-08 11:13:34,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 11:13:34,169 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:34,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:34,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1393997085, now seen corresponding path program 1 times [2024-11-08 11:13:34,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:34,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804691695] [2024-11-08 11:13:34,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:34,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1864 backedges. 1298 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2024-11-08 11:13:34,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:34,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804691695] [2024-11-08 11:13:34,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804691695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:34,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:34,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:13:34,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151831986] [2024-11-08 11:13:34,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:34,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:13:34,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:34,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:13:34,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:34,514 INFO L87 Difference]: Start difference. First operand 9616 states and 10175 transitions. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:35,029 INFO L93 Difference]: Finished difference Result 19414 states and 20552 transitions. [2024-11-08 11:13:35,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:13:35,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 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 811 [2024-11-08 11:13:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:35,038 INFO L225 Difference]: With dead ends: 19414 [2024-11-08 11:13:35,039 INFO L226 Difference]: Without dead ends: 10352 [2024-11-08 11:13:35,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:13:35,044 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 108 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:35,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 339 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:13:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10352 states. [2024-11-08 11:13:35,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10352 to 9984. [2024-11-08 11:13:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9984 states, 9983 states have (on average 1.05719723530001) internal successors, (10554), 9983 states have internal predecessors, (10554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:35,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9984 states to 9984 states and 10554 transitions. [2024-11-08 11:13:35,127 INFO L78 Accepts]: Start accepts. Automaton has 9984 states and 10554 transitions. Word has length 811 [2024-11-08 11:13:35,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:35,128 INFO L471 AbstractCegarLoop]: Abstraction has 9984 states and 10554 transitions. [2024-11-08 11:13:35,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:35,128 INFO L276 IsEmpty]: Start isEmpty. Operand 9984 states and 10554 transitions. [2024-11-08 11:13:35,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 817 [2024-11-08 11:13:35,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:35,137 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-11-08 11:13:35,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 11:13:35,137 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:35,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:35,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1330001783, now seen corresponding path program 1 times [2024-11-08 11:13:35,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:35,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139345644] [2024-11-08 11:13:35,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:35,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1876 backedges. 1474 proven. 0 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-11-08 11:13:35,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:35,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139345644] [2024-11-08 11:13:35,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139345644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:35,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:35,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:13:35,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732814579] [2024-11-08 11:13:35,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:35,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:13:35,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:35,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:13:35,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:13:35,770 INFO L87 Difference]: Start difference. First operand 9984 states and 10554 transitions. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:36,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:36,631 INFO L93 Difference]: Finished difference Result 22926 states and 24206 transitions. [2024-11-08 11:13:36,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:13:36,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 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 816 [2024-11-08 11:13:36,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:36,643 INFO L225 Difference]: With dead ends: 22926 [2024-11-08 11:13:36,643 INFO L226 Difference]: Without dead ends: 12760 [2024-11-08 11:13:36,650 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-11-08 11:13:36,651 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 235 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:36,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 72 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 11:13:36,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12760 states. [2024-11-08 11:13:36,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12760 to 9066. [2024-11-08 11:13:36,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9066 states, 9065 states have (on average 1.0520683949255378) internal successors, (9537), 9065 states have internal predecessors, (9537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:36,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9066 states to 9066 states and 9537 transitions. [2024-11-08 11:13:36,746 INFO L78 Accepts]: Start accepts. Automaton has 9066 states and 9537 transitions. Word has length 816 [2024-11-08 11:13:36,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:36,747 INFO L471 AbstractCegarLoop]: Abstraction has 9066 states and 9537 transitions. [2024-11-08 11:13:36,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 9066 states and 9537 transitions. [2024-11-08 11:13:36,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 873 [2024-11-08 11:13:36,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:13:36,755 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:36,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 11:13:36,755 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:13:36,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:13:36,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1227757454, now seen corresponding path program 1 times [2024-11-08 11:13:36,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:13:36,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709050398] [2024-11-08 11:13:36,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:13:36,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:13:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:13:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 1524 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-11-08 11:13:37,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:13:37,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709050398] [2024-11-08 11:13:37,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709050398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:13:37,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:13:37,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:13:37,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506529167] [2024-11-08 11:13:37,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:13:37,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:13:37,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:13:37,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:13:37,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:13:37,470 INFO L87 Difference]: Start difference. First operand 9066 states and 9537 transitions. Second operand has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:13:38,151 INFO L93 Difference]: Finished difference Result 15725 states and 16547 transitions. [2024-11-08 11:13:38,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:13:38,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 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 872 [2024-11-08 11:13:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:13:38,152 INFO L225 Difference]: With dead ends: 15725 [2024-11-08 11:13:38,152 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:13:38,157 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-11-08 11:13:38,157 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 223 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:13:38,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 41 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:13:38,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:13:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:13:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:13:38,159 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 872 [2024-11-08 11:13:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:13:38,160 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:13:38,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:13:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:13:38,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:13:38,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:13:38,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 11:13:38,166 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:13:38,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:13:45,644 WARN L286 SmtUtils]: Spent 7.47s on a formula simplification. DAG size of input: 582 DAG size of output: 821 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-08 11:13:48,658 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:13:48,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:13:48 BoogieIcfgContainer [2024-11-08 11:13:48,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:13:48,690 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:13:48,690 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:13:48,691 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:13:48,691 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:12:54" (3/4) ... [2024-11-08 11:13:48,693 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:13:48,705 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:13:48,706 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:13:48,707 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:13:48,707 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:13:48,866 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:13:48,866 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:13:48,866 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:13:48,867 INFO L158 Benchmark]: Toolchain (without parser) took 56639.65ms. Allocated memory was 174.1MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 99.4MB in the beginning and 716.4MB in the end (delta: -617.0MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-08 11:13:48,867 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 174.1MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:13:48,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 713.08ms. Allocated memory is still 174.1MB. Free memory was 99.1MB in the beginning and 106.4MB in the end (delta: -7.4MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-11-08 11:13:48,868 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.32ms. Allocated memory is still 174.1MB. Free memory was 106.4MB in the beginning and 89.0MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 11:13:48,868 INFO L158 Benchmark]: Boogie Preprocessor took 150.80ms. Allocated memory is still 174.1MB. Free memory was 89.0MB in the beginning and 63.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 11:13:48,870 INFO L158 Benchmark]: RCFGBuilder took 1351.74ms. Allocated memory was 174.1MB in the beginning and 289.4MB in the end (delta: 115.3MB). Free memory was 63.1MB in the beginning and 89.1MB in the end (delta: -26.0MB). Peak memory consumption was 101.5MB. Max. memory is 16.1GB. [2024-11-08 11:13:48,870 INFO L158 Benchmark]: TraceAbstraction took 54157.50ms. Allocated memory was 289.4MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 89.1MB in the beginning and 733.2MB in the end (delta: -644.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-08 11:13:48,870 INFO L158 Benchmark]: Witness Printer took 176.19ms. Allocated memory is still 1.9GB. Free memory was 733.2MB in the beginning and 716.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 11:13:48,871 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 174.1MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 713.08ms. Allocated memory is still 174.1MB. Free memory was 99.1MB in the beginning and 106.4MB in the end (delta: -7.4MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.32ms. Allocated memory is still 174.1MB. Free memory was 106.4MB in the beginning and 89.0MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 150.80ms. Allocated memory is still 174.1MB. Free memory was 89.0MB in the beginning and 63.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1351.74ms. Allocated memory was 174.1MB in the beginning and 289.4MB in the end (delta: 115.3MB). Free memory was 63.1MB in the beginning and 89.1MB in the end (delta: -26.0MB). Peak memory consumption was 101.5MB. Max. memory is 16.1GB. * TraceAbstraction took 54157.50ms. Allocated memory was 289.4MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 89.1MB in the beginning and 733.2MB in the end (delta: -644.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 176.19ms. Allocated memory is still 1.9GB. Free memory was 733.2MB in the beginning and 716.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 139]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.6s, OverallIterations: 28, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 22.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5290 SdHoareTripleChecker+Valid, 20.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5290 mSDsluCounter, 5980 SdHoareTripleChecker+Invalid, 16.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 827 mSDsCounter, 2805 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22132 IncrementalHoareTripleChecker+Invalid, 24937 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2805 mSolverCounterUnsat, 5153 mSDtfsCounter, 22132 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2136 GetRequests, 2071 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20681occurred in iteration=20, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 40651 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 14202 NumberOfCodeBlocks, 14202 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 14843 ConstructedInterpolants, 0 QuantifiedInterpolants, 42587 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1733 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 31 InterpolantComputations, 27 PerfectInterpolantSequences, 25974/26288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((a23 <= 138) && (a4 == 1)) && (a25 != 9)) || ((((a25 == 13) && (a4 == 1)) && (a23 <= 312)) && (a29 <= 130))) || (((((((long long) a23 + 55) <= 0) && (a25 == 12)) && (a29 <= 277)) && (a4 == 0)) && (141 <= a29))) || ((((a4 == 1) && (a23 <= 312)) && (a25 <= 9)) && (0 <= ((long long) a23 + 42)))) || ((a23 <= 600000) && (((((a25 == 12) && (a29 <= 277)) && (a4 == 1)) && (246 <= a29)) || ((((a29 <= 277) && (a25 == 11)) && (a4 == 1)) && (246 <= a29))))) || ((((((long long) a23 + 55) <= 0) && (a4 == 0)) && (a25 <= 9)) && (a29 <= 130))) || (((a23 <= 599997) && (141 <= a29)) && ((((a25 == 12) && (a4 == 1)) && (a29 <= 232)) || (((a25 == 11) && (a29 <= 220)) && (a4 == 1))))) || ((((a29 <= 277) && (a25 <= 10)) && (141 <= a29)) && (a4 == 1))) || (((((a23 <= 600000) && (260 <= a29)) && (307 <= a23)) && (a25 == 11)) && (a4 == 1))) || ((((a25 == 13) && (260 <= a29)) && (a23 <= 599997)) && (a4 == 1))) || ((((a23 <= 600000) && (260 <= a29)) && (a25 <= 10)) && (a4 == 1))) || ((((((long long) a23 + 55) <= 0) && (a25 == 12)) && (a4 == 0)) && (a29 <= 130))) || (((a23 <= 599997) && (a4 == 1)) && (a25 == 10))) || ((((a25 == 12) && (a29 <= 277)) && (a4 == 0)) && (246 <= a29))) || ((((a25 == 13) && (a23 <= 599997)) && (307 <= a23)) && (a4 == 1))) || ((((a25 == 13) && (a29 <= 240)) && (141 <= a29)) && (a4 == 1))) || ((((long long) a23 + 55) <= 0) && ((((a4 == 0) && (a25 == 10)) && (a29 <= 130)) || (((a4 == 0) && (a25 == 11)) && (a29 <= 130))))) || ((((a25 == 12) && ((a23 < 307) || (a29 < 278))) && (a4 == 1)) && (a23 <= 312))) || ((((260 <= a29) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (a25 <= 9))) || (((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 277)) && (a4 == 0)) && (246 <= a29))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:13:48,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE