./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_24-multiple-protecting_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_24-multiple-protecting_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', '5a41a1715a056c3cefb9e5b0430ae444adde5aa2f4e6078578085bf381d921cf'] 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_24-multiple-protecting_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 5a41a1715a056c3cefb9e5b0430ae444adde5aa2f4e6078578085bf381d921cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:17:46,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:17:46,666 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:46,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:17:46,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:17:46,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:17:46,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:17:46,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:17:46,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:17:46,700 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:17:46,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:17:46,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:17:46,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:17:46,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:17:46,702 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:17:46,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:17:46,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:17:46,703 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:17:46,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:17:46,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:17:46,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:17:46,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:17:46,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:17:46,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:17:46,704 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:17:46,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:17:46,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:17:46,704 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:17:46,704 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:17:46,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:17:46,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:17:46,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:17:46,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:17:46,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:17:46,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:17:46,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:17:46,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:17:46,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:17:46,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:17:46,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:17:46,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:17:46,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:17:46,706 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 -> 5a41a1715a056c3cefb9e5b0430ae444adde5aa2f4e6078578085bf381d921cf [2024-11-07 11:17:46,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:17:47,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:17:47,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:17:47,006 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:17:47,007 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:17:47,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_24-multiple-protecting_true.i [2024-11-07 11:17:48,260 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:17:48,555 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:17:48,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_24-multiple-protecting_true.i [2024-11-07 11:17:48,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fdee9a60/8e6052843e4d47979847f76593263807/FLAGa8c37c319 [2024-11-07 11:17:48,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fdee9a60/8e6052843e4d47979847f76593263807 [2024-11-07 11:17:48,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:17:48,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:17:48,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:17:48,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:17:48,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:17:48,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:17:48" (1/1) ... [2024-11-07 11:17:48,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@721f688a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:48, skipping insertion in model container [2024-11-07 11:17:48,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:17:48" (1/1) ... [2024-11-07 11:17:48,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:17:49,037 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_24-multiple-protecting_true.i[1096,1109] [2024-11-07 11:17:49,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:17:49,230 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:17:49,239 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_24-multiple-protecting_true.i[1096,1109] [2024-11-07 11:17:49,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:17:49,326 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:17:49,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:49 WrapperNode [2024-11-07 11:17:49,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:17:49,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:17:49,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:17:49,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:17:49,335 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:49" (1/1) ... [2024-11-07 11:17:49,345 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:49" (1/1) ... [2024-11-07 11:17:49,366 INFO L138 Inliner]: procedures = 162, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 101 [2024-11-07 11:17:49,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:17:49,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:17:49,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:17:49,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:17:49,375 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:49" (1/1) ... [2024-11-07 11:17:49,375 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:49" (1/1) ... [2024-11-07 11:17:49,379 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:49" (1/1) ... [2024-11-07 11:17:49,390 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:49,390 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:49" (1/1) ... [2024-11-07 11:17:49,390 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:49" (1/1) ... [2024-11-07 11:17:49,395 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:49" (1/1) ... [2024-11-07 11:17:49,397 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:49" (1/1) ... [2024-11-07 11:17:49,399 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:49" (1/1) ... [2024-11-07 11:17:49,399 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:49" (1/1) ... [2024-11-07 11:17:49,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:17:49,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:17:49,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:17:49,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:17:49,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:49" (1/1) ... [2024-11-07 11:17:49,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:17:49,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:17:49,432 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:49,434 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:49,454 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 11:17:49,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:17:49,456 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-07 11:17:49,456 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-07 11:17:49,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 11:17:49,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 11:17:49,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 11:17:49,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 11:17:49,456 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 11:17:49,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:17:49,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:17:49,458 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:49,560 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:17:49,561 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:17:49,869 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 11:17:49,869 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:17:50,057 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:17:50,058 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 11:17:50,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:17:50 BoogieIcfgContainer [2024-11-07 11:17:50,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:17:50,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:17:50,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:17:50,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:17:50,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:17:48" (1/3) ... [2024-11-07 11:17:50,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432ce103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:17:50, skipping insertion in model container [2024-11-07 11:17:50,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:17:49" (2/3) ... [2024-11-07 11:17:50,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@432ce103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:17:50, skipping insertion in model container [2024-11-07 11:17:50,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:17:50" (3/3) ... [2024-11-07 11:17:50,068 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_24-multiple-protecting_true.i [2024-11-07 11:17:50,079 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:17:50,079 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 11:17:50,080 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 11:17:50,121 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-07 11:17:50,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 75 transitions, 157 flow [2024-11-07 11:17:50,191 INFO L124 PetriNetUnfolderBase]: 4/74 cut-off events. [2024-11-07 11:17:50,194 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 11:17:50,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 74 events. 4/74 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2024-11-07 11:17:50,197 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 75 transitions, 157 flow [2024-11-07 11:17:50,201 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 65 transitions, 133 flow [2024-11-07 11:17:50,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:17:50,221 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;@7f59ffb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:17:50,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-07 11:17:50,231 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 11:17:50,231 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2024-11-07 11:17:50,232 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:17:50,232 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:17:50,232 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:17:50,233 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-07 11:17:50,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:17:50,237 INFO L85 PathProgramCache]: Analyzing trace with hash -27149027, now seen corresponding path program 1 times [2024-11-07 11:17:50,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:17:50,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000488658] [2024-11-07 11:17:50,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:17:50,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:17:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:17:50,562 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:50,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:17:50,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000488658] [2024-11-07 11:17:50,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000488658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:17:50,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:17:50,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:17:50,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558982809] [2024-11-07 11:17:50,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:17:50,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:17:50,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:17:50,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:17:50,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:17:50,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2024-11-07 11:17:50,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:17:50,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:17:50,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2024-11-07 11:17:50,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:17:51,091 INFO L124 PetriNetUnfolderBase]: 443/1141 cut-off events. [2024-11-07 11:17:51,091 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 11:17:51,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2094 conditions, 1141 events. 443/1141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6260 event pairs, 116 based on Foata normal form. 66/1153 useless extension candidates. Maximal degree in co-relation 2085. Up to 670 conditions per place. [2024-11-07 11:17:51,105 INFO L140 encePairwiseOnDemand]: 58/75 looper letters, 69 selfloop transitions, 15 changer transitions 1/103 dead transitions. [2024-11-07 11:17:51,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 103 transitions, 379 flow [2024-11-07 11:17:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:17:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:17:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2024-11-07 11:17:51,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-07 11:17:51,125 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 133 flow. Second operand 5 states and 200 transitions. [2024-11-07 11:17:51,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 103 transitions, 379 flow [2024-11-07 11:17:51,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 103 transitions, 378 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 11:17:51,134 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 226 flow [2024-11-07 11:17:51,136 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2024-11-07 11:17:51,139 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 7 predicate places. [2024-11-07 11:17:51,140 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 226 flow [2024-11-07 11:17:51,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 11:17:51,141 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:17:51,141 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:17:51,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:17:51,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-07 11:17:51,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:17:51,143 INFO L85 PathProgramCache]: Analyzing trace with hash 310018753, now seen corresponding path program 1 times [2024-11-07 11:17:51,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:17:51,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904421751] [2024-11-07 11:17:51,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:17:51,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:17:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:17:51,448 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,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:17:51,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904421751] [2024-11-07 11:17:51,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904421751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:17:51,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:17:51,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:17:51,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19231263] [2024-11-07 11:17:51,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:17:51,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:17:51,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:17:51,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:17:51,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:17:51,453 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2024-11-07 11:17:51,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:17:51,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2024-11-07 11:17:51,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:17:51,696 INFO L124 PetriNetUnfolderBase]: 198/660 cut-off events. [2024-11-07 11:17:51,697 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-11-07 11:17:51,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 660 events. 198/660 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3532 event pairs, 24 based on Foata normal form. 21/678 useless extension candidates. Maximal degree in co-relation 1367. Up to 317 conditions per place. [2024-11-07 11:17:51,703 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 62 selfloop transitions, 6 changer transitions 0/96 dead transitions. [2024-11-07 11:17:51,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 96 transitions, 426 flow [2024-11-07 11:17:51,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:17:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:17:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2024-11-07 11:17:51,706 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6033333333333334 [2024-11-07 11:17:51,706 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 226 flow. Second operand 4 states and 181 transitions. [2024-11-07 11:17:51,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 96 transitions, 426 flow [2024-11-07 11:17:51,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 96 transitions, 409 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-07 11:17:51,718 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 231 flow [2024-11-07 11:17:51,718 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2024-11-07 11:17:51,719 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places. [2024-11-07 11:17:51,719 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 231 flow [2024-11-07 11:17:51,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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,720 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:17:51,720 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] [2024-11-07 11:17:51,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:17:51,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-07 11:17:51,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:17:51,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1055101271, now seen corresponding path program 1 times [2024-11-07 11:17:51,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:17:51,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106559362] [2024-11-07 11:17:51,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:17:51,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:17:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:17:51,955 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,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:17:51,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106559362] [2024-11-07 11:17:51,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106559362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:17:51,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:17:51,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:17:51,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020670494] [2024-11-07 11:17:51,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:17:51,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:17:51,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:17:51,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:17:51,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:17:51,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2024-11-07 11:17:51,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 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,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:17:51,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2024-11-07 11:17:51,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:17:52,199 INFO L124 PetriNetUnfolderBase]: 251/704 cut-off events. [2024-11-07 11:17:52,199 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-11-07 11:17:52,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1581 conditions, 704 events. 251/704 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3535 event pairs, 160 based on Foata normal form. 36/736 useless extension candidates. Maximal degree in co-relation 1565. Up to 434 conditions per place. [2024-11-07 11:17:52,203 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 48 selfloop transitions, 13 changer transitions 7/84 dead transitions. [2024-11-07 11:17:52,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 84 transitions, 397 flow [2024-11-07 11:17:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:17:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:17:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-11-07 11:17:52,207 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-11-07 11:17:52,207 INFO L175 Difference]: Start difference. First operand has 76 places, 72 transitions, 231 flow. Second operand 5 states and 165 transitions. [2024-11-07 11:17:52,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 84 transitions, 397 flow [2024-11-07 11:17:52,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 84 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:17:52,211 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 251 flow [2024-11-07 11:17:52,211 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2024-11-07 11:17:52,212 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places. [2024-11-07 11:17:52,212 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 251 flow [2024-11-07 11:17:52,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 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,213 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:17:52,213 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] [2024-11-07 11:17:52,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:17:52,213 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-07 11:17:52,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:17:52,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1075351425, now seen corresponding path program 1 times [2024-11-07 11:17:52,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:17:52,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603469922] [2024-11-07 11:17:52,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:17:52,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:17:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:17:52,332 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,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:17:52,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603469922] [2024-11-07 11:17:52,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603469922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:17:52,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:17:52,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 11:17:52,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001213448] [2024-11-07 11:17:52,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:17:52,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:17:52,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:17:52,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:17:52,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:17:52,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2024-11-07 11:17:52,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 251 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:17:52,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2024-11-07 11:17:52,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:17:52,543 INFO L124 PetriNetUnfolderBase]: 194/597 cut-off events. [2024-11-07 11:17:52,543 INFO L125 PetriNetUnfolderBase]: For 285/285 co-relation queries the response was YES. [2024-11-07 11:17:52,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 597 events. 194/597 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2876 event pairs, 76 based on Foata normal form. 11/604 useless extension candidates. Maximal degree in co-relation 1416. Up to 281 conditions per place. [2024-11-07 11:17:52,547 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 57 selfloop transitions, 17 changer transitions 1/91 dead transitions. [2024-11-07 11:17:52,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 91 transitions, 493 flow [2024-11-07 11:17:52,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 11:17:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-07 11:17:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2024-11-07 11:17:52,549 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-11-07 11:17:52,549 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 251 flow. Second operand 5 states and 175 transitions. [2024-11-07 11:17:52,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 91 transitions, 493 flow [2024-11-07 11:17:52,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 439 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-11-07 11:17:52,553 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 305 flow [2024-11-07 11:17:52,554 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=305, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2024-11-07 11:17:52,554 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 12 predicate places. [2024-11-07 11:17:52,554 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 305 flow [2024-11-07 11:17:52,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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,555 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:17:52,555 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, 1, 1, 1, 1, 1] [2024-11-07 11:17:52,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:17:52,555 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-07 11:17:52,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:17:52,556 INFO L85 PathProgramCache]: Analyzing trace with hash 607968746, now seen corresponding path program 1 times [2024-11-07 11:17:52,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:17:52,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723184542] [2024-11-07 11:17:52,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:17:52,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:17:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:17:52,779 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,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:17:52,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723184542] [2024-11-07 11:17:52,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723184542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:17:52,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:17:52,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:17:52,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991474987] [2024-11-07 11:17:52,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:17:52,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:17:52,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:17:52,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:17:52,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:17:52,780 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2024-11-07 11:17:52,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 305 flow. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:17:52,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2024-11-07 11:17:52,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:17:52,920 INFO L124 PetriNetUnfolderBase]: 89/373 cut-off events. [2024-11-07 11:17:52,921 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2024-11-07 11:17:52,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 373 events. 89/373 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1601 event pairs, 23 based on Foata normal form. 41/406 useless extension candidates. Maximal degree in co-relation 947. Up to 168 conditions per place. [2024-11-07 11:17:52,923 INFO L140 encePairwiseOnDemand]: 58/75 looper letters, 41 selfloop transitions, 17 changer transitions 3/86 dead transitions. [2024-11-07 11:17:52,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 86 transitions, 489 flow [2024-11-07 11:17:52,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:17:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:17:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2024-11-07 11:17:52,925 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2024-11-07 11:17:52,925 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 305 flow. Second operand 4 states and 176 transitions. [2024-11-07 11:17:52,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 86 transitions, 489 flow [2024-11-07 11:17:52,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 86 transitions, 481 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-07 11:17:52,934 INFO L231 Difference]: Finished difference. Result has 81 places, 73 transitions, 360 flow [2024-11-07 11:17:52,935 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=360, PETRI_PLACES=81, PETRI_TRANSITIONS=73} [2024-11-07 11:17:52,936 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2024-11-07 11:17:52,938 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 73 transitions, 360 flow [2024-11-07 11:17:52,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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,938 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:17:52,938 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, 1, 1, 1, 1, 1, 1] [2024-11-07 11:17:52,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:17:52,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-07 11:17:52,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:17:52,939 INFO L85 PathProgramCache]: Analyzing trace with hash 900113, now seen corresponding path program 1 times [2024-11-07 11:17:52,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:17:52,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244301579] [2024-11-07 11:17:52,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:17:52,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:17:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:17:53,335 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,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:17:53,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244301579] [2024-11-07 11:17:53,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244301579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:17:53,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:17:53,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:17:53,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235866495] [2024-11-07 11:17:53,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:17:53,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:17:53,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:17:53,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:17:53,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:17:53,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2024-11-07 11:17:53,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 73 transitions, 360 flow. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 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,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:17:53,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2024-11-07 11:17:53,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:17:53,469 INFO L124 PetriNetUnfolderBase]: 85/346 cut-off events. [2024-11-07 11:17:53,470 INFO L125 PetriNetUnfolderBase]: For 311/313 co-relation queries the response was YES. [2024-11-07 11:17:53,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 346 events. 85/346 cut-off events. For 311/313 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1457 event pairs, 38 based on Foata normal form. 4/346 useless extension candidates. Maximal degree in co-relation 987. Up to 233 conditions per place. [2024-11-07 11:17:53,473 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 43 selfloop transitions, 4 changer transitions 14/79 dead transitions. [2024-11-07 11:17:53,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 79 transitions, 497 flow [2024-11-07 11:17:53,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:17:53,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:17:53,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2024-11-07 11:17:53,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5433333333333333 [2024-11-07 11:17:53,476 INFO L175 Difference]: Start difference. First operand has 81 places, 73 transitions, 360 flow. Second operand 4 states and 163 transitions. [2024-11-07 11:17:53,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 79 transitions, 497 flow [2024-11-07 11:17:53,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 79 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 11:17:53,482 INFO L231 Difference]: Finished difference. Result has 79 places, 56 transitions, 261 flow [2024-11-07 11:17:53,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=79, PETRI_TRANSITIONS=56} [2024-11-07 11:17:53,483 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2024-11-07 11:17:53,484 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 56 transitions, 261 flow [2024-11-07 11:17:53,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 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,484 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:17:53,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:17:53,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:17:53,485 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-07 11:17:53,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:17:53,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1172280328, now seen corresponding path program 1 times [2024-11-07 11:17:53,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:17:53,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171080811] [2024-11-07 11:17:53,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:17:53,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:17:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:17:53,784 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,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:17:53,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171080811] [2024-11-07 11:17:53,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171080811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:17:53,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:17:53,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 11:17:53,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159257276] [2024-11-07 11:17:53,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:17:53,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 11:17:53,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:17:53,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 11:17:53,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 11:17:53,787 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2024-11-07 11:17:53,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 56 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 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-07 11:17:53,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:17:53,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2024-11-07 11:17:53,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:17:53,891 INFO L124 PetriNetUnfolderBase]: 60/244 cut-off events. [2024-11-07 11:17:53,892 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2024-11-07 11:17:53,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 244 events. 60/244 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 747 event pairs, 20 based on Foata normal form. 13/254 useless extension candidates. Maximal degree in co-relation 667. Up to 105 conditions per place. [2024-11-07 11:17:53,894 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 38 selfloop transitions, 6 changer transitions 2/63 dead transitions. [2024-11-07 11:17:53,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 63 transitions, 388 flow [2024-11-07 11:17:53,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:17:53,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-07 11:17:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2024-11-07 11:17:53,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5233333333333333 [2024-11-07 11:17:53,895 INFO L175 Difference]: Start difference. First operand has 79 places, 56 transitions, 261 flow. Second operand 4 states and 157 transitions. [2024-11-07 11:17:53,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 63 transitions, 388 flow [2024-11-07 11:17:53,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 331 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-11-07 11:17:53,897 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 211 flow [2024-11-07 11:17:53,898 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2024-11-07 11:17:53,899 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2024-11-07 11:17:53,899 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 211 flow [2024-11-07 11:17:53,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 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-07 11:17:53,900 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 11:17:53,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:17:53,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:17:53,900 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-07 11:17:53,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:17:53,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1966325509, now seen corresponding path program 1 times [2024-11-07 11:17:53,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:17:53,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745246740] [2024-11-07 11:17:53,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:17:53,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:17:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:17:54,072 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:54,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:17:54,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745246740] [2024-11-07 11:17:54,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745246740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:17:54,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:17:54,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:17:54,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573887952] [2024-11-07 11:17:54,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:17:54,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 11:17:54,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:17:54,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 11:17:54,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 11:17:54,085 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2024-11-07 11:17:54,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 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:54,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 11:17:54,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2024-11-07 11:17:54,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 11:17:54,206 INFO L124 PetriNetUnfolderBase]: 67/240 cut-off events. [2024-11-07 11:17:54,207 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2024-11-07 11:17:54,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 240 events. 67/240 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 710 event pairs, 46 based on Foata normal form. 4/240 useless extension candidates. Maximal degree in co-relation 633. Up to 156 conditions per place. [2024-11-07 11:17:54,208 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 0 selfloop transitions, 0 changer transitions 61/61 dead transitions. [2024-11-07 11:17:54,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 349 flow [2024-11-07 11:17:54,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:17:54,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 11:17:54,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2024-11-07 11:17:54,209 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38 [2024-11-07 11:17:54,209 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 211 flow. Second operand 6 states and 171 transitions. [2024-11-07 11:17:54,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 349 flow [2024-11-07 11:17:54,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 335 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-11-07 11:17:54,211 INFO L231 Difference]: Finished difference. Result has 66 places, 0 transitions, 0 flow [2024-11-07 11:17:54,211 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=66, PETRI_TRANSITIONS=0} [2024-11-07 11:17:54,211 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2024-11-07 11:17:54,212 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 0 transitions, 0 flow [2024-11-07 11:17:54,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 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:54,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-07 11:17:54,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-07 11:17:54,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-11-07 11:17:54,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-11-07 11:17:54,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-11-07 11:17:54,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 11:17:54,216 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 11:17:54,218 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 11:17:54,218 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 11:17:54,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:17:54 BasicIcfg [2024-11-07 11:17:54,230 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 11:17:54,230 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 11:17:54,230 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 11:17:54,230 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 11:17:54,231 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:50" (3/4) ... [2024-11-07 11:17:54,233 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 11:17:54,236 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2024-11-07 11:17:54,239 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2024-11-07 11:17:54,239 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-07 11:17:54,239 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 11:17:54,239 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 11:17:54,297 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 11:17:54,298 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 11:17:54,298 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 11:17:54,298 INFO L158 Benchmark]: Toolchain (without parser) took 5440.77ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 90.5MB in the beginning and 52.7MB in the end (delta: 37.8MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. [2024-11-07 11:17:54,299 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:17:54,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.55ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 70.1MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 11:17:54,299 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.68ms. Allocated memory is still 117.4MB. Free memory was 70.1MB in the beginning and 68.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 11:17:54,299 INFO L158 Benchmark]: Boogie Preprocessor took 33.48ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 66.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:17:54,299 INFO L158 Benchmark]: RCFGBuilder took 657.05ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 74.0MB in the end (delta: -7.4MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-11-07 11:17:54,300 INFO L158 Benchmark]: TraceAbstraction took 4168.36ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 73.5MB in the beginning and 57.5MB in the end (delta: 16.0MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2024-11-07 11:17:54,300 INFO L158 Benchmark]: Witness Printer took 67.52ms. Allocated memory is still 176.2MB. Free memory was 57.5MB in the beginning and 52.7MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 11:17:54,302 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.55ms. Allocated memory is still 117.4MB. Free memory was 90.3MB in the beginning and 70.1MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.68ms. Allocated memory is still 117.4MB. Free memory was 70.1MB in the beginning and 68.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.48ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 66.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 657.05ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 74.0MB in the end (delta: -7.4MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4168.36ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 73.5MB in the beginning and 57.5MB in the end (delta: 16.0MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. * Witness Printer took 67.52ms. Allocated memory is still 176.2MB. Free memory was 57.5MB in the beginning and 52.7MB in the end (delta: 4.9MB). 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 - 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, 99 locations, 5 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: 4.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 310 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 815 IncrementalHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 19 mSDtfsCounter, 815 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=360occurred in iteration=5, InterpolantAutomatonStates: 37, 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, 1.8s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 1337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-07 11:17:54,328 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