./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label40.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/Problem02_label40.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', 'f0697d9089c8f644e106fd291328f66f211f5f9eb49bfcc0a5bab680b0bbbbc1'] 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/Problem02_label40.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 f0697d9089c8f644e106fd291328f66f211f5f9eb49bfcc0a5bab680b0bbbbc1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:55:14,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:55:14,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 18:55:14,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:55:14,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:55:15,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:55:15,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:55:15,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:55:15,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:55:15,014 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:55:15,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:55:15,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:55:15,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:55:15,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:55:15,015 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:55:15,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:55:15,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:55:15,015 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:55:15,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:55:15,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:55:15,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:55:15,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:55:15,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:55:15,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:55:15,015 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:55:15,015 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:55:15,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:55:15,015 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:55:15,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:55:15,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:55:15,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:55:15,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:55:15,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:55:15,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:55:15,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:55:15,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:55:15,016 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:55:15,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:55:15,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:55:15,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:55:15,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:55:15,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:55:15,017 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 -> f0697d9089c8f644e106fd291328f66f211f5f9eb49bfcc0a5bab680b0bbbbc1 [2024-11-06 18:55:15,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:55:15,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:55:15,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:55:15,207 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:55:15,210 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:55:15,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label40.c [2024-11-06 18:55:16,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:55:16,626 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:55:16,626 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label40.c [2024-11-06 18:55:16,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/028d3bdae/6e31ceff5c8e43b2aa924dc0d958de88/FLAG345263a80 [2024-11-06 18:55:16,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/028d3bdae/6e31ceff5c8e43b2aa924dc0d958de88 [2024-11-06 18:55:16,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:55:16,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:55:16,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:55:16,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:55:16,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:55:16,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:55:16" (1/1) ... [2024-11-06 18:55:16,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f08c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:16, skipping insertion in model container [2024-11-06 18:55:16,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:55:16" (1/1) ... [2024-11-06 18:55:16,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:55:17,143 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/Problem02_label40.c[15538,15551] [2024-11-06 18:55:17,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:55:17,176 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:55:17,242 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/Problem02_label40.c[15538,15551] [2024-11-06 18:55:17,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:55:17,277 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:55:17,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17 WrapperNode [2024-11-06 18:55:17,279 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:55:17,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:55:17,280 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:55:17,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:55:17,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,327 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-06 18:55:17,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:55:17,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:55:17,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:55:17,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:55:17,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,366 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 18:55:17,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,381 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:55:17,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:55:17,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:55:17,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:55:17,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:55:17,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:55:17,425 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 18:55:17,429 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 18:55:17,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:55:17,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:55:17,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:55:17,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:55:17,525 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:55:17,526 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:55:18,285 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-06 18:55:18,285 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:55:18,298 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:55:18,298 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 18:55:18,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:55:18 BoogieIcfgContainer [2024-11-06 18:55:18,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:55:18,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:55:18,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:55:18,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:55:18,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:55:16" (1/3) ... [2024-11-06 18:55:18,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1321d30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:55:18, skipping insertion in model container [2024-11-06 18:55:18,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (2/3) ... [2024-11-06 18:55:18,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1321d30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:55:18, skipping insertion in model container [2024-11-06 18:55:18,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:55:18" (3/3) ... [2024-11-06 18:55:18,310 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label40.c [2024-11-06 18:55:18,320 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:55:18,321 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:55:18,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:55:18,393 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;@12e74f7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:55:18,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:55:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 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 18:55:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-06 18:55:18,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:18,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:18,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:18,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:18,412 INFO L85 PathProgramCache]: Analyzing trace with hash 427661899, now seen corresponding path program 1 times [2024-11-06 18:55:18,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:18,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733038974] [2024-11-06 18:55:18,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:18,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:18,837 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 18:55:18,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:18,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733038974] [2024-11-06 18:55:18,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733038974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:18,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:18,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:18,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850109831] [2024-11-06 18:55:18,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:18,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:18,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:18,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:18,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:18,860 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 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 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:19,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:19,411 INFO L93 Difference]: Finished difference Result 630 states and 1070 transitions. [2024-11-06 18:55:19,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:19,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-06 18:55:19,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:19,422 INFO L225 Difference]: With dead ends: 630 [2024-11-06 18:55:19,424 INFO L226 Difference]: Without dead ends: 318 [2024-11-06 18:55:19,427 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 18:55:19,428 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 141 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:19,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 119 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:55:19,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-06 18:55:19,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-11-06 18:55:19,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.473186119873817) internal successors, (467), 317 states have internal predecessors, (467), 0 states have call successors, (0), 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 18:55:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2024-11-06 18:55:19,481 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 89 [2024-11-06 18:55:19,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:19,482 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2024-11-06 18:55:19,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2024-11-06 18:55:19,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-06 18:55:19,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:19,485 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 18:55:19,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 18:55:19,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:19,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:19,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1584478528, now seen corresponding path program 1 times [2024-11-06 18:55:19,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:19,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151108280] [2024-11-06 18:55:19,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:19,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:19,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:19,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151108280] [2024-11-06 18:55:19,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151108280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:19,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:19,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:19,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545589368] [2024-11-06 18:55:19,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:19,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:55:19,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:19,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:55:19,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:55:19,855 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:20,458 INFO L93 Difference]: Finished difference Result 999 states and 1508 transitions. [2024-11-06 18:55:20,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:55:20,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-06 18:55:20,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:20,461 INFO L225 Difference]: With dead ends: 999 [2024-11-06 18:55:20,461 INFO L226 Difference]: Without dead ends: 600 [2024-11-06 18:55:20,462 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 18:55:20,462 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 171 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:20,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 113 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:55:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-06 18:55:20,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-06 18:55:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.358931552587646) internal successors, (814), 599 states have internal predecessors, (814), 0 states have call successors, (0), 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 18:55:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 814 transitions. [2024-11-06 18:55:20,478 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 814 transitions. Word has length 93 [2024-11-06 18:55:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:20,478 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 814 transitions. [2024-11-06 18:55:20,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 814 transitions. [2024-11-06 18:55:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-06 18:55:20,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:20,481 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 18:55:20,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 18:55:20,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:20,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:20,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1935066262, now seen corresponding path program 1 times [2024-11-06 18:55:20,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:20,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135454819] [2024-11-06 18:55:20,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:20,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:20,571 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:20,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:20,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135454819] [2024-11-06 18:55:20,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135454819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:20,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:20,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:20,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748702628] [2024-11-06 18:55:20,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:20,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:20,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:20,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:20,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:20,572 INFO L87 Difference]: Start difference. First operand 600 states and 814 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:20,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:20,935 INFO L93 Difference]: Finished difference Result 1781 states and 2421 transitions. [2024-11-06 18:55:20,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:20,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-11-06 18:55:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:20,942 INFO L225 Difference]: With dead ends: 1781 [2024-11-06 18:55:20,945 INFO L226 Difference]: Without dead ends: 1183 [2024-11-06 18:55:20,946 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 18:55:20,947 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 158 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:20,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 99 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2024-11-06 18:55:20,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1173. [2024-11-06 18:55:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.3131399317406143) internal successors, (1539), 1172 states have internal predecessors, (1539), 0 states have call successors, (0), 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 18:55:20,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1539 transitions. [2024-11-06 18:55:20,995 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1539 transitions. Word has length 107 [2024-11-06 18:55:20,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:20,996 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1539 transitions. [2024-11-06 18:55:20,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:20,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1539 transitions. [2024-11-06 18:55:21,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-06 18:55:21,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:21,004 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] [2024-11-06 18:55:21,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 18:55:21,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:21,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:21,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1355718265, now seen corresponding path program 1 times [2024-11-06 18:55:21,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:21,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368371011] [2024-11-06 18:55:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:21,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:21,183 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 18:55:21,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:21,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368371011] [2024-11-06 18:55:21,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368371011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:21,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:21,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:21,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401158653] [2024-11-06 18:55:21,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:21,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:21,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:21,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:21,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:21,185 INFO L87 Difference]: Start difference. First operand 1173 states and 1539 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 18:55:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:21,806 INFO L93 Difference]: Finished difference Result 3329 states and 4392 transitions. [2024-11-06 18:55:21,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:21,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-11-06 18:55:21,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:21,814 INFO L225 Difference]: With dead ends: 3329 [2024-11-06 18:55:21,814 INFO L226 Difference]: Without dead ends: 2158 [2024-11-06 18:55:21,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:21,817 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 125 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:21,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 128 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:55:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2024-11-06 18:55:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2155. [2024-11-06 18:55:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 2154 states have (on average 1.201949860724234) internal successors, (2589), 2154 states have internal predecessors, (2589), 0 states have call successors, (0), 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 18:55:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2589 transitions. [2024-11-06 18:55:21,855 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2589 transitions. Word has length 113 [2024-11-06 18:55:21,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:21,856 INFO L471 AbstractCegarLoop]: Abstraction has 2155 states and 2589 transitions. [2024-11-06 18:55:21,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 18:55:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2589 transitions. [2024-11-06 18:55:21,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-06 18:55:21,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:21,858 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:21,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 18:55:21,859 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:21,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:21,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1989413815, now seen corresponding path program 1 times [2024-11-06 18:55:21,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:21,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221472021] [2024-11-06 18:55:21,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:21,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 18:55:21,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:21,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221472021] [2024-11-06 18:55:21,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221472021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:21,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:21,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:21,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963140452] [2024-11-06 18:55:21,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:21,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:21,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:21,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:21,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:21,988 INFO L87 Difference]: Start difference. First operand 2155 states and 2589 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:22,353 INFO L93 Difference]: Finished difference Result 5304 states and 6436 transitions. [2024-11-06 18:55:22,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:22,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-06 18:55:22,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:22,363 INFO L225 Difference]: With dead ends: 5304 [2024-11-06 18:55:22,363 INFO L226 Difference]: Without dead ends: 2871 [2024-11-06 18:55:22,366 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 18:55:22,367 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 72 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:22,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 227 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:22,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2024-11-06 18:55:22,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2856. [2024-11-06 18:55:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2856 states, 2855 states have (on average 1.1936952714535902) internal successors, (3408), 2855 states have internal predecessors, (3408), 0 states have call successors, (0), 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 18:55:22,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 3408 transitions. [2024-11-06 18:55:22,434 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 3408 transitions. Word has length 116 [2024-11-06 18:55:22,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:22,434 INFO L471 AbstractCegarLoop]: Abstraction has 2856 states and 3408 transitions. [2024-11-06 18:55:22,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:22,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 3408 transitions. [2024-11-06 18:55:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-06 18:55:22,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:22,437 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-06 18:55:22,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 18:55:22,437 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:22,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:22,438 INFO L85 PathProgramCache]: Analyzing trace with hash 443706062, now seen corresponding path program 1 times [2024-11-06 18:55:22,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:22,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093305930] [2024-11-06 18:55:22,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:22,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:22,499 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:22,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:22,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093305930] [2024-11-06 18:55:22,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093305930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:22,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:22,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:22,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19619898] [2024-11-06 18:55:22,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:22,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:22,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:22,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:22,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:22,501 INFO L87 Difference]: Start difference. First operand 2856 states and 3408 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 18:55:22,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:22,840 INFO L93 Difference]: Finished difference Result 6832 states and 8225 transitions. [2024-11-06 18:55:22,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:22,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-11-06 18:55:22,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:22,849 INFO L225 Difference]: With dead ends: 6832 [2024-11-06 18:55:22,849 INFO L226 Difference]: Without dead ends: 3978 [2024-11-06 18:55:22,852 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 18:55:22,852 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 159 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:22,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 59 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3978 states. [2024-11-06 18:55:22,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 3832. [2024-11-06 18:55:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3832 states, 3831 states have (on average 1.1944661968154529) internal successors, (4576), 3831 states have internal predecessors, (4576), 0 states have call successors, (0), 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 18:55:22,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 4576 transitions. [2024-11-06 18:55:22,969 INFO L78 Accepts]: Start accepts. Automaton has 3832 states and 4576 transitions. Word has length 118 [2024-11-06 18:55:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:22,971 INFO L471 AbstractCegarLoop]: Abstraction has 3832 states and 4576 transitions. [2024-11-06 18:55:22,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 18:55:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3832 states and 4576 transitions. [2024-11-06 18:55:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-06 18:55:22,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:22,975 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:22,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 18:55:22,975 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:22,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:22,975 INFO L85 PathProgramCache]: Analyzing trace with hash 667063112, now seen corresponding path program 1 times [2024-11-06 18:55:22,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:22,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179382566] [2024-11-06 18:55:22,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:22,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 18:55:23,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:23,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179382566] [2024-11-06 18:55:23,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179382566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:23,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:23,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:23,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355183385] [2024-11-06 18:55:23,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:23,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:23,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:23,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:23,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:23,057 INFO L87 Difference]: Start difference. First operand 3832 states and 4576 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 18:55:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:23,430 INFO L93 Difference]: Finished difference Result 8663 states and 10394 transitions. [2024-11-06 18:55:23,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:23,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 124 [2024-11-06 18:55:23,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:23,443 INFO L225 Difference]: With dead ends: 8663 [2024-11-06 18:55:23,444 INFO L226 Difference]: Without dead ends: 4833 [2024-11-06 18:55:23,448 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 18:55:23,448 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 156 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:23,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 253 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2024-11-06 18:55:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4133. [2024-11-06 18:55:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4133 states, 4132 states have (on average 1.1844143272023233) internal successors, (4894), 4132 states have internal predecessors, (4894), 0 states have call successors, (0), 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 18:55:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4133 states to 4133 states and 4894 transitions. [2024-11-06 18:55:23,516 INFO L78 Accepts]: Start accepts. Automaton has 4133 states and 4894 transitions. Word has length 124 [2024-11-06 18:55:23,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:23,516 INFO L471 AbstractCegarLoop]: Abstraction has 4133 states and 4894 transitions. [2024-11-06 18:55:23,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 18:55:23,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4133 states and 4894 transitions. [2024-11-06 18:55:23,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-06 18:55:23,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:23,520 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:23,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 18:55:23,521 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:23,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:23,521 INFO L85 PathProgramCache]: Analyzing trace with hash 822674727, now seen corresponding path program 1 times [2024-11-06 18:55:23,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:23,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015854979] [2024-11-06 18:55:23,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:23,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 18:55:23,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:23,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015854979] [2024-11-06 18:55:23,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015854979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:23,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:23,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:23,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413440715] [2024-11-06 18:55:23,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:23,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:23,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:23,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:23,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:23,585 INFO L87 Difference]: Start difference. First operand 4133 states and 4894 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 18:55:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:23,901 INFO L93 Difference]: Finished difference Result 7534 states and 8929 transitions. [2024-11-06 18:55:23,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:23,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 133 [2024-11-06 18:55:23,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:23,908 INFO L225 Difference]: With dead ends: 7534 [2024-11-06 18:55:23,908 INFO L226 Difference]: Without dead ends: 2843 [2024-11-06 18:55:23,912 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 18:55:23,912 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 141 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:23,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 243 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2024-11-06 18:55:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2563. [2024-11-06 18:55:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2563 states, 2562 states have (on average 1.1174863387978142) internal successors, (2863), 2562 states have internal predecessors, (2863), 0 states have call successors, (0), 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 18:55:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 2863 transitions. [2024-11-06 18:55:23,962 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 2863 transitions. Word has length 133 [2024-11-06 18:55:23,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:23,962 INFO L471 AbstractCegarLoop]: Abstraction has 2563 states and 2863 transitions. [2024-11-06 18:55:23,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 18:55:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 2863 transitions. [2024-11-06 18:55:23,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-06 18:55:23,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:23,965 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:23,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 18:55:23,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:23,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:23,966 INFO L85 PathProgramCache]: Analyzing trace with hash -497470912, now seen corresponding path program 1 times [2024-11-06 18:55:23,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:23,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436835055] [2024-11-06 18:55:23,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:23,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-06 18:55:24,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:24,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436835055] [2024-11-06 18:55:24,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436835055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:24,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:24,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:24,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167152779] [2024-11-06 18:55:24,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:24,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:24,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:24,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:24,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:24,034 INFO L87 Difference]: Start difference. First operand 2563 states and 2863 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 18:55:24,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:24,349 INFO L93 Difference]: Finished difference Result 5408 states and 6023 transitions. [2024-11-06 18:55:24,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:24,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 156 [2024-11-06 18:55:24,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:24,355 INFO L225 Difference]: With dead ends: 5408 [2024-11-06 18:55:24,355 INFO L226 Difference]: Without dead ends: 2564 [2024-11-06 18:55:24,357 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 18:55:24,357 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 113 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:24,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 252 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2024-11-06 18:55:24,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2560. [2024-11-06 18:55:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 2559 states have (on average 1.0937866354044548) internal successors, (2799), 2559 states have internal predecessors, (2799), 0 states have call successors, (0), 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 18:55:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 2799 transitions. [2024-11-06 18:55:24,382 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 2799 transitions. Word has length 156 [2024-11-06 18:55:24,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:24,382 INFO L471 AbstractCegarLoop]: Abstraction has 2560 states and 2799 transitions. [2024-11-06 18:55:24,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 18:55:24,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 2799 transitions. [2024-11-06 18:55:24,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-06 18:55:24,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:24,385 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:24,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 18:55:24,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:24,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:24,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1875690035, now seen corresponding path program 1 times [2024-11-06 18:55:24,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:24,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765654022] [2024-11-06 18:55:24,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:24,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 18:55:24,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:24,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765654022] [2024-11-06 18:55:24,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765654022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:24,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:24,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:55:24,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322635705] [2024-11-06 18:55:24,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:24,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 18:55:24,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:24,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 18:55:24,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:55:24,614 INFO L87 Difference]: Start difference. First operand 2560 states and 2799 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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 18:55:25,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:25,066 INFO L93 Difference]: Finished difference Result 2648 states and 2886 transitions. [2024-11-06 18:55:25,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:55:25,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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 163 [2024-11-06 18:55:25,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:25,071 INFO L225 Difference]: With dead ends: 2648 [2024-11-06 18:55:25,072 INFO L226 Difference]: Without dead ends: 2420 [2024-11-06 18:55:25,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:55:25,073 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 184 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:25,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 98 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:55:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2024-11-06 18:55:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2420. [2024-11-06 18:55:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2420 states, 2419 states have (on average 1.097147581645308) internal successors, (2654), 2419 states have internal predecessors, (2654), 0 states have call successors, (0), 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 18:55:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 2654 transitions. [2024-11-06 18:55:25,097 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 2654 transitions. Word has length 163 [2024-11-06 18:55:25,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:25,097 INFO L471 AbstractCegarLoop]: Abstraction has 2420 states and 2654 transitions. [2024-11-06 18:55:25,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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 18:55:25,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2654 transitions. [2024-11-06 18:55:25,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-06 18:55:25,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:25,100 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:25,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 18:55:25,101 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:25,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:25,101 INFO L85 PathProgramCache]: Analyzing trace with hash 460269918, now seen corresponding path program 1 times [2024-11-06 18:55:25,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:25,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518647591] [2024-11-06 18:55:25,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:25,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-06 18:55:25,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:25,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518647591] [2024-11-06 18:55:25,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518647591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:25,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:25,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:25,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009057772] [2024-11-06 18:55:25,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:25,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:25,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:25,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:25,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:25,178 INFO L87 Difference]: Start difference. First operand 2420 states and 2654 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 18:55:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:25,510 INFO L93 Difference]: Finished difference Result 5398 states and 5967 transitions. [2024-11-06 18:55:25,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:25,511 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 177 [2024-11-06 18:55:25,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:25,517 INFO L225 Difference]: With dead ends: 5398 [2024-11-06 18:55:25,518 INFO L226 Difference]: Without dead ends: 2980 [2024-11-06 18:55:25,519 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 18:55:25,520 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 136 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:25,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 200 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2024-11-06 18:55:25,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2699. [2024-11-06 18:55:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 2698 states have (on average 1.094885100074129) internal successors, (2954), 2698 states have internal predecessors, (2954), 0 states have call successors, (0), 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 18:55:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 2954 transitions. [2024-11-06 18:55:25,561 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 2954 transitions. Word has length 177 [2024-11-06 18:55:25,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:25,561 INFO L471 AbstractCegarLoop]: Abstraction has 2699 states and 2954 transitions. [2024-11-06 18:55:25,562 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 18:55:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 2954 transitions. [2024-11-06 18:55:25,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-06 18:55:25,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:25,565 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:25,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 18:55:25,566 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:25,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:25,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1560166325, now seen corresponding path program 1 times [2024-11-06 18:55:25,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:25,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559688646] [2024-11-06 18:55:25,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:25,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-06 18:55:25,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:25,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559688646] [2024-11-06 18:55:25,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559688646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:25,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:25,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:25,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325284781] [2024-11-06 18:55:25,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:25,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:25,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:25,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:25,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:25,669 INFO L87 Difference]: Start difference. First operand 2699 states and 2954 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 18:55:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:25,943 INFO L93 Difference]: Finished difference Result 4681 states and 5086 transitions. [2024-11-06 18:55:25,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:25,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 200 [2024-11-06 18:55:25,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:25,944 INFO L225 Difference]: With dead ends: 4681 [2024-11-06 18:55:25,944 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 18:55:25,947 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 18:55:25,947 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 171 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:25,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 57 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:25,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 18:55:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 18:55:25,948 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 18:55:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 18:55:25,948 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 200 [2024-11-06 18:55:25,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:25,948 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 18:55:25,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 18:55:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 18:55:25,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 18:55:25,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:55:25,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 18:55:25,953 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:25,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 18:55:26,193 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:55:26,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:55:26 BoogieIcfgContainer [2024-11-06 18:55:26,214 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:55:26,215 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:55:26,215 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:55:26,215 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:55:26,216 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:55:18" (3/4) ... [2024-11-06 18:55:26,217 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 18:55:26,234 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 18:55:26,235 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 18:55:26,235 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 18:55:26,236 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 18:55:26,335 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 18:55:26,336 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 18:55:26,336 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:55:26,337 INFO L158 Benchmark]: Toolchain (without parser) took 9377.10ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 115.4MB in the beginning and 262.2MB in the end (delta: -146.8MB). Peak memory consumption was 182.9MB. Max. memory is 16.1GB. [2024-11-06 18:55:26,337 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:55:26,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.76ms. Allocated memory is still 142.6MB. Free memory was 115.2MB in the beginning and 88.8MB in the end (delta: 26.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 18:55:26,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.80ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 83.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:55:26,339 INFO L158 Benchmark]: Boogie Preprocessor took 64.19ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 78.9MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:55:26,339 INFO L158 Benchmark]: RCFGBuilder took 902.17ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 67.7MB in the end (delta: 11.3MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. [2024-11-06 18:55:26,339 INFO L158 Benchmark]: TraceAbstraction took 7911.80ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 67.0MB in the beginning and 102.6MB in the end (delta: -35.6MB). Peak memory consumption was 124.4MB. Max. memory is 16.1GB. [2024-11-06 18:55:26,339 INFO L158 Benchmark]: Witness Printer took 121.22ms. Allocated memory is still 302.0MB. Free memory was 102.6MB in the beginning and 262.2MB in the end (delta: -159.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:55:26,343 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.20ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.76ms. Allocated memory is still 142.6MB. Free memory was 115.2MB in the beginning and 88.8MB in the end (delta: 26.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.80ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 83.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.19ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 78.9MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 902.17ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 67.7MB in the end (delta: 11.3MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7911.80ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 67.0MB in the beginning and 102.6MB in the end (delta: -35.6MB). Peak memory consumption was 124.4MB. Max. memory is 16.1GB. * Witness Printer took 121.22ms. Allocated memory is still 302.0MB. Free memory was 102.6MB in the beginning and 262.2MB in the end (delta: -159.6MB). Peak memory consumption was 8.4MB. 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: 449]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1727 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1727 mSDsluCounter, 1848 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 240 mSDsCounter, 826 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4979 IncrementalHoareTripleChecker+Invalid, 5805 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 826 mSolverCounterUnsat, 1608 mSDtfsCounter, 4979 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4133occurred in iteration=7, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 1439 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1589 NumberOfCodeBlocks, 1589 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1577 ConstructedInterpolants, 0 QuantifiedInterpolants, 5755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 810/810 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: 616]: Loop Invariant Derived loop invariant: ((((((((((((((a25 == 1) && (a11 <= 0)) && (a19 == 1)) || (((a11 <= 0) && (a28 <= 10)) && (a19 == 1))) || ((a19 == 0) && (a11 == 1))) || ((11 <= a28) && (a11 == 1))) || (((9 <= a28) && (a11 == 1)) && (a19 == 1))) || (((((a17 == 8) && (a25 == 1)) && (a11 == 1)) && (a21 == 1)) && (a19 == 1))) || (((a19 == 0) && (a11 <= 0)) && (a28 <= 7))) || ((((a25 == 1) && (a11 == 1)) && (a19 == 1)) && (a28 <= 7))) || ((((a19 == 0) && (9 <= a28)) && (a11 <= 0)) && (a28 <= 10))) || (((a19 == 0) && (a11 <= 0)) && (a25 == 0))) || ((((a19 == 0) && (a11 <= 0)) && (a28 <= 10)) && (a25 <= 0))) || (((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a19 == 1)) && (a28 <= 7))) RESULT: Ultimate proved your program to be correct! [2024-11-06 18:55:26,363 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