./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label38.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/Problem03_label38.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', 'd6ab095cb4c47e2e0ab83610e7dceb2c658ebc8f7a2b4be1c26690c64da4af60'] 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/Problem03_label38.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 d6ab095cb4c47e2e0ab83610e7dceb2c658ebc8f7a2b4be1c26690c64da4af60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:57:51,022 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:57:51,100 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:57:51,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:57:51,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:57:51,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:57:51,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:57:51,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:57:51,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:57:51,131 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:57:51,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:57:51,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:57:51,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:57:51,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:57:51,132 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:57:51,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:57:51,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:57:51,132 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:57:51,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:57:51,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:57:51,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:57:51,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:57:51,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:57:51,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:57:51,133 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:57:51,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:57:51,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:57:51,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:57:51,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:57:51,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:57:51,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:57:51,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:57:51,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:57:51,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:57:51,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:57:51,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:57:51,134 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:57:51,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:57:51,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:57:51,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:57:51,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:57:51,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:57:51,136 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 -> d6ab095cb4c47e2e0ab83610e7dceb2c658ebc8f7a2b4be1c26690c64da4af60 [2024-11-06 18:57:51,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:57:51,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:57:51,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:57:51,389 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:57:51,389 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:57:51,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label38.c [2024-11-06 18:57:52,627 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:57:53,046 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:57:53,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label38.c [2024-11-06 18:57:53,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ccbe1363/1c12039cd2bf4ddb90bb6842f1ee5053/FLAG984c6d154 [2024-11-06 18:57:53,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ccbe1363/1c12039cd2bf4ddb90bb6842f1ee5053 [2024-11-06 18:57:53,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:57:53,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:57:53,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:57:53,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:57:53,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:57:53,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:57:53" (1/1) ... [2024-11-06 18:57:53,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e374ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:53, skipping insertion in model container [2024-11-06 18:57:53,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:57:53" (1/1) ... [2024-11-06 18:57:53,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:57:53,571 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/Problem03_label38.c[61364,61377] [2024-11-06 18:57:53,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:57:53,612 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:57:53,786 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/Problem03_label38.c[61364,61377] [2024-11-06 18:57:53,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:57:53,819 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:57:53,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:53 WrapperNode [2024-11-06 18:57:53,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:57:53,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:57:53,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:57:53,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:57:53,828 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:57:53" (1/1) ... [2024-11-06 18:57:53,863 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:57:53" (1/1) ... [2024-11-06 18:57:53,942 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-11-06 18:57:53,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:57:53,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:57:53,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:57:53,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:57:53,952 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:53" (1/1) ... [2024-11-06 18:57:53,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:53" (1/1) ... [2024-11-06 18:57:53,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:53" (1/1) ... [2024-11-06 18:57:54,008 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:57:54,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:53" (1/1) ... [2024-11-06 18:57:54,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:53" (1/1) ... [2024-11-06 18:57:54,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:53" (1/1) ... [2024-11-06 18:57:54,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:53" (1/1) ... [2024-11-06 18:57:54,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:53" (1/1) ... [2024-11-06 18:57:54,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:53" (1/1) ... [2024-11-06 18:57:54,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:57:54,102 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:57:54,102 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:57:54,102 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:57:54,103 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:53" (1/1) ... [2024-11-06 18:57:54,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:57:54,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:57:54,133 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:57:54,136 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:57:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:57:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:57:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:57:54,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:57:54,238 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:57:54,239 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:57:56,032 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-06 18:57:56,032 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:57:56,053 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:57:56,056 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 18:57:56,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:57:56 BoogieIcfgContainer [2024-11-06 18:57:56,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:57:56,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:57:56,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:57:56,063 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:57:56,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:57:53" (1/3) ... [2024-11-06 18:57:56,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c08ff63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:57:56, skipping insertion in model container [2024-11-06 18:57:56,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:57:53" (2/3) ... [2024-11-06 18:57:56,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c08ff63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:57:56, skipping insertion in model container [2024-11-06 18:57:56,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:57:56" (3/3) ... [2024-11-06 18:57:56,065 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label38.c [2024-11-06 18:57:56,079 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:57:56,079 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:57:56,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:57:56,148 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;@12bba1f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:57:56,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:57:56,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 0 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:57:56,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-06 18:57:56,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:56,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:56,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:56,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:56,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1825602715, now seen corresponding path program 1 times [2024-11-06 18:57:56,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:56,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213474792] [2024-11-06 18:57:56,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:56,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:57,256 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:57:57,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:57,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213474792] [2024-11-06 18:57:57,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213474792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:57:57,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:57:57,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:57:57,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757762868] [2024-11-06 18:57:57,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:57:57,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:57:57,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:57,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:57:57,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:57,283 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 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 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 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:57:58,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:58,420 INFO L93 Difference]: Finished difference Result 857 states and 1498 transitions. [2024-11-06 18:57:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:57:58,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2024-11-06 18:57:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:58,433 INFO L225 Difference]: With dead ends: 857 [2024-11-06 18:57:58,433 INFO L226 Difference]: Without dead ends: 462 [2024-11-06 18:57:58,438 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:57:58,442 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 87 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:58,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 187 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 18:57:58,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-06 18:57:58,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2024-11-06 18:57:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.5381263616557734) internal successors, (706), 459 states have internal predecessors, (706), 0 states have call successors, (0), 0 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:57:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 706 transitions. [2024-11-06 18:57:58,510 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 706 transitions. Word has length 201 [2024-11-06 18:57:58,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:58,512 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 706 transitions. [2024-11-06 18:57:58,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 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:57:58,513 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 706 transitions. [2024-11-06 18:57:58,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-06 18:57:58,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:58,519 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:57:58,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 18:57:58,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:58,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:58,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2093481508, now seen corresponding path program 1 times [2024-11-06 18:57:58,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:58,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531629710] [2024-11-06 18:57:58,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:58,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:57:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:57:58,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:57:58,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531629710] [2024-11-06 18:57:58,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531629710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:57:58,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:57:58,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:57:58,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624300444] [2024-11-06 18:57:58,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:57:58,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:57:58,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:57:58,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:57:58,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:57:58,789 INFO L87 Difference]: Start difference. First operand 460 states and 706 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 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:57:59,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:57:59,657 INFO L93 Difference]: Finished difference Result 1344 states and 2079 transitions. [2024-11-06 18:57:59,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:57:59,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2024-11-06 18:57:59,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:57:59,661 INFO L225 Difference]: With dead ends: 1344 [2024-11-06 18:57:59,661 INFO L226 Difference]: Without dead ends: 886 [2024-11-06 18:57:59,663 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:57:59,664 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 18:57:59,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 92 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 18:57:59,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-06 18:57:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 870. [2024-11-06 18:57:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.5120828538550057) internal successors, (1314), 869 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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:57:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1314 transitions. [2024-11-06 18:57:59,714 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1314 transitions. Word has length 209 [2024-11-06 18:57:59,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:57:59,715 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1314 transitions. [2024-11-06 18:57:59,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 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:57:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1314 transitions. [2024-11-06 18:57:59,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-06 18:57:59,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:57:59,722 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:59,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 18:57:59,723 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:57:59,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:57:59,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2019535467, now seen corresponding path program 1 times [2024-11-06 18:57:59,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:57:59,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727613846] [2024-11-06 18:57:59,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:57:59,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:57:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:58:00,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:58:00,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727613846] [2024-11-06 18:58:00,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727613846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:58:00,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:58:00,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:58:00,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228611229] [2024-11-06 18:58:00,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:58:00,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:58:00,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:58:00,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:58:00,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:58:00,124 INFO L87 Difference]: Start difference. First operand 870 states and 1314 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 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:58:00,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:58:00,936 INFO L93 Difference]: Finished difference Result 2554 states and 3869 transitions. [2024-11-06 18:58:00,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:58:00,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 221 [2024-11-06 18:58:00,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:58:00,943 INFO L225 Difference]: With dead ends: 2554 [2024-11-06 18:58:00,944 INFO L226 Difference]: Without dead ends: 1686 [2024-11-06 18:58:00,945 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:58:00,946 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 232 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 18:58:00,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 417 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 18:58:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2024-11-06 18:58:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1684. [2024-11-06 18:58:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.3363042186571599) internal successors, (2249), 1683 states have internal predecessors, (2249), 0 states have call successors, (0), 0 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:58:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2249 transitions. [2024-11-06 18:58:00,985 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2249 transitions. Word has length 221 [2024-11-06 18:58:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:58:00,986 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2249 transitions. [2024-11-06 18:58:00,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 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:58:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2249 transitions. [2024-11-06 18:58:00,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-06 18:58:00,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:58:00,991 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:00,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 18:58:00,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:58:00,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:58:00,992 INFO L85 PathProgramCache]: Analyzing trace with hash 412048664, now seen corresponding path program 1 times [2024-11-06 18:58:00,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:58:00,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747383497] [2024-11-06 18:58:00,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:00,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:58:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:58:01,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:58:01,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747383497] [2024-11-06 18:58:01,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747383497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:58:01,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:58:01,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:58:01,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497579525] [2024-11-06 18:58:01,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:58:01,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:58:01,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:58:01,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:58:01,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:58:01,293 INFO L87 Difference]: Start difference. First operand 1684 states and 2249 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 2 states have internal predecessors, (224), 0 states have call successors, (0), 0 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:58:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:58:02,140 INFO L93 Difference]: Finished difference Result 5003 states and 6686 transitions. [2024-11-06 18:58:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:58:02,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 2 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2024-11-06 18:58:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:58:02,153 INFO L225 Difference]: With dead ends: 5003 [2024-11-06 18:58:02,153 INFO L226 Difference]: Without dead ends: 3321 [2024-11-06 18:58:02,155 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:58:02,156 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 239 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 18:58:02,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 173 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 18:58:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3321 states. [2024-11-06 18:58:02,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3321 to 3320. [2024-11-06 18:58:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 3319 states have (on average 1.284423018981621) internal successors, (4263), 3319 states have internal predecessors, (4263), 0 states have call successors, (0), 0 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:58:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4263 transitions. [2024-11-06 18:58:02,224 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4263 transitions. Word has length 224 [2024-11-06 18:58:02,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:58:02,224 INFO L471 AbstractCegarLoop]: Abstraction has 3320 states and 4263 transitions. [2024-11-06 18:58:02,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 2 states have internal predecessors, (224), 0 states have call successors, (0), 0 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:58:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4263 transitions. [2024-11-06 18:58:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-06 18:58:02,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:58:02,232 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:02,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 18:58:02,232 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:58:02,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:58:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash -960540435, now seen corresponding path program 1 times [2024-11-06 18:58:02,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:58:02,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098790273] [2024-11-06 18:58:02,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:02,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:58:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:02,602 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:58:02,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:58:02,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098790273] [2024-11-06 18:58:02,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098790273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:58:02,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:58:02,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:58:02,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928709642] [2024-11-06 18:58:02,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:58:02,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:58:02,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:58:02,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:58:02,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:58:02,604 INFO L87 Difference]: Start difference. First operand 3320 states and 4263 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 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:58:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:58:03,482 INFO L93 Difference]: Finished difference Result 9900 states and 12714 transitions. [2024-11-06 18:58:03,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:58:03,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 236 [2024-11-06 18:58:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:58:03,507 INFO L225 Difference]: With dead ends: 9900 [2024-11-06 18:58:03,507 INFO L226 Difference]: Without dead ends: 6582 [2024-11-06 18:58:03,513 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:58:03,515 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 202 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 18:58:03,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 418 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 18:58:03,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6582 states. [2024-11-06 18:58:03,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6582 to 6577. [2024-11-06 18:58:03,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6577 states, 6576 states have (on average 1.224300486618005) internal successors, (8051), 6576 states have internal predecessors, (8051), 0 states have call successors, (0), 0 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:58:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6577 states to 6577 states and 8051 transitions. [2024-11-06 18:58:03,674 INFO L78 Accepts]: Start accepts. Automaton has 6577 states and 8051 transitions. Word has length 236 [2024-11-06 18:58:03,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:58:03,675 INFO L471 AbstractCegarLoop]: Abstraction has 6577 states and 8051 transitions. [2024-11-06 18:58:03,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 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:58:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 6577 states and 8051 transitions. [2024-11-06 18:58:03,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-06 18:58:03,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:58:03,686 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:58:03,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 18:58:03,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:58:03,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:58:03,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2058320660, now seen corresponding path program 1 times [2024-11-06 18:58:03,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:58:03,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508039830] [2024-11-06 18:58:03,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:03,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:58:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:58:04,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:58:04,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508039830] [2024-11-06 18:58:04,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508039830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:58:04,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:58:04,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:58:04,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040462436] [2024-11-06 18:58:04,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:58:04,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:58:04,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:58:04,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:58:04,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:58:04,072 INFO L87 Difference]: Start difference. First operand 6577 states and 8051 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 2 states have internal predecessors, (242), 0 states have call successors, (0), 0 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:58:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:58:04,960 INFO L93 Difference]: Finished difference Result 16215 states and 19820 transitions. [2024-11-06 18:58:04,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:58:04,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 2 states have internal predecessors, (242), 0 states have call successors, (0), 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 242 [2024-11-06 18:58:04,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:58:04,997 INFO L225 Difference]: With dead ends: 16215 [2024-11-06 18:58:04,998 INFO L226 Difference]: Without dead ends: 9640 [2024-11-06 18:58:05,008 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:58:05,010 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 203 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 18:58:05,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 155 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 18:58:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9640 states. [2024-11-06 18:58:05,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9640 to 9638. [2024-11-06 18:58:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9638 states, 9637 states have (on average 1.2035903289405416) internal successors, (11599), 9637 states have internal predecessors, (11599), 0 states have call successors, (0), 0 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:58:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9638 states to 9638 states and 11599 transitions. [2024-11-06 18:58:05,224 INFO L78 Accepts]: Start accepts. Automaton has 9638 states and 11599 transitions. Word has length 242 [2024-11-06 18:58:05,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:58:05,224 INFO L471 AbstractCegarLoop]: Abstraction has 9638 states and 11599 transitions. [2024-11-06 18:58:05,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 2 states have internal predecessors, (242), 0 states have call successors, (0), 0 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:58:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 9638 states and 11599 transitions. [2024-11-06 18:58:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-06 18:58:05,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:58:05,242 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:05,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 18:58:05,242 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:58:05,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:58:05,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1774165289, now seen corresponding path program 1 times [2024-11-06 18:58:05,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:58:05,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603301529] [2024-11-06 18:58:05,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:05,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:58:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:58:05,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:58:05,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603301529] [2024-11-06 18:58:05,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603301529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:58:05,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26650764] [2024-11-06 18:58:05,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:05,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:58:05,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:58:05,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:58:05,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 18:58:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:05,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:58:05,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:58:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:58:06,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:58:06,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26650764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:58:06,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:58:06,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-06 18:58:06,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378443326] [2024-11-06 18:58:06,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:58:06,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:58:06,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:58:06,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:58:06,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:58:06,175 INFO L87 Difference]: Start difference. First operand 9638 states and 11599 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:58:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:58:07,082 INFO L93 Difference]: Finished difference Result 23353 states and 28430 transitions. [2024-11-06 18:58:07,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:58:07,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2024-11-06 18:58:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:58:07,130 INFO L225 Difference]: With dead ends: 23353 [2024-11-06 18:58:07,130 INFO L226 Difference]: Without dead ends: 13717 [2024-11-06 18:58:07,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:58:07,145 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 51 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 18:58:07,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 400 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 18:58:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13717 states. [2024-11-06 18:58:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13717 to 13708. [2024-11-06 18:58:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13708 states, 13707 states have (on average 1.2034726781936238) internal successors, (16496), 13707 states have internal predecessors, (16496), 0 states have call successors, (0), 0 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:58:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13708 states to 13708 states and 16496 transitions. [2024-11-06 18:58:07,391 INFO L78 Accepts]: Start accepts. Automaton has 13708 states and 16496 transitions. Word has length 249 [2024-11-06 18:58:07,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:58:07,391 INFO L471 AbstractCegarLoop]: Abstraction has 13708 states and 16496 transitions. [2024-11-06 18:58:07,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:58:07,392 INFO L276 IsEmpty]: Start isEmpty. Operand 13708 states and 16496 transitions. [2024-11-06 18:58:07,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-06 18:58:07,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:58:07,467 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:07,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 18:58:07,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:58:07,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:58:07,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:58:07,669 INFO L85 PathProgramCache]: Analyzing trace with hash -730829166, now seen corresponding path program 1 times [2024-11-06 18:58:07,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:58:07,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450004396] [2024-11-06 18:58:07,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:07,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:58:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:58:08,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:58:08,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450004396] [2024-11-06 18:58:08,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450004396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:58:08,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455740586] [2024-11-06 18:58:08,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:08,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:58:08,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:58:08,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:58:08,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 18:58:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:08,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:58:08,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:58:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:58:08,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:58:08,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455740586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:58:08,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:58:08,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-06 18:58:08,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354050546] [2024-11-06 18:58:08,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:58:08,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:58:08,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:58:08,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:58:08,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:58:08,479 INFO L87 Difference]: Start difference. First operand 13708 states and 16496 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 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:58:09,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:58:09,395 INFO L93 Difference]: Finished difference Result 32695 states and 39958 transitions. [2024-11-06 18:58:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:58:09,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 268 [2024-11-06 18:58:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:58:09,438 INFO L225 Difference]: With dead ends: 32695 [2024-11-06 18:58:09,439 INFO L226 Difference]: Without dead ends: 18989 [2024-11-06 18:58:09,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:58:09,457 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 224 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 18:58:09,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 171 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 18:58:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18989 states. [2024-11-06 18:58:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18989 to 18986. [2024-11-06 18:58:09,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18986 states, 18985 states have (on average 1.1756649986831709) internal successors, (22320), 18985 states have internal predecessors, (22320), 0 states have call successors, (0), 0 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:58:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18986 states to 18986 states and 22320 transitions. [2024-11-06 18:58:09,799 INFO L78 Accepts]: Start accepts. Automaton has 18986 states and 22320 transitions. Word has length 268 [2024-11-06 18:58:09,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:58:09,799 INFO L471 AbstractCegarLoop]: Abstraction has 18986 states and 22320 transitions. [2024-11-06 18:58:09,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 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:58:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 18986 states and 22320 transitions. [2024-11-06 18:58:09,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-06 18:58:09,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:58:09,833 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:09,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 18:58:10,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:58:10,037 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:58:10,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:58:10,038 INFO L85 PathProgramCache]: Analyzing trace with hash 195659315, now seen corresponding path program 1 times [2024-11-06 18:58:10,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:58:10,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54027216] [2024-11-06 18:58:10,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:10,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:58:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 18:58:10,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:58:10,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54027216] [2024-11-06 18:58:10,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54027216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:58:10,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399359754] [2024-11-06 18:58:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:10,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:58:10,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:58:10,519 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:58:10,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 18:58:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:10,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:58:10,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:58:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:58:10,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:58:10,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399359754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:58:10,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:58:10,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-06 18:58:10,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649287619] [2024-11-06 18:58:10,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:58:10,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:58:10,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:58:10,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:58:10,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:58:10,744 INFO L87 Difference]: Start difference. First operand 18986 states and 22320 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:58:11,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:58:11,511 INFO L93 Difference]: Finished difference Result 37973 states and 44643 transitions. [2024-11-06 18:58:11,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:58:11,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2024-11-06 18:58:11,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:58:11,551 INFO L225 Difference]: With dead ends: 37973 [2024-11-06 18:58:11,551 INFO L226 Difference]: Without dead ends: 18989 [2024-11-06 18:58:11,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:58:11,572 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 260 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:58:11,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 96 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:58:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18989 states. [2024-11-06 18:58:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18989 to 18986. [2024-11-06 18:58:11,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18986 states, 18985 states have (on average 1.1678166973926785) internal successors, (22171), 18985 states have internal predecessors, (22171), 0 states have call successors, (0), 0 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:58:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18986 states to 18986 states and 22171 transitions. [2024-11-06 18:58:11,885 INFO L78 Accepts]: Start accepts. Automaton has 18986 states and 22171 transitions. Word has length 269 [2024-11-06 18:58:11,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:58:11,885 INFO L471 AbstractCegarLoop]: Abstraction has 18986 states and 22171 transitions. [2024-11-06 18:58:11,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:58:11,886 INFO L276 IsEmpty]: Start isEmpty. Operand 18986 states and 22171 transitions. [2024-11-06 18:58:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-06 18:58:11,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:58:11,925 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:11,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 18:58:12,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:58:12,126 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:58:12,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:58:12,126 INFO L85 PathProgramCache]: Analyzing trace with hash -181423019, now seen corresponding path program 1 times [2024-11-06 18:58:12,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:58:12,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442840044] [2024-11-06 18:58:12,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:12,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:58:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:12,420 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-06 18:58:12,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:58:12,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442840044] [2024-11-06 18:58:12,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442840044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:58:12,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:58:12,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:58:12,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88254129] [2024-11-06 18:58:12,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:58:12,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:58:12,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:58:12,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:58:12,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:58:12,422 INFO L87 Difference]: Start difference. First operand 18986 states and 22171 transitions. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 0 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:58:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:58:13,273 INFO L93 Difference]: Finished difference Result 45920 states and 53946 transitions. [2024-11-06 18:58:13,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:58:13,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 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 283 [2024-11-06 18:58:13,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:58:13,338 INFO L225 Difference]: With dead ends: 45920 [2024-11-06 18:58:13,338 INFO L226 Difference]: Without dead ends: 26936 [2024-11-06 18:58:13,360 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:58:13,361 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 167 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 18:58:13,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 223 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 18:58:13,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26936 states. [2024-11-06 18:58:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26936 to 25285. [2024-11-06 18:58:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25285 states, 25284 states have (on average 1.1812608764436008) internal successors, (29867), 25284 states have internal predecessors, (29867), 0 states have call successors, (0), 0 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:58:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25285 states to 25285 states and 29867 transitions. [2024-11-06 18:58:13,751 INFO L78 Accepts]: Start accepts. Automaton has 25285 states and 29867 transitions. Word has length 283 [2024-11-06 18:58:13,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:58:13,752 INFO L471 AbstractCegarLoop]: Abstraction has 25285 states and 29867 transitions. [2024-11-06 18:58:13,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 0 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:58:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 25285 states and 29867 transitions. [2024-11-06 18:58:13,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-11-06 18:58:13,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:58:13,769 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:13,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 18:58:13,769 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:58:13,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:58:13,770 INFO L85 PathProgramCache]: Analyzing trace with hash 520076953, now seen corresponding path program 1 times [2024-11-06 18:58:13,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:58:13,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234870372] [2024-11-06 18:58:13,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:13,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:58:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:58:13,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:58:13,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234870372] [2024-11-06 18:58:13,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234870372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:58:13,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:58:13,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:58:13,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421800718] [2024-11-06 18:58:13,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:58:13,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:58:13,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:58:13,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:58:13,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:58:13,996 INFO L87 Difference]: Start difference. First operand 25285 states and 29867 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 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:58:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:58:14,662 INFO L93 Difference]: Finished difference Result 50165 states and 59288 transitions. [2024-11-06 18:58:14,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:58:14,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 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 288 [2024-11-06 18:58:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:58:14,695 INFO L225 Difference]: With dead ends: 50165 [2024-11-06 18:58:14,695 INFO L226 Difference]: Without dead ends: 24882 [2024-11-06 18:58:14,717 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:58:14,718 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 262 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:58:14,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 342 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:58:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24882 states. [2024-11-06 18:58:15,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24882 to 24676. [2024-11-06 18:58:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24676 states, 24675 states have (on average 1.1733333333333333) internal successors, (28952), 24675 states have internal predecessors, (28952), 0 states have call successors, (0), 0 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:58:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24676 states to 24676 states and 28952 transitions. [2024-11-06 18:58:15,106 INFO L78 Accepts]: Start accepts. Automaton has 24676 states and 28952 transitions. Word has length 288 [2024-11-06 18:58:15,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:58:15,107 INFO L471 AbstractCegarLoop]: Abstraction has 24676 states and 28952 transitions. [2024-11-06 18:58:15,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 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:58:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 24676 states and 28952 transitions. [2024-11-06 18:58:15,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-06 18:58:15,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:58:15,128 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:58:15,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 18:58:15,129 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:58:15,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:58:15,129 INFO L85 PathProgramCache]: Analyzing trace with hash -643575756, now seen corresponding path program 1 times [2024-11-06 18:58:15,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:58:15,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116507890] [2024-11-06 18:58:15,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:15,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:58:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-06 18:58:15,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:58:15,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116507890] [2024-11-06 18:58:15,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116507890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:58:15,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111706263] [2024-11-06 18:58:15,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:15,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:58:15,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:58:15,489 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:58:15,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 18:58:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:15,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:58:15,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:58:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-06 18:58:15,813 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:58:15,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111706263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:58:15,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:58:15,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-06 18:58:15,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119740696] [2024-11-06 18:58:15,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:58:15,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:58:15,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:58:15,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:58:15,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:58:15,815 INFO L87 Difference]: Start difference. First operand 24676 states and 28952 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 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:58:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:58:16,492 INFO L93 Difference]: Finished difference Result 48159 states and 56497 transitions. [2024-11-06 18:58:16,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:58:16,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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 295 [2024-11-06 18:58:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:58:16,515 INFO L225 Difference]: With dead ends: 48159 [2024-11-06 18:58:16,515 INFO L226 Difference]: Without dead ends: 23485 [2024-11-06 18:58:16,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:58:16,534 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 214 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:58:16,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 395 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:58:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23485 states. [2024-11-06 18:58:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23485 to 23458. [2024-11-06 18:58:16,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23458 states, 23457 states have (on average 1.165579571130153) internal successors, (27341), 23457 states have internal predecessors, (27341), 0 states have call successors, (0), 0 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:58:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23458 states to 23458 states and 27341 transitions. [2024-11-06 18:58:16,789 INFO L78 Accepts]: Start accepts. Automaton has 23458 states and 27341 transitions. Word has length 295 [2024-11-06 18:58:16,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:58:16,790 INFO L471 AbstractCegarLoop]: Abstraction has 23458 states and 27341 transitions. [2024-11-06 18:58:16,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 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:58:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 23458 states and 27341 transitions. [2024-11-06 18:58:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-11-06 18:58:16,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:58:16,811 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:16,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-06 18:58:17,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-06 18:58:17,012 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:58:17,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:58:17,012 INFO L85 PathProgramCache]: Analyzing trace with hash 301867287, now seen corresponding path program 1 times [2024-11-06 18:58:17,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:58:17,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712998340] [2024-11-06 18:58:17,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:17,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:58:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:58:17,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:58:17,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712998340] [2024-11-06 18:58:17,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712998340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:58:17,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:58:17,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:58:17,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399300522] [2024-11-06 18:58:17,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:58:17,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:58:17,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:58:17,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:58:17,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:58:17,201 INFO L87 Difference]: Start difference. First operand 23458 states and 27341 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 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:58:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:58:17,899 INFO L93 Difference]: Finished difference Result 45271 states and 52620 transitions. [2024-11-06 18:58:17,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:58:17,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 300 [2024-11-06 18:58:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:58:17,922 INFO L225 Difference]: With dead ends: 45271 [2024-11-06 18:58:17,922 INFO L226 Difference]: Without dead ends: 21815 [2024-11-06 18:58:17,937 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:58:17,938 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 266 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:58:17,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 371 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:58:17,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21815 states. [2024-11-06 18:58:18,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21815 to 21814. [2024-11-06 18:58:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21814 states, 21813 states have (on average 1.1297849906019346) internal successors, (24644), 21813 states have internal predecessors, (24644), 0 states have call successors, (0), 0 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:58:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21814 states to 21814 states and 24644 transitions. [2024-11-06 18:58:18,197 INFO L78 Accepts]: Start accepts. Automaton has 21814 states and 24644 transitions. Word has length 300 [2024-11-06 18:58:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:58:18,197 INFO L471 AbstractCegarLoop]: Abstraction has 21814 states and 24644 transitions. [2024-11-06 18:58:18,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 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:58:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 21814 states and 24644 transitions. [2024-11-06 18:58:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-11-06 18:58:18,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:58:18,224 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:18,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 18:58:18,224 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:58:18,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:58:18,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1146021023, now seen corresponding path program 1 times [2024-11-06 18:58:18,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:58:18,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916168458] [2024-11-06 18:58:18,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:18,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:58:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:58:18,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:58:18,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916168458] [2024-11-06 18:58:18,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916168458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:58:18,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:58:18,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:58:18,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164156772] [2024-11-06 18:58:18,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:58:18,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:58:18,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:58:18,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:58:18,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:58:18,430 INFO L87 Difference]: Start difference. First operand 21814 states and 24644 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 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:58:19,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:58:19,108 INFO L93 Difference]: Finished difference Result 43421 states and 49045 transitions. [2024-11-06 18:58:19,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:58:19,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 304 [2024-11-06 18:58:19,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:58:19,130 INFO L225 Difference]: With dead ends: 43421 [2024-11-06 18:58:19,131 INFO L226 Difference]: Without dead ends: 21609 [2024-11-06 18:58:19,144 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:58:19,145 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 254 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:58:19,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 368 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:58:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21609 states. [2024-11-06 18:58:19,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21609 to 18358. [2024-11-06 18:58:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18358 states, 18357 states have (on average 1.1111837446205808) internal successors, (20398), 18357 states have internal predecessors, (20398), 0 states have call successors, (0), 0 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:58:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18358 states to 18358 states and 20398 transitions. [2024-11-06 18:58:19,454 INFO L78 Accepts]: Start accepts. Automaton has 18358 states and 20398 transitions. Word has length 304 [2024-11-06 18:58:19,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:58:19,454 INFO L471 AbstractCegarLoop]: Abstraction has 18358 states and 20398 transitions. [2024-11-06 18:58:19,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 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:58:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 18358 states and 20398 transitions. [2024-11-06 18:58:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-11-06 18:58:19,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:58:19,466 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:19,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 18:58:19,466 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:58:19,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:58:19,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1313975761, now seen corresponding path program 1 times [2024-11-06 18:58:19,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:58:19,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256858045] [2024-11-06 18:58:19,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:19,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:58:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:19,612 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-06 18:58:19,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:58:19,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256858045] [2024-11-06 18:58:19,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256858045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:58:19,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:58:19,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:58:19,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975950425] [2024-11-06 18:58:19,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:58:19,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:58:19,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:58:19,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:58:19,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:58:19,614 INFO L87 Difference]: Start difference. First operand 18358 states and 20398 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 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:58:19,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:58:19,866 INFO L93 Difference]: Finished difference Result 52814 states and 58724 transitions. [2024-11-06 18:58:19,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:58:19,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 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 310 [2024-11-06 18:58:19,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:58:19,896 INFO L225 Difference]: With dead ends: 52814 [2024-11-06 18:58:19,896 INFO L226 Difference]: Without dead ends: 34458 [2024-11-06 18:58:19,911 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:58:19,911 INFO L432 NwaCegarLoop]: 682 mSDtfsCounter, 330 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:58:19,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 977 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:58:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34458 states. [2024-11-06 18:58:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34458 to 34455. [2024-11-06 18:58:20,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34455 states, 34454 states have (on average 1.10204910895687) internal successors, (37970), 34454 states have internal predecessors, (37970), 0 states have call successors, (0), 0 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:58:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34455 states to 34455 states and 37970 transitions. [2024-11-06 18:58:20,180 INFO L78 Accepts]: Start accepts. Automaton has 34455 states and 37970 transitions. Word has length 310 [2024-11-06 18:58:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:58:20,180 INFO L471 AbstractCegarLoop]: Abstraction has 34455 states and 37970 transitions. [2024-11-06 18:58:20,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 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:58:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 34455 states and 37970 transitions. [2024-11-06 18:58:20,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-06 18:58:20,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:58:20,201 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:20,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 18:58:20,201 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:58:20,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:58:20,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1000248581, now seen corresponding path program 1 times [2024-11-06 18:58:20,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:58:20,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524385767] [2024-11-06 18:58:20,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:20,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:58:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-06 18:58:20,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:58:20,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524385767] [2024-11-06 18:58:20,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524385767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:58:20,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:58:20,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:58:20,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491411763] [2024-11-06 18:58:20,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:58:20,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:58:20,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:58:20,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:58:20,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:58:20,464 INFO L87 Difference]: Start difference. First operand 34455 states and 37970 transitions. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:58:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:58:21,496 INFO L93 Difference]: Finished difference Result 74033 states and 81584 transitions. [2024-11-06 18:58:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:58:21,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 326 [2024-11-06 18:58:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:58:21,544 INFO L225 Difference]: With dead ends: 74033 [2024-11-06 18:58:21,544 INFO L226 Difference]: Without dead ends: 39580 [2024-11-06 18:58:21,566 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:58:21,567 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 358 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 18:58:21,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 172 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 18:58:21,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39580 states. [2024-11-06 18:58:21,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39580 to 37119. [2024-11-06 18:58:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37119 states, 37118 states have (on average 1.102834204429118) internal successors, (40935), 37118 states have internal predecessors, (40935), 0 states have call successors, (0), 0 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:58:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37119 states to 37119 states and 40935 transitions. [2024-11-06 18:58:21,855 INFO L78 Accepts]: Start accepts. Automaton has 37119 states and 40935 transitions. Word has length 326 [2024-11-06 18:58:21,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:58:21,856 INFO L471 AbstractCegarLoop]: Abstraction has 37119 states and 40935 transitions. [2024-11-06 18:58:21,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:58:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 37119 states and 40935 transitions. [2024-11-06 18:58:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-06 18:58:21,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:58:21,887 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:21,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 18:58:21,888 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:58:21,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:58:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash -902637589, now seen corresponding path program 1 times [2024-11-06 18:58:21,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:58:21,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894968942] [2024-11-06 18:58:21,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:21,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:58:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 146 proven. 6 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-06 18:58:22,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:58:22,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894968942] [2024-11-06 18:58:22,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894968942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:58:22,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300909363] [2024-11-06 18:58:22,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:22,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:58:22,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:58:22,202 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:58:22,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 18:58:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:22,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:58:22,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:58:22,457 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-11-06 18:58:22,457 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:58:22,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300909363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:58:22,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:58:22,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-06 18:58:22,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197874049] [2024-11-06 18:58:22,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:58:22,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:58:22,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:58:22,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:58:22,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:58:22,459 INFO L87 Difference]: Start difference. First operand 37119 states and 40935 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 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:58:23,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:58:23,021 INFO L93 Difference]: Finished difference Result 66639 states and 73491 transitions. [2024-11-06 18:58:23,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:58:23,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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 329 [2024-11-06 18:58:23,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:58:23,046 INFO L225 Difference]: With dead ends: 66639 [2024-11-06 18:58:23,047 INFO L226 Difference]: Without dead ends: 29522 [2024-11-06 18:58:23,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:58:23,057 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 308 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:58:23,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:58:23,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29522 states. [2024-11-06 18:58:23,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29522 to 29522. [2024-11-06 18:58:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29522 states, 29521 states have (on average 1.0948816097015683) internal successors, (32322), 29521 states have internal predecessors, (32322), 0 states have call successors, (0), 0 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:58:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29522 states to 29522 states and 32322 transitions. [2024-11-06 18:58:23,274 INFO L78 Accepts]: Start accepts. Automaton has 29522 states and 32322 transitions. Word has length 329 [2024-11-06 18:58:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:58:23,274 INFO L471 AbstractCegarLoop]: Abstraction has 29522 states and 32322 transitions. [2024-11-06 18:58:23,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 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:58:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 29522 states and 32322 transitions. [2024-11-06 18:58:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-11-06 18:58:23,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:58:23,292 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:58:23,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-06 18:58:23,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-06 18:58:23,492 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:58:23,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:58:23,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2101811160, now seen corresponding path program 1 times [2024-11-06 18:58:23,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:58:23,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188745344] [2024-11-06 18:58:23,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:23,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:58:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:23,739 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-06 18:58:23,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:58:23,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188745344] [2024-11-06 18:58:23,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188745344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:58:23,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:58:23,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:58:23,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314164890] [2024-11-06 18:58:23,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:58:23,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:58:23,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:58:23,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:58:23,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:58:23,741 INFO L87 Difference]: Start difference. First operand 29522 states and 32322 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:58:24,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:58:24,482 INFO L93 Difference]: Finished difference Result 65963 states and 72298 transitions. [2024-11-06 18:58:24,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:58:24,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 338 [2024-11-06 18:58:24,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:58:24,518 INFO L225 Difference]: With dead ends: 65963 [2024-11-06 18:58:24,518 INFO L226 Difference]: Without dead ends: 34007 [2024-11-06 18:58:24,540 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:58:24,541 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 186 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:58:24,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 355 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:58:24,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34007 states. [2024-11-06 18:58:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34007 to 31343. [2024-11-06 18:58:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31343 states, 31342 states have (on average 1.065375534426648) internal successors, (33391), 31342 states have internal predecessors, (33391), 0 states have call successors, (0), 0 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:58:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31343 states to 31343 states and 33391 transitions. [2024-11-06 18:58:24,967 INFO L78 Accepts]: Start accepts. Automaton has 31343 states and 33391 transitions. Word has length 338 [2024-11-06 18:58:24,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:58:24,968 INFO L471 AbstractCegarLoop]: Abstraction has 31343 states and 33391 transitions. [2024-11-06 18:58:24,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:58:24,968 INFO L276 IsEmpty]: Start isEmpty. Operand 31343 states and 33391 transitions. [2024-11-06 18:58:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2024-11-06 18:58:24,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:58:24,996 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:58:24,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 18:58:24,996 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:58:24,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:58:24,996 INFO L85 PathProgramCache]: Analyzing trace with hash -84122702, now seen corresponding path program 1 times [2024-11-06 18:58:24,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:58:24,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202509656] [2024-11-06 18:58:24,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:24,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:58:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 183 proven. 6 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-06 18:58:25,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:58:25,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202509656] [2024-11-06 18:58:25,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202509656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:58:25,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744627393] [2024-11-06 18:58:25,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:58:25,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:58:25,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:58:25,703 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:58:25,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-06 18:58:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:58:25,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:58:25,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:58:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-06 18:58:26,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:58:26,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744627393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:58:26,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:58:26,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-06 18:58:26,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93380371] [2024-11-06 18:58:26,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:58:26,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:58:26,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:58:26,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:58:26,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:58:26,053 INFO L87 Difference]: Start difference. First operand 31343 states and 33391 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 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:58:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:58:26,603 INFO L93 Difference]: Finished difference Result 64929 states and 69120 transitions. [2024-11-06 18:58:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:58:26,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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 376 [2024-11-06 18:58:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:58:26,605 INFO L225 Difference]: With dead ends: 64929 [2024-11-06 18:58:26,605 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 18:58:26,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:58:26,625 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 29 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:58:26,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 345 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:58:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 18:58:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 18:58:26,626 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:58:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 18:58:26,626 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 376 [2024-11-06 18:58:26,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:58:26,627 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 18:58:26,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 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:58:26,627 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 18:58:26,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 18:58:26,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:58:26,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-06 18:58:26,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:58:26,832 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:58:26,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 18:58:29,316 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:58:29,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:58:29 BoogieIcfgContainer [2024-11-06 18:58:29,345 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:58:29,345 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:58:29,345 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:58:29,345 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:58:29,346 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:57:56" (3/4) ... [2024-11-06 18:58:29,348 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 18:58:29,383 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 18:58:29,385 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 18:58:29,387 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 18:58:29,389 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 18:58:29,570 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 18:58:29,570 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 18:58:29,570 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:58:29,571 INFO L158 Benchmark]: Toolchain (without parser) took 36477.79ms. Allocated memory was 117.4MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 86.0MB in the beginning and 854.9MB in the end (delta: -768.9MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-06 18:58:29,571 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:58:29,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 725.49ms. Allocated memory is still 117.4MB. Free memory was 85.8MB in the beginning and 69.5MB in the end (delta: 16.4MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2024-11-06 18:58:29,572 INFO L158 Benchmark]: Boogie Procedure Inliner took 121.46ms. Allocated memory is still 117.4MB. Free memory was 69.5MB in the beginning and 55.0MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:58:29,572 INFO L158 Benchmark]: Boogie Preprocessor took 156.86ms. Allocated memory is still 117.4MB. Free memory was 55.0MB in the beginning and 43.4MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 18:58:29,572 INFO L158 Benchmark]: RCFGBuilder took 1955.33ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 43.4MB in the beginning and 98.3MB in the end (delta: -55.0MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2024-11-06 18:58:29,573 INFO L158 Benchmark]: TraceAbstraction took 33285.95ms. Allocated memory was 151.0MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 98.3MB in the beginning and 880.0MB in the end (delta: -781.7MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-06 18:58:29,574 INFO L158 Benchmark]: Witness Printer took 224.64ms. Allocated memory is still 2.1GB. Free memory was 880.0MB in the beginning and 854.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 18:58:29,575 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 80.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 725.49ms. Allocated memory is still 117.4MB. Free memory was 85.8MB in the beginning and 69.5MB in the end (delta: 16.4MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 121.46ms. Allocated memory is still 117.4MB. Free memory was 69.5MB in the beginning and 55.0MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 156.86ms. Allocated memory is still 117.4MB. Free memory was 55.0MB in the beginning and 43.4MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 1955.33ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 43.4MB in the beginning and 98.3MB in the end (delta: -55.0MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * TraceAbstraction took 33285.95ms. Allocated memory was 151.0MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 98.3MB in the beginning and 880.0MB in the end (delta: -781.7MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 224.64ms. Allocated memory is still 2.1GB. Free memory was 880.0MB in the beginning and 854.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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: 1648]: 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, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.7s, OverallIterations: 19, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4119 SdHoareTripleChecker+Valid, 12.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4119 mSDsluCounter, 5688 SdHoareTripleChecker+Invalid, 10.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 728 mSDsCounter, 2064 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11148 IncrementalHoareTripleChecker+Invalid, 13212 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2064 mSolverCounterUnsat, 4960 mSDtfsCounter, 11148 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1832 GetRequests, 1800 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37119occurred in iteration=16, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 10307 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 7054 NumberOfCodeBlocks, 7054 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 7029 ConstructedInterpolants, 0 QuantifiedInterpolants, 11628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3392 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 3310/3346 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: 1668]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((2 == a3) && (a5 == 1)) && (a26 <= 0)) && (a11 == 1)) && (a27 <= 0)) && (a6 <= 0)) || ((((((a5 == 1) && (a12 == 1)) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((2 == a3) && (a5 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a3 == 0))) || (((((2 == a3) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a27 <= 0))) || (((((2 == a3) && (a5 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || (((((a5 == 1) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0))) || ((((((a5 == 1) && (a26 <= 0)) && (a3 == 1)) && (a11 <= 0)) && (a27 <= 0)) && (a6 <= 0))) || (((((a5 == 1) && (a11 == 1)) && (a3 == 1)) && (a27 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (a26 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a3 == 0)) && (a27 <= 0))) || (((((a5 == 1) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || (((((((a26 == 1) && (2 == a3)) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a27 <= 0)) && (a6 <= 0))) || ((((((2 == a3) && (a5 == 1)) && (a26 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a27 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a27 <= 0)) && (a6 <= 0))) || (((((a5 == 1) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 0)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a26 == 1) && (2 == a3)) && (a5 == 1)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (a26 <= 0)) && (a11 <= 0)) && (a3 == 0)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (2 == a3)) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((a5 == 1) && (a11 == 1)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a3 == 0)) && (a27 <= 0))) || ((((((a26 == 1) && (2 == a3)) && (a5 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a3 == 0)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a3 == 0)) && (a27 <= 0))) || ((((((((a25 == 1) && (a5 == 1)) && (a12 == 1)) && (a26 <= 0)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a27 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a27 == 1))) || ((((((a5 == 1) && (a26 <= 0)) && (a3 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((2 == a3) && (a5 == 1)) && (a26 <= 0)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (2 == a3)) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a27 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-06 18:58:29,602 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