./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/eca-rers2012/Problem11_label44.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '16a882266f214f7bbe3e2aa4aa7afa01c1567a6c47ab95da663021c70813ff8b'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label44.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 16a882266f214f7bbe3e2aa4aa7afa01c1567a6c47ab95da663021c70813ff8b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:39:32,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:39:32,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:39:32,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:39:32,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:39:32,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:39:32,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:39:32,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:39:32,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:39:32,285 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:39:32,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:39:32,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:39:32,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:39:32,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:39:32,286 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:39:32,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:39:32,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:39:32,286 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:39:32,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:39:32,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:39:32,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:39:32,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:39:32,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:39:32,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:39:32,287 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:39:32,287 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:39:32,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:39:32,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:39:32,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:39:32,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:39:32,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:39:32,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:39:32,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:39:32,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:39:32,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:39:32,288 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:39:32,288 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:39:32,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:39:32,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:39:32,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:39:32,289 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:39:32,289 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:39:32,289 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 16a882266f214f7bbe3e2aa4aa7afa01c1567a6c47ab95da663021c70813ff8b [2024-11-06 19:39:32,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:39:32,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:39:32,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:39:32,552 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:39:32,552 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:39:32,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label44.c [2024-11-06 19:39:33,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:39:34,230 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:39:34,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label44.c [2024-11-06 19:39:34,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02fa2847c/59aa36567c694c1e9fc6070d52b3a64a/FLAG264ce6412 [2024-11-06 19:39:34,265 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02fa2847c/59aa36567c694c1e9fc6070d52b3a64a [2024-11-06 19:39:34,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:39:34,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:39:34,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:39:34,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:39:34,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:39:34,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:39:34" (1/1) ... [2024-11-06 19:39:34,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@383b4cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:34, skipping insertion in model container [2024-11-06 19:39:34,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:39:34" (1/1) ... [2024-11-06 19:39:34,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:39:34,504 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label44.c[3841,3854] [2024-11-06 19:39:34,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:39:34,808 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:39:34,830 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label44.c[3841,3854] [2024-11-06 19:39:34,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:39:34,972 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:39:34,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:34 WrapperNode [2024-11-06 19:39:34,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:39:34,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:39:34,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:39:34,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:39:34,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:34" (1/1) ... [2024-11-06 19:39:35,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:34" (1/1) ... [2024-11-06 19:39:35,118 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-06 19:39:35,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:39:35,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:39:35,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:39:35,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:39:35,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:34" (1/1) ... [2024-11-06 19:39:35,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:34" (1/1) ... [2024-11-06 19:39:35,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:34" (1/1) ... [2024-11-06 19:39:35,200 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-06 19:39:35,200 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:34" (1/1) ... [2024-11-06 19:39:35,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:34" (1/1) ... [2024-11-06 19:39:35,239 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:34" (1/1) ... [2024-11-06 19:39:35,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:34" (1/1) ... [2024-11-06 19:39:35,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:34" (1/1) ... [2024-11-06 19:39:35,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:34" (1/1) ... [2024-11-06 19:39:35,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:39:35,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:39:35,284 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:39:35,284 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:39:35,285 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:34" (1/1) ... [2024-11-06 19:39:35,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:39:35,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:39:35,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 19:39:35,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 19:39:35,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:39:35,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:39:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:39:35,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:39:35,415 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:39:35,417 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:39:36,994 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-06 19:39:36,995 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:39:37,013 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:39:37,014 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:39:37,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:39:37 BoogieIcfgContainer [2024-11-06 19:39:37,014 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:39:37,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:39:37,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:39:37,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:39:37,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:39:34" (1/3) ... [2024-11-06 19:39:37,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c8a84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:39:37, skipping insertion in model container [2024-11-06 19:39:37,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:34" (2/3) ... [2024-11-06 19:39:37,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c8a84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:39:37, skipping insertion in model container [2024-11-06 19:39:37,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:39:37" (3/3) ... [2024-11-06 19:39:37,025 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label44.c [2024-11-06 19:39:37,037 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:39:37,038 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:39:37,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:39:37,106 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;@23538149, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:39:37,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:39:37,113 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-06 19:39:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 19:39:37,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:37,121 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] [2024-11-06 19:39:37,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:37,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:37,126 INFO L85 PathProgramCache]: Analyzing trace with hash 678582746, now seen corresponding path program 1 times [2024-11-06 19:39:37,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:37,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549311887] [2024-11-06 19:39:37,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:37,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:37,404 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-06 19:39:37,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:37,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549311887] [2024-11-06 19:39:37,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549311887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:37,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:37,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:37,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931119827] [2024-11-06 19:39:37,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:37,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:37,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:37,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:37,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:37,431 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 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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-06 19:39:38,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:38,569 INFO L93 Difference]: Finished difference Result 763 states and 1352 transitions. [2024-11-06 19:39:38,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:38,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-06 19:39:38,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:38,584 INFO L225 Difference]: With dead ends: 763 [2024-11-06 19:39:38,584 INFO L226 Difference]: Without dead ends: 416 [2024-11-06 19:39:38,587 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-06 19:39:38,592 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:38,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 89 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:39:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-06 19:39:38,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2024-11-06 19:39:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.6142506142506143) internal successors, (657), 407 states have internal predecessors, (657), 0 states have call successors, (0), 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-06 19:39:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 657 transitions. [2024-11-06 19:39:38,653 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 657 transitions. Word has length 26 [2024-11-06 19:39:38,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:38,653 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 657 transitions. [2024-11-06 19:39:38,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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-06 19:39:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 657 transitions. [2024-11-06 19:39:38,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-06 19:39:38,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:38,656 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:38,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:39:38,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:38,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:38,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1710179134, now seen corresponding path program 1 times [2024-11-06 19:39:38,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:38,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497096533] [2024-11-06 19:39:38,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:38,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:38,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:38,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497096533] [2024-11-06 19:39:38,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497096533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:38,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:38,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:38,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418188919] [2024-11-06 19:39:38,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:38,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:38,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:38,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:38,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:38,938 INFO L87 Difference]: Start difference. First operand 408 states and 657 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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-06 19:39:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:39,705 INFO L93 Difference]: Finished difference Result 1191 states and 1930 transitions. [2024-11-06 19:39:39,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:39,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-06 19:39:39,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:39,712 INFO L225 Difference]: With dead ends: 1191 [2024-11-06 19:39:39,712 INFO L226 Difference]: Without dead ends: 785 [2024-11-06 19:39:39,714 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-06 19:39:39,714 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 141 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:39,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 152 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:39,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-06 19:39:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 783. [2024-11-06 19:39:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.438618925831202) internal successors, (1125), 782 states have internal predecessors, (1125), 0 states have call successors, (0), 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-06 19:39:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1125 transitions. [2024-11-06 19:39:39,751 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1125 transitions. Word has length 91 [2024-11-06 19:39:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:39,752 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1125 transitions. [2024-11-06 19:39:39,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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-06 19:39:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1125 transitions. [2024-11-06 19:39:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-06 19:39:39,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:39,756 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:39,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:39:39,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:39,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:39,757 INFO L85 PathProgramCache]: Analyzing trace with hash -308519566, now seen corresponding path program 1 times [2024-11-06 19:39:39,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:39,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969433870] [2024-11-06 19:39:39,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:39,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:39,969 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:39,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:39,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969433870] [2024-11-06 19:39:39,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969433870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:39,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:39,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:39,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096008040] [2024-11-06 19:39:39,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:39,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:39,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:39,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:39,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:39,971 INFO L87 Difference]: Start difference. First operand 783 states and 1125 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:40,668 INFO L93 Difference]: Finished difference Result 1948 states and 2801 transitions. [2024-11-06 19:39:40,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:40,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-06 19:39:40,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:40,675 INFO L225 Difference]: With dead ends: 1948 [2024-11-06 19:39:40,675 INFO L226 Difference]: Without dead ends: 1167 [2024-11-06 19:39:40,676 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-06 19:39:40,677 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 144 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:40,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 116 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2024-11-06 19:39:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1154. [2024-11-06 19:39:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.3391153512575888) internal successors, (1544), 1153 states have internal predecessors, (1544), 0 states have call successors, (0), 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-06 19:39:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1544 transitions. [2024-11-06 19:39:40,707 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1544 transitions. Word has length 94 [2024-11-06 19:39:40,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:40,709 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1544 transitions. [2024-11-06 19:39:40,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1544 transitions. [2024-11-06 19:39:40,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-06 19:39:40,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:40,711 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:40,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:39:40,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:40,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:40,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1570751308, now seen corresponding path program 1 times [2024-11-06 19:39:40,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:40,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090396653] [2024-11-06 19:39:40,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:40,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:41,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:41,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090396653] [2024-11-06 19:39:41,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090396653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:41,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:41,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:41,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786896855] [2024-11-06 19:39:41,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:41,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:41,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:41,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:41,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:41,010 INFO L87 Difference]: Start difference. First operand 1154 states and 1544 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 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-06 19:39:41,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:41,696 INFO L93 Difference]: Finished difference Result 2676 states and 3529 transitions. [2024-11-06 19:39:41,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:41,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-06 19:39:41,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:41,702 INFO L225 Difference]: With dead ends: 2676 [2024-11-06 19:39:41,702 INFO L226 Difference]: Without dead ends: 1524 [2024-11-06 19:39:41,704 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-06 19:39:41,705 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:41,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 189 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:41,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2024-11-06 19:39:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1523. [2024-11-06 19:39:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1522 states have (on average 1.268725361366623) internal successors, (1931), 1522 states have internal predecessors, (1931), 0 states have call successors, (0), 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-06 19:39:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1931 transitions. [2024-11-06 19:39:41,744 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1931 transitions. Word has length 95 [2024-11-06 19:39:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:41,744 INFO L471 AbstractCegarLoop]: Abstraction has 1523 states and 1931 transitions. [2024-11-06 19:39:41,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 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-06 19:39:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1931 transitions. [2024-11-06 19:39:41,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-06 19:39:41,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:41,746 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:39:41,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:39:41,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:41,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:41,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1821693585, now seen corresponding path program 1 times [2024-11-06 19:39:41,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:41,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536968328] [2024-11-06 19:39:41,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:41,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:41,898 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:41,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:41,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536968328] [2024-11-06 19:39:41,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536968328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:41,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:41,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:41,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857008349] [2024-11-06 19:39:41,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:41,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:41,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:41,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:41,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:41,900 INFO L87 Difference]: Start difference. First operand 1523 states and 1931 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 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-06 19:39:42,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:42,655 INFO L93 Difference]: Finished difference Result 3968 states and 5151 transitions. [2024-11-06 19:39:42,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:42,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 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-06 19:39:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:42,666 INFO L225 Difference]: With dead ends: 3968 [2024-11-06 19:39:42,666 INFO L226 Difference]: Without dead ends: 2631 [2024-11-06 19:39:42,668 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-06 19:39:42,670 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:42,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 154 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:42,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2024-11-06 19:39:42,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2447. [2024-11-06 19:39:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2446 states have (on average 1.2236304170073589) internal successors, (2993), 2446 states have internal predecessors, (2993), 0 states have call successors, (0), 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-06 19:39:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 2993 transitions. [2024-11-06 19:39:42,717 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 2993 transitions. Word has length 153 [2024-11-06 19:39:42,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:42,719 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 2993 transitions. [2024-11-06 19:39:42,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 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-06 19:39:42,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 2993 transitions. [2024-11-06 19:39:42,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-06 19:39:42,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:42,722 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:39:42,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:39:42,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:42,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:42,723 INFO L85 PathProgramCache]: Analyzing trace with hash -935191055, now seen corresponding path program 1 times [2024-11-06 19:39:42,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:42,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712535144] [2024-11-06 19:39:42,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:42,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-06 19:39:42,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:42,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712535144] [2024-11-06 19:39:42,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712535144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:42,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:42,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:42,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524031086] [2024-11-06 19:39:42,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:42,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:42,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:42,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:42,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:42,920 INFO L87 Difference]: Start difference. First operand 2447 states and 2993 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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-06 19:39:43,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:43,617 INFO L93 Difference]: Finished difference Result 5266 states and 6463 transitions. [2024-11-06 19:39:43,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:43,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 169 [2024-11-06 19:39:43,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:43,627 INFO L225 Difference]: With dead ends: 5266 [2024-11-06 19:39:43,628 INFO L226 Difference]: Without dead ends: 3005 [2024-11-06 19:39:43,630 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-06 19:39:43,631 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 75 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:43,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 153 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:43,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2024-11-06 19:39:43,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2820. [2024-11-06 19:39:43,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 2819 states have (on average 1.2220645619013835) internal successors, (3445), 2819 states have internal predecessors, (3445), 0 states have call successors, (0), 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-06 19:39:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 3445 transitions. [2024-11-06 19:39:43,686 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 3445 transitions. Word has length 169 [2024-11-06 19:39:43,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:43,687 INFO L471 AbstractCegarLoop]: Abstraction has 2820 states and 3445 transitions. [2024-11-06 19:39:43,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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-06 19:39:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 3445 transitions. [2024-11-06 19:39:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-06 19:39:43,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:43,691 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:39:43,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:39:43,691 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:43,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:43,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1559395122, now seen corresponding path program 1 times [2024-11-06 19:39:43,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:43,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271644824] [2024-11-06 19:39:43,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:43,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:43,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:43,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271644824] [2024-11-06 19:39:43,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271644824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:43,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:43,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:43,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985158771] [2024-11-06 19:39:43,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:43,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:43,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:43,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:43,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:43,960 INFO L87 Difference]: Start difference. First operand 2820 states and 3445 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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-06 19:39:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:44,669 INFO L93 Difference]: Finished difference Result 6567 states and 8101 transitions. [2024-11-06 19:39:44,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:44,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2024-11-06 19:39:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:44,683 INFO L225 Difference]: With dead ends: 6567 [2024-11-06 19:39:44,684 INFO L226 Difference]: Without dead ends: 3933 [2024-11-06 19:39:44,688 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-06 19:39:44,689 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:44,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 332 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:44,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3933 states. [2024-11-06 19:39:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3933 to 3556. [2024-11-06 19:39:44,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3556 states, 3555 states have (on average 1.2115330520393812) internal successors, (4307), 3555 states have internal predecessors, (4307), 0 states have call successors, (0), 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-06 19:39:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3556 states to 3556 states and 4307 transitions. [2024-11-06 19:39:44,753 INFO L78 Accepts]: Start accepts. Automaton has 3556 states and 4307 transitions. Word has length 206 [2024-11-06 19:39:44,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:44,753 INFO L471 AbstractCegarLoop]: Abstraction has 3556 states and 4307 transitions. [2024-11-06 19:39:44,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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-06 19:39:44,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 4307 transitions. [2024-11-06 19:39:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-06 19:39:44,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:44,756 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:39:44,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:39:44,756 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:44,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:44,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1693187880, now seen corresponding path program 1 times [2024-11-06 19:39:44,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:44,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210088728] [2024-11-06 19:39:44,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-06 19:39:45,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:45,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210088728] [2024-11-06 19:39:45,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210088728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:45,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:45,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:45,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019609856] [2024-11-06 19:39:45,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:45,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:45,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:45,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:45,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:45,044 INFO L87 Difference]: Start difference. First operand 3556 states and 4307 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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-06 19:39:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:45,879 INFO L93 Difference]: Finished difference Result 9521 states and 11627 transitions. [2024-11-06 19:39:45,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:45,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 207 [2024-11-06 19:39:45,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:45,900 INFO L225 Difference]: With dead ends: 9521 [2024-11-06 19:39:45,900 INFO L226 Difference]: Without dead ends: 5967 [2024-11-06 19:39:45,905 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-06 19:39:45,906 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 200 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:45,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 332 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:39:45,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5967 states. [2024-11-06 19:39:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5967 to 5231. [2024-11-06 19:39:45,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5231 states, 5230 states have (on average 1.2061185468451243) internal successors, (6308), 5230 states have internal predecessors, (6308), 0 states have call successors, (0), 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-06 19:39:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5231 states to 5231 states and 6308 transitions. [2024-11-06 19:39:45,995 INFO L78 Accepts]: Start accepts. Automaton has 5231 states and 6308 transitions. Word has length 207 [2024-11-06 19:39:45,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:45,996 INFO L471 AbstractCegarLoop]: Abstraction has 5231 states and 6308 transitions. [2024-11-06 19:39:45,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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-06 19:39:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 5231 states and 6308 transitions. [2024-11-06 19:39:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-06 19:39:46,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:46,002 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:39:46,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:39:46,003 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:46,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:46,003 INFO L85 PathProgramCache]: Analyzing trace with hash 192944744, now seen corresponding path program 1 times [2024-11-06 19:39:46,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:46,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676279969] [2024-11-06 19:39:46,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:46,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:46,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:46,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676279969] [2024-11-06 19:39:46,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676279969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:46,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:46,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:46,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509120648] [2024-11-06 19:39:46,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:46,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:46,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:46,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:46,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:46,246 INFO L87 Difference]: Start difference. First operand 5231 states and 6308 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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-06 19:39:46,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:46,935 INFO L93 Difference]: Finished difference Result 10457 states and 12611 transitions. [2024-11-06 19:39:46,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:46,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2024-11-06 19:39:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:46,953 INFO L225 Difference]: With dead ends: 10457 [2024-11-06 19:39:46,954 INFO L226 Difference]: Without dead ends: 5228 [2024-11-06 19:39:46,960 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-06 19:39:46,961 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 142 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:46,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 304 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:39:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2024-11-06 19:39:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 5228. [2024-11-06 19:39:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5228 states, 5227 states have (on average 1.178687583700019) internal successors, (6161), 5227 states have internal predecessors, (6161), 0 states have call successors, (0), 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-06 19:39:47,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5228 states to 5228 states and 6161 transitions. [2024-11-06 19:39:47,042 INFO L78 Accepts]: Start accepts. Automaton has 5228 states and 6161 transitions. Word has length 244 [2024-11-06 19:39:47,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:47,042 INFO L471 AbstractCegarLoop]: Abstraction has 5228 states and 6161 transitions. [2024-11-06 19:39:47,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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-06 19:39:47,043 INFO L276 IsEmpty]: Start isEmpty. Operand 5228 states and 6161 transitions. [2024-11-06 19:39:47,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-06 19:39:47,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:47,059 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-06 19:39:47,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:39:47,060 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:47,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:47,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1616620059, now seen corresponding path program 1 times [2024-11-06 19:39:47,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:47,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360873417] [2024-11-06 19:39:47,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:47,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-06 19:39:47,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:47,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360873417] [2024-11-06 19:39:47,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360873417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:47,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:47,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:47,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866966631] [2024-11-06 19:39:47,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:47,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:47,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:47,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:47,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:47,386 INFO L87 Difference]: Start difference. First operand 5228 states and 6161 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-06 19:39:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:48,035 INFO L93 Difference]: Finished difference Result 11195 states and 13196 transitions. [2024-11-06 19:39:48,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:48,036 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 258 [2024-11-06 19:39:48,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:48,053 INFO L225 Difference]: With dead ends: 11195 [2024-11-06 19:39:48,053 INFO L226 Difference]: Without dead ends: 5969 [2024-11-06 19:39:48,063 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-06 19:39:48,065 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 196 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:48,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 148 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:39:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2024-11-06 19:39:48,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 5228. [2024-11-06 19:39:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5228 states, 5227 states have (on average 1.178687583700019) internal successors, (6161), 5227 states have internal predecessors, (6161), 0 states have call successors, (0), 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-06 19:39:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5228 states to 5228 states and 6161 transitions. [2024-11-06 19:39:48,159 INFO L78 Accepts]: Start accepts. Automaton has 5228 states and 6161 transitions. Word has length 258 [2024-11-06 19:39:48,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:48,159 INFO L471 AbstractCegarLoop]: Abstraction has 5228 states and 6161 transitions. [2024-11-06 19:39:48,160 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-06 19:39:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 5228 states and 6161 transitions. [2024-11-06 19:39:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-06 19:39:48,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:48,163 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:48,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:39:48,164 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:48,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:48,164 INFO L85 PathProgramCache]: Analyzing trace with hash 292208959, now seen corresponding path program 1 times [2024-11-06 19:39:48,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:48,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106347030] [2024-11-06 19:39:48,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:48,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-06 19:39:48,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:48,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106347030] [2024-11-06 19:39:48,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106347030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:48,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:48,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:48,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877725848] [2024-11-06 19:39:48,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:48,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:39:48,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:48,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:39:48,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:39:48,521 INFO L87 Difference]: Start difference. First operand 5228 states and 6161 transitions. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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-06 19:39:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:49,811 INFO L93 Difference]: Finished difference Result 15807 states and 18813 transitions. [2024-11-06 19:39:49,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:39:49,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 261 [2024-11-06 19:39:49,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:49,833 INFO L225 Difference]: With dead ends: 15807 [2024-11-06 19:39:49,833 INFO L226 Difference]: Without dead ends: 10581 [2024-11-06 19:39:49,839 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-06 19:39:49,840 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:49,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 116 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:39:49,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10581 states. [2024-11-06 19:39:49,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10581 to 10019. [2024-11-06 19:39:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10019 states, 10018 states have (on average 1.1802755040926332) internal successors, (11824), 10018 states have internal predecessors, (11824), 0 states have call successors, (0), 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-06 19:39:49,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 11824 transitions. [2024-11-06 19:39:49,991 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 11824 transitions. Word has length 261 [2024-11-06 19:39:49,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:49,991 INFO L471 AbstractCegarLoop]: Abstraction has 10019 states and 11824 transitions. [2024-11-06 19:39:49,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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-06 19:39:49,992 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 11824 transitions. [2024-11-06 19:39:49,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-11-06 19:39:49,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:49,996 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:49,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:39:49,996 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:49,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:49,997 INFO L85 PathProgramCache]: Analyzing trace with hash -271673639, now seen corresponding path program 1 times [2024-11-06 19:39:49,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:49,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401375618] [2024-11-06 19:39:49,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:49,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:50,297 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:50,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:50,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401375618] [2024-11-06 19:39:50,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401375618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:50,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:50,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:50,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529758711] [2024-11-06 19:39:50,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:50,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:39:50,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:50,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:39:50,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:39:50,303 INFO L87 Difference]: Start difference. First operand 10019 states and 11824 transitions. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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-06 19:39:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:51,407 INFO L93 Difference]: Finished difference Result 25580 states and 30141 transitions. [2024-11-06 19:39:51,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:39:51,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 270 [2024-11-06 19:39:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:51,443 INFO L225 Difference]: With dead ends: 25580 [2024-11-06 19:39:51,443 INFO L226 Difference]: Without dead ends: 15931 [2024-11-06 19:39:51,456 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-06 19:39:51,456 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 258 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:51,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 77 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:39:51,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15931 states. [2024-11-06 19:39:51,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15931 to 15745. [2024-11-06 19:39:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15745 states, 15744 states have (on average 1.1689532520325203) internal successors, (18404), 15744 states have internal predecessors, (18404), 0 states have call successors, (0), 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-06 19:39:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15745 states to 15745 states and 18404 transitions. [2024-11-06 19:39:51,721 INFO L78 Accepts]: Start accepts. Automaton has 15745 states and 18404 transitions. Word has length 270 [2024-11-06 19:39:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:51,722 INFO L471 AbstractCegarLoop]: Abstraction has 15745 states and 18404 transitions. [2024-11-06 19:39:51,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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-06 19:39:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 15745 states and 18404 transitions. [2024-11-06 19:39:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-06 19:39:51,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:51,729 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:51,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:39:51,729 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:51,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:51,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2010794811, now seen corresponding path program 1 times [2024-11-06 19:39:51,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:51,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639279206] [2024-11-06 19:39:51,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:51,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-11-06 19:39:51,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:51,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639279206] [2024-11-06 19:39:51,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639279206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:51,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:51,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:51,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537905247] [2024-11-06 19:39:51,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:51,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:51,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:51,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:51,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:51,889 INFO L87 Difference]: Start difference. First operand 15745 states and 18404 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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-06 19:39:52,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:52,568 INFO L93 Difference]: Finished difference Result 32403 states and 37950 transitions. [2024-11-06 19:39:52,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:52,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 281 [2024-11-06 19:39:52,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:52,608 INFO L225 Difference]: With dead ends: 32403 [2024-11-06 19:39:52,608 INFO L226 Difference]: Without dead ends: 18136 [2024-11-06 19:39:52,625 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-06 19:39:52,627 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 193 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 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.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:52,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 151 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:39:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18136 states. [2024-11-06 19:39:52,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18136 to 13160. [2024-11-06 19:39:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13160 states, 13159 states have (on average 1.172201535071054) internal successors, (15425), 13159 states have internal predecessors, (15425), 0 states have call successors, (0), 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-06 19:39:52,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 15425 transitions. [2024-11-06 19:39:52,825 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 15425 transitions. Word has length 281 [2024-11-06 19:39:52,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:52,826 INFO L471 AbstractCegarLoop]: Abstraction has 13160 states and 15425 transitions. [2024-11-06 19:39:52,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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-06 19:39:52,826 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 15425 transitions. [2024-11-06 19:39:52,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-06 19:39:52,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:52,833 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-06 19:39:52,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:39:52,834 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:52,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:52,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1064230659, now seen corresponding path program 1 times [2024-11-06 19:39:52,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:52,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135174598] [2024-11-06 19:39:52,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:52,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-06 19:39:53,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:53,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135174598] [2024-11-06 19:39:53,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135174598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:53,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:53,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:53,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229094906] [2024-11-06 19:39:53,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:53,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:53,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:53,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:53,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:53,003 INFO L87 Difference]: Start difference. First operand 13160 states and 15425 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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-06 19:39:53,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:53,742 INFO L93 Difference]: Finished difference Result 28713 states and 33938 transitions. [2024-11-06 19:39:53,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:53,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 301 [2024-11-06 19:39:53,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:53,777 INFO L225 Difference]: With dead ends: 28713 [2024-11-06 19:39:53,777 INFO L226 Difference]: Without dead ends: 15923 [2024-11-06 19:39:53,791 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-06 19:39:53,792 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 181 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:53,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 159 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:53,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15923 states. [2024-11-06 19:39:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15923 to 13145. [2024-11-06 19:39:54,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13145 states, 13144 states have (on average 1.1517802799756542) internal successors, (15139), 13144 states have internal predecessors, (15139), 0 states have call successors, (0), 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-06 19:39:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13145 states to 13145 states and 15139 transitions. [2024-11-06 19:39:54,060 INFO L78 Accepts]: Start accepts. Automaton has 13145 states and 15139 transitions. Word has length 301 [2024-11-06 19:39:54,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:54,061 INFO L471 AbstractCegarLoop]: Abstraction has 13145 states and 15139 transitions. [2024-11-06 19:39:54,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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-06 19:39:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 13145 states and 15139 transitions. [2024-11-06 19:39:54,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-06 19:39:54,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:54,069 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:39:54,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:39:54,069 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:54,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1313485887, now seen corresponding path program 1 times [2024-11-06 19:39:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:54,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886051022] [2024-11-06 19:39:54,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:54,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-06 19:39:54,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:54,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886051022] [2024-11-06 19:39:54,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886051022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:54,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:54,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:54,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815024752] [2024-11-06 19:39:54,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:54,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:54,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:54,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:54,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:54,286 INFO L87 Difference]: Start difference. First operand 13145 states and 15139 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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-06 19:39:54,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:54,743 INFO L93 Difference]: Finished difference Result 25172 states and 28967 transitions. [2024-11-06 19:39:54,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:54,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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 308 [2024-11-06 19:39:54,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:54,773 INFO L225 Difference]: With dead ends: 25172 [2024-11-06 19:39:54,774 INFO L226 Difference]: Without dead ends: 12397 [2024-11-06 19:39:54,785 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-06 19:39:54,785 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 186 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:54,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 37 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 19:39:54,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12397 states. [2024-11-06 19:39:54,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12397 to 12395. [2024-11-06 19:39:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12395 states, 12394 states have (on average 1.1461190898822011) internal successors, (14205), 12394 states have internal predecessors, (14205), 0 states have call successors, (0), 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-06 19:39:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12395 states to 12395 states and 14205 transitions. [2024-11-06 19:39:55,017 INFO L78 Accepts]: Start accepts. Automaton has 12395 states and 14205 transitions. Word has length 308 [2024-11-06 19:39:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:55,018 INFO L471 AbstractCegarLoop]: Abstraction has 12395 states and 14205 transitions. [2024-11-06 19:39:55,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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-06 19:39:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 12395 states and 14205 transitions. [2024-11-06 19:39:55,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-06 19:39:55,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:55,025 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-06 19:39:55,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 19:39:55,026 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:55,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1486952426, now seen corresponding path program 1 times [2024-11-06 19:39:55,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:55,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715197562] [2024-11-06 19:39:55,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:55,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-06 19:39:55,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:55,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715197562] [2024-11-06 19:39:55,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715197562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:55,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:55,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:55,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122943647] [2024-11-06 19:39:55,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:55,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:55,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:55,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:55,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:55,273 INFO L87 Difference]: Start difference. First operand 12395 states and 14205 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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-06 19:39:55,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:55,927 INFO L93 Difference]: Finished difference Result 27738 states and 31821 transitions. [2024-11-06 19:39:55,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:55,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 330 [2024-11-06 19:39:55,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:55,963 INFO L225 Difference]: With dead ends: 27738 [2024-11-06 19:39:55,963 INFO L226 Difference]: Without dead ends: 15713 [2024-11-06 19:39:55,975 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-06 19:39:55,976 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 179 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:55,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 357 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:39:55,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15713 states. [2024-11-06 19:39:56,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15713 to 13687. [2024-11-06 19:39:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13687 states, 13686 states have (on average 1.1304983194505334) internal successors, (15472), 13686 states have internal predecessors, (15472), 0 states have call successors, (0), 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-06 19:39:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13687 states to 13687 states and 15472 transitions. [2024-11-06 19:39:56,181 INFO L78 Accepts]: Start accepts. Automaton has 13687 states and 15472 transitions. Word has length 330 [2024-11-06 19:39:56,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:56,182 INFO L471 AbstractCegarLoop]: Abstraction has 13687 states and 15472 transitions. [2024-11-06 19:39:56,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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-06 19:39:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 13687 states and 15472 transitions. [2024-11-06 19:39:56,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-06 19:39:56,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:56,189 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:39:56,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 19:39:56,189 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:56,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:56,191 INFO L85 PathProgramCache]: Analyzing trace with hash -842788195, now seen corresponding path program 1 times [2024-11-06 19:39:56,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:56,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856721289] [2024-11-06 19:39:56,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:56,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-06 19:39:56,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:56,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856721289] [2024-11-06 19:39:56,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856721289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:56,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:56,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:56,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303635202] [2024-11-06 19:39:56,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:56,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:56,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:56,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:56,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:56,340 INFO L87 Difference]: Start difference. First operand 13687 states and 15472 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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-06 19:39:56,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:56,939 INFO L93 Difference]: Finished difference Result 27922 states and 31577 transitions. [2024-11-06 19:39:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:56,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 337 [2024-11-06 19:39:56,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:56,940 INFO L225 Difference]: With dead ends: 27922 [2024-11-06 19:39:56,941 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:39:56,954 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-06 19:39:56,955 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 188 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:56,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 305 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:39:56,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:39:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:39:56,956 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-06 19:39:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:39:56,956 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 337 [2024-11-06 19:39:56,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:56,957 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:39:56,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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-06 19:39:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:39:56,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:39:56,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:39:56,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 19:39:56,962 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:56,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:39:59,088 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:39:59,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:39:59 BoogieIcfgContainer [2024-11-06 19:39:59,105 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:39:59,106 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:39:59,106 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:39:59,106 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:39:59,107 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:39:37" (3/4) ... [2024-11-06 19:39:59,108 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:39:59,131 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 19:39:59,135 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:39:59,136 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:39:59,137 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:39:59,279 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:39:59,280 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:39:59,280 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:39:59,281 INFO L158 Benchmark]: Toolchain (without parser) took 25011.60ms. Allocated memory was 117.4MB in the beginning and 562.0MB in the end (delta: 444.6MB). Free memory was 88.7MB in the beginning and 372.8MB in the end (delta: -284.0MB). Peak memory consumption was 163.1MB. Max. memory is 16.1GB. [2024-11-06 19:39:59,281 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:39:59,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 703.48ms. Allocated memory is still 117.4MB. Free memory was 88.5MB in the beginning and 45.8MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-06 19:39:59,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 144.02ms. Allocated memory is still 117.4MB. Free memory was 45.8MB in the beginning and 73.4MB in the end (delta: -27.6MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-11-06 19:39:59,281 INFO L158 Benchmark]: Boogie Preprocessor took 163.60ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 49.0MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 19:39:59,282 INFO L158 Benchmark]: RCFGBuilder took 1730.66ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 49.0MB in the beginning and 88.8MB in the end (delta: -39.8MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2024-11-06 19:39:59,282 INFO L158 Benchmark]: TraceAbstraction took 22086.71ms. Allocated memory was 151.0MB in the beginning and 562.0MB in the end (delta: 411.0MB). Free memory was 88.8MB in the beginning and 389.2MB in the end (delta: -300.5MB). Peak memory consumption was 383.8MB. Max. memory is 16.1GB. [2024-11-06 19:39:59,282 INFO L158 Benchmark]: Witness Printer took 174.13ms. Allocated memory is still 562.0MB. Free memory was 389.2MB in the beginning and 372.8MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 19:39:59,283 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.74ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 703.48ms. Allocated memory is still 117.4MB. Free memory was 88.5MB in the beginning and 45.8MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 144.02ms. Allocated memory is still 117.4MB. Free memory was 45.8MB in the beginning and 73.4MB in the end (delta: -27.6MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 163.60ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 49.0MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1730.66ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 49.0MB in the beginning and 88.8MB in the end (delta: -39.8MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * TraceAbstraction took 22086.71ms. Allocated memory was 151.0MB in the beginning and 562.0MB in the end (delta: 411.0MB). Free memory was 88.8MB in the beginning and 389.2MB in the end (delta: -300.5MB). Peak memory consumption was 383.8MB. Max. memory is 16.1GB. * Witness Printer took 174.13ms. Allocated memory is still 562.0MB. Free memory was 389.2MB in the beginning and 372.8MB in the end (delta: 16.5MB). 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: 94]: 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: 19.9s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2937 SdHoareTripleChecker+Valid, 12.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2937 mSDsluCounter, 3171 SdHoareTripleChecker+Invalid, 10.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 379 mSDsCounter, 1677 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10066 IncrementalHoareTripleChecker+Invalid, 11743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1677 mSolverCounterUnsat, 2792 mSDtfsCounter, 10066 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15745occurred in iteration=12, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 12777 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 3631 NumberOfCodeBlocks, 3631 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3614 ConstructedInterpolants, 0 QuantifiedInterpolants, 7340 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 2190/2190 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: (((((((((((((a4 == 1) && (a8 == 15)) && (247 <= a29)) || (((10 <= a25) && (a4 == 1)) && (a8 == 15))) || ((((a4 == 0) && (a8 == 15)) && (a25 == 10)) && (a29 <= 130))) || (((((10 <= a25) && (a4 == 0)) && (a23 <= 138)) && (a8 == 15)) && (247 <= a29))) || ((((a29 <= 140) && (a4 == 0)) && (a23 <= 138)) && (a8 == 15))) || (((a25 == 12) && (a4 == 0)) && (a8 == 15))) || (((a23 <= 138) && (a4 == 1)) && (a8 == 15))) || (((a29 <= 140) && (a4 == 1)) && (a8 == 15))) || ((((262 <= a29) && (a4 == 0)) && (a8 == 15)) && (a23 <= 137))) || (((307 <= a23) && (a4 == 1)) && (a8 == 15))) || ((((10 <= a25) && (a4 == 0)) && (a8 == 15)) && (a23 <= 137))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:39:59,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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