./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i --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/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i', '-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', 'a900e47bcb0579a731ecfed3c71b01054e5f0917c7f65049265d17494d326436'] 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/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i -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 a900e47bcb0579a731ecfed3c71b01054e5f0917c7f65049265d17494d326436 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:17:48,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:17:48,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 11:17:48,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:17:48,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:17:48,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:17:48,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:17:48,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:17:48,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:17:48,192 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:17:48,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:17:48,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:17:48,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:17:48,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:17:48,193 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:17:48,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:17:48,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:17:48,194 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:17:48,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:17:48,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:17:48,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:17:48,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:17:48,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:17:48,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:17:48,194 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:17:48,194 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:17:48,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:17:48,195 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:17:48,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:17:48,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:17:48,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:17:48,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:17:48,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:17:48,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:17:48,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:17:48,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:17:48,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:17:48,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:17:48,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:17:48,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:17:48,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:17:48,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:17:48,195 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 -> a900e47bcb0579a731ecfed3c71b01054e5f0917c7f65049265d17494d326436 [2024-11-07 11:17:48,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:17:48,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:17:48,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:17:48,436 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:17:48,436 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:17:48,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2024-11-07 11:17:49,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:17:49,783 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:17:49,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2024-11-07 11:17:49,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9c44b74d/1043dacc61804942ac977d3eb3aa4135/FLAG167b2c8c4 [2024-11-07 11:17:50,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e9c44b74d/1043dacc61804942ac977d3eb3aa4135 [2024-11-07 11:17:50,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:17:50,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:17:50,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:17:50,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:17:50,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:17:50,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:17:50" (1/1) ... [2024-11-07 11:17:50,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@728351d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:50, skipping insertion in model container [2024-11-07 11:17:50,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:17:50" (1/1) ... [2024-11-07 11:17:50,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:17:50,278 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/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i[1103,1116] [2024-11-07 11:17:50,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:17:50,387 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:17:50,395 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/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i[1103,1116] [2024-11-07 11:17:50,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:17:50,451 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:17:50,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:50 WrapperNode [2024-11-07 11:17:50,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:17:50,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:17:50,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:17:50,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:17:50,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:50" (1/1) ... [2024-11-07 11:17:50,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:50" (1/1) ... [2024-11-07 11:17:50,483 INFO L138 Inliner]: procedures = 162, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 82 [2024-11-07 11:17:50,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:17:50,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:17:50,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:17:50,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:17:50,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:50" (1/1) ... [2024-11-07 11:17:50,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:50" (1/1) ... [2024-11-07 11:17:50,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:50" (1/1) ... [2024-11-07 11:17:50,513 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-11-07 11:17:50,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:50" (1/1) ... [2024-11-07 11:17:50,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:50" (1/1) ... [2024-11-07 11:17:50,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:50" (1/1) ... [2024-11-07 11:17:50,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:50" (1/1) ... [2024-11-07 11:17:50,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:50" (1/1) ... [2024-11-07 11:17:50,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:50" (1/1) ... [2024-11-07 11:17:50,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:17:50,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:17:50,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:17:50,530 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:17:50,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:50" (1/1) ... [2024-11-07 11:17:50,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:17:50,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:17:50,556 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-07 11:17:50,558 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-07 11:17:50,578 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2024-11-07 11:17:50,578 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2024-11-07 11:17:50,579 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 11:17:50,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:17:50,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 11:17:50,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 11:17:50,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 11:17:50,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 11:17:50,580 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 11:17:50,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:17:50,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:17:50,584 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 11:17:50,684 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:17:50,686 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:17:50,897 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 11:17:50,897 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:17:51,017 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:17:51,017 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 11:17:51,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:17:51 BoogieIcfgContainer [2024-11-07 11:17:51,018 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:17:51,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:17:51,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:17:51,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:17:51,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:17:50" (1/3) ... [2024-11-07 11:17:51,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666aa749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:17:51, skipping insertion in model container [2024-11-07 11:17:51,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:50" (2/3) ... [2024-11-07 11:17:51,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666aa749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:17:51, skipping insertion in model container [2024-11-07 11:17:51,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:17:51" (3/3) ... [2024-11-07 11:17:51,027 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_29-multiple-protecting2-vesal_true.i [2024-11-07 11:17:51,038 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:17:51,038 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-07 11:17:51,039 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 11:17:51,075 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-07 11:17:51,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 50 transitions, 107 flow [2024-11-07 11:17:51,127 INFO L124 PetriNetUnfolderBase]: 3/49 cut-off events. [2024-11-07 11:17:51,129 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 11:17:51,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 49 events. 3/49 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-11-07 11:17:51,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 50 transitions, 107 flow [2024-11-07 11:17:51,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 38 transitions, 79 flow [2024-11-07 11:17:51,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:17:51,161 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;@6d71f793, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:17:51,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 11:17:51,170 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 11:17:51,171 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2024-11-07 11:17:51,171 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:17:51,171 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:17:51,172 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:17:51,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 11:17:51,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:17:51,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1639432612, now seen corresponding path program 1 times [2024-11-07 11:17:51,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:17:51,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328263388] [2024-11-07 11:17:51,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:17:51,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:17:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:17:51,483 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-07 11:17:51,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:17:51,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328263388] [2024-11-07 11:17:51,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328263388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:17:51,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:17:51,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:17:51,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268281857] [2024-11-07 11:17:51,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:17:51,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:17:51,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:17:51,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:17:51,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:17:51,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-11-07 11:17:51,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-07 11:17:51,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:17:51,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-11-07 11:17:51,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:17:51,696 INFO L124 PetriNetUnfolderBase]: 132/344 cut-off events. [2024-11-07 11:17:51,697 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:17:51,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 344 events. 132/344 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1533 event pairs, 61 based on Foata normal form. 14/342 useless extension candidates. Maximal degree in co-relation 631. Up to 128 conditions per place. [2024-11-07 11:17:51,702 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 39 selfloop transitions, 11 changer transitions 0/60 dead transitions. [2024-11-07 11:17:51,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 223 flow [2024-11-07 11:17:51,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:17:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:17:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-11-07 11:17:51,715 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-07 11:17:51,716 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 79 flow. Second operand 5 states and 125 transitions. [2024-11-07 11:17:51,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 223 flow [2024-11-07 11:17:51,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 11:17:51,724 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 138 flow [2024-11-07 11:17:51,725 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-11-07 11:17:51,729 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2024-11-07 11:17:51,730 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 138 flow [2024-11-07 11:17:51,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-07 11:17:51,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:17:51,730 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:17:51,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:17:51,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 11:17:51,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:17:51,731 INFO L85 PathProgramCache]: Analyzing trace with hash 758333671, now seen corresponding path program 1 times [2024-11-07 11:17:51,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:17:51,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776854823] [2024-11-07 11:17:51,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:17:51,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:17:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:17:51,838 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-07 11:17:51,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:17:51,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776854823] [2024-11-07 11:17:51,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776854823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:17:51,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:17:51,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:17:51,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620140373] [2024-11-07 11:17:51,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:17:51,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:17:51,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:17:51,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:17:51,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:17:51,850 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-11-07 11:17:51,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 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-07 11:17:51,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:17:51,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-11-07 11:17:51,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:17:51,991 INFO L124 PetriNetUnfolderBase]: 135/347 cut-off events. [2024-11-07 11:17:51,991 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-11-07 11:17:51,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 347 events. 135/347 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1573 event pairs, 34 based on Foata normal form. 10/355 useless extension candidates. Maximal degree in co-relation 789. Up to 184 conditions per place. [2024-11-07 11:17:51,995 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 44 selfloop transitions, 13 changer transitions 0/67 dead transitions. [2024-11-07 11:17:51,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 336 flow [2024-11-07 11:17:51,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:17:51,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:17:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-11-07 11:17:51,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.484 [2024-11-07 11:17:51,998 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 138 flow. Second operand 5 states and 121 transitions. [2024-11-07 11:17:51,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 336 flow [2024-11-07 11:17:52,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 336 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 11:17:52,001 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 226 flow [2024-11-07 11:17:52,001 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2024-11-07 11:17:52,006 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2024-11-07 11:17:52,006 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 226 flow [2024-11-07 11:17:52,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 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-07 11:17:52,007 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:17:52,007 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:17:52,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:17:52,007 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 11:17:52,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:17:52,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1363142688, now seen corresponding path program 1 times [2024-11-07 11:17:52,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:17:52,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871124759] [2024-11-07 11:17:52,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:17:52,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:17:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:17:52,094 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-07 11:17:52,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:17:52,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871124759] [2024-11-07 11:17:52,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871124759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:17:52,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:17:52,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:17:52,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764142641] [2024-11-07 11:17:52,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:17:52,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:17:52,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:17:52,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:17:52,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:17:52,102 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-11-07 11:17:52,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-07 11:17:52,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:17:52,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-11-07 11:17:52,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:17:52,220 INFO L124 PetriNetUnfolderBase]: 131/348 cut-off events. [2024-11-07 11:17:52,220 INFO L125 PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES. [2024-11-07 11:17:52,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 348 events. 131/348 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1516 event pairs, 36 based on Foata normal form. 17/363 useless extension candidates. Maximal degree in co-relation 915. Up to 154 conditions per place. [2024-11-07 11:17:52,224 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 46 selfloop transitions, 10 changer transitions 1/66 dead transitions. [2024-11-07 11:17:52,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 399 flow [2024-11-07 11:17:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:17:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 11:17:52,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-11-07 11:17:52,225 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44666666666666666 [2024-11-07 11:17:52,225 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 226 flow. Second operand 6 states and 134 transitions. [2024-11-07 11:17:52,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 399 flow [2024-11-07 11:17:52,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 394 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-07 11:17:52,231 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 281 flow [2024-11-07 11:17:52,231 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=281, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2024-11-07 11:17:52,232 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2024-11-07 11:17:52,232 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 281 flow [2024-11-07 11:17:52,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-07 11:17:52,232 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:17:52,232 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:17:52,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:17:52,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 11:17:52,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:17:52,232 INFO L85 PathProgramCache]: Analyzing trace with hash -794936313, now seen corresponding path program 1 times [2024-11-07 11:17:52,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:17:52,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8735169] [2024-11-07 11:17:52,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:17:52,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:17:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:17:52,331 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-07 11:17:52,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:17:52,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8735169] [2024-11-07 11:17:52,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8735169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:17:52,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:17:52,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:17:52,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320122224] [2024-11-07 11:17:52,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:17:52,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:17:52,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:17:52,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:17:52,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:17:52,340 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-11-07 11:17:52,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 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-07 11:17:52,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:17:52,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-11-07 11:17:52,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:17:52,452 INFO L124 PetriNetUnfolderBase]: 126/320 cut-off events. [2024-11-07 11:17:52,453 INFO L125 PetriNetUnfolderBase]: For 585/585 co-relation queries the response was YES. [2024-11-07 11:17:52,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 320 events. 126/320 cut-off events. For 585/585 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1349 event pairs, 18 based on Foata normal form. 4/322 useless extension candidates. Maximal degree in co-relation 951. Up to 84 conditions per place. [2024-11-07 11:17:52,455 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 47 selfloop transitions, 17 changer transitions 0/72 dead transitions. [2024-11-07 11:17:52,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 485 flow [2024-11-07 11:17:52,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 11:17:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 11:17:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2024-11-07 11:17:52,456 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43 [2024-11-07 11:17:52,456 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 281 flow. Second operand 8 states and 172 transitions. [2024-11-07 11:17:52,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 485 flow [2024-11-07 11:17:52,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 449 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-11-07 11:17:52,460 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 283 flow [2024-11-07 11:17:52,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=283, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-11-07 11:17:52,460 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2024-11-07 11:17:52,461 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 283 flow [2024-11-07 11:17:52,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 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-07 11:17:52,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:17:52,461 INFO L204 CegarLoopForPetriNet]: 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] [2024-11-07 11:17:52,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:17:52,461 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 11:17:52,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:17:52,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1680805028, now seen corresponding path program 1 times [2024-11-07 11:17:52,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:17:52,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567690970] [2024-11-07 11:17:52,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:17:52,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:17:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:17:52,580 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-07 11:17:52,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:17:52,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567690970] [2024-11-07 11:17:52,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567690970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:17:52,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:17:52,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:17:52,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976917365] [2024-11-07 11:17:52,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:17:52,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:17:52,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:17:52,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:17:52,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:17:52,582 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2024-11-07 11:17:52,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 283 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-07 11:17:52,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:17:52,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2024-11-07 11:17:52,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:17:52,645 INFO L124 PetriNetUnfolderBase]: 53/187 cut-off events. [2024-11-07 11:17:52,646 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2024-11-07 11:17:52,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 187 events. 53/187 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 676 event pairs, 16 based on Foata normal form. 19/202 useless extension candidates. Maximal degree in co-relation 517. Up to 77 conditions per place. [2024-11-07 11:17:52,647 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 29 selfloop transitions, 9 changer transitions 0/53 dead transitions. [2024-11-07 11:17:52,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 359 flow [2024-11-07 11:17:52,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:17:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:17:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-11-07 11:17:52,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.58 [2024-11-07 11:17:52,647 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 283 flow. Second operand 4 states and 116 transitions. [2024-11-07 11:17:52,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 359 flow [2024-11-07 11:17:52,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 306 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-11-07 11:17:52,650 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 224 flow [2024-11-07 11:17:52,650 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2024-11-07 11:17:52,650 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2024-11-07 11:17:52,650 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 224 flow [2024-11-07 11:17:52,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-07 11:17:52,650 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:17:52,651 INFO L204 CegarLoopForPetriNet]: 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] [2024-11-07 11:17:52,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:17:52,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 11:17:52,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:17:52,651 INFO L85 PathProgramCache]: Analyzing trace with hash -834053480, now seen corresponding path program 1 times [2024-11-07 11:17:52,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:17:52,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042835602] [2024-11-07 11:17:52,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:17:52,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:17:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:17:52,814 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-07 11:17:52,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:17:52,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042835602] [2024-11-07 11:17:52,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042835602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:17:52,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:17:52,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:17:52,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358139458] [2024-11-07 11:17:52,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:17:52,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:17:52,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:17:52,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:17:52,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:17:52,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2024-11-07 11:17:52,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 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-07 11:17:52,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:17:52,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2024-11-07 11:17:52,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:17:52,885 INFO L124 PetriNetUnfolderBase]: 42/160 cut-off events. [2024-11-07 11:17:52,885 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2024-11-07 11:17:52,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 160 events. 42/160 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 504 event pairs, 8 based on Foata normal form. 9/168 useless extension candidates. Maximal degree in co-relation 453. Up to 72 conditions per place. [2024-11-07 11:17:52,886 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 35 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2024-11-07 11:17:52,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 362 flow [2024-11-07 11:17:52,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:17:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:17:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-11-07 11:17:52,887 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.555 [2024-11-07 11:17:52,887 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 224 flow. Second operand 4 states and 111 transitions. [2024-11-07 11:17:52,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 362 flow [2024-11-07 11:17:52,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 359 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-07 11:17:52,889 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 231 flow [2024-11-07 11:17:52,890 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2024-11-07 11:17:52,890 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2024-11-07 11:17:52,890 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 231 flow [2024-11-07 11:17:52,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 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-07 11:17:52,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:17:52,891 INFO L204 CegarLoopForPetriNet]: 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] [2024-11-07 11:17:52,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:17:52,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-07 11:17:52,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:17:52,891 INFO L85 PathProgramCache]: Analyzing trace with hash 127158303, now seen corresponding path program 1 times [2024-11-07 11:17:52,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:17:52,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731764032] [2024-11-07 11:17:52,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:17:52,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:17:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:17:53,009 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-07 11:17:53,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:17:53,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731764032] [2024-11-07 11:17:53,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731764032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:17:53,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:17:53,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:17:53,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673958060] [2024-11-07 11:17:53,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:17:53,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:17:53,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:17:53,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:17:53,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:17:53,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2024-11-07 11:17:53,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:17:53,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:17:53,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2024-11-07 11:17:53,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:17:53,099 INFO L124 PetriNetUnfolderBase]: 50/164 cut-off events. [2024-11-07 11:17:53,100 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2024-11-07 11:17:53,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 164 events. 50/164 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 526 event pairs, 21 based on Foata normal form. 2/164 useless extension candidates. Maximal degree in co-relation 526. Up to 75 conditions per place. [2024-11-07 11:17:53,102 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 0 selfloop transitions, 0 changer transitions 49/49 dead transitions. [2024-11-07 11:17:53,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 338 flow [2024-11-07 11:17:53,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:17:53,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 11:17:53,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-11-07 11:17:53,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-11-07 11:17:53,104 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 231 flow. Second operand 6 states and 120 transitions. [2024-11-07 11:17:53,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 338 flow [2024-11-07 11:17:53,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 49 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:17:53,106 INFO L231 Difference]: Finished difference. Result has 58 places, 0 transitions, 0 flow [2024-11-07 11:17:53,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=58, PETRI_TRANSITIONS=0} [2024-11-07 11:17:53,106 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2024-11-07 11:17:53,107 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 0 transitions, 0 flow [2024-11-07 11:17:53,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:17:53,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-11-07 11:17:53,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-11-07 11:17:53,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-11-07 11:17:53,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-07 11:17:53,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:17:53,110 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:17:53,113 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 11:17:53,113 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 11:17:53,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:17:53 BasicIcfg [2024-11-07 11:17:53,119 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 11:17:53,119 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 11:17:53,119 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 11:17:53,119 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 11:17:53,120 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:17:51" (3/4) ... [2024-11-07 11:17:53,121 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 11:17:53,124 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t2_fun [2024-11-07 11:17:53,126 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2024-11-07 11:17:53,126 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-07 11:17:53,126 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 11:17:53,126 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 11:17:53,172 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 11:17:53,172 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 11:17:53,172 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 11:17:53,173 INFO L158 Benchmark]: Toolchain (without parser) took 3028.86ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 74.8MB in the beginning and 71.1MB in the end (delta: 3.7MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2024-11-07 11:17:53,173 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory was 48.1MB in the beginning and 48.0MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:17:53,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.64ms. Allocated memory is still 100.7MB. Free memory was 74.7MB in the beginning and 54.8MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 11:17:53,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.72ms. Allocated memory is still 100.7MB. Free memory was 54.8MB in the beginning and 53.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 11:17:53,174 INFO L158 Benchmark]: Boogie Preprocessor took 43.64ms. Allocated memory is still 100.7MB. Free memory was 53.0MB in the beginning and 51.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:17:53,174 INFO L158 Benchmark]: RCFGBuilder took 488.93ms. Allocated memory is still 100.7MB. Free memory was 51.4MB in the beginning and 57.4MB in the end (delta: -6.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-07 11:17:53,175 INFO L158 Benchmark]: TraceAbstraction took 2097.73ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 56.9MB in the beginning and 75.2MB in the end (delta: -18.2MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2024-11-07 11:17:53,175 INFO L158 Benchmark]: Witness Printer took 53.39ms. Allocated memory is still 125.8MB. Free memory was 75.2MB in the beginning and 71.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:17:53,176 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.16ms. Allocated memory is still 83.9MB. Free memory was 48.1MB in the beginning and 48.0MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.64ms. Allocated memory is still 100.7MB. Free memory was 74.7MB in the beginning and 54.8MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.72ms. Allocated memory is still 100.7MB. Free memory was 54.8MB in the beginning and 53.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.64ms. Allocated memory is still 100.7MB. Free memory was 53.0MB in the beginning and 51.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 488.93ms. Allocated memory is still 100.7MB. Free memory was 51.4MB in the beginning and 57.4MB in the end (delta: -6.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2097.73ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 56.9MB in the beginning and 75.2MB in the end (delta: -18.2MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Witness Printer took 53.39ms. Allocated memory is still 125.8MB. Free memory was 75.2MB in the beginning and 71.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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 with 1 thread instances CFG has 3 procedures, 63 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 591 IncrementalHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 21 mSDtfsCounter, 591 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=4, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-07 11:17:53,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE