./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi010.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi010.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --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 582aea72bf150e6792f444cf029a22a25cb033a365b198fc215f246088fb4d39 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 19:52:36,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:52:36,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:52:36,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:52:36,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:52:36,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:52:36,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:52:36,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:52:36,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:52:36,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:52:36,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:52:36,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:52:36,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:52:36,680 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:52:36,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:52:36,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:52:36,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:52:36,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:52:36,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:52:36,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:52:36,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:52:36,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:52:36,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:52:36,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:52:36,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:52:36,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:52:36,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:52:36,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:52:36,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:52:36,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:52:36,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:52:36,731 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:52:36,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:52:36,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:52:36,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:52:36,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:52:36,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:52:36,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:52:36,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:52:36,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:52:36,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:52:36,744 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 19:52:36,795 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:52:36,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:52:36,796 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:52:36,797 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:52:36,798 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:52:36,798 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:52:36,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:52:36,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:52:36,799 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:52:36,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:52:36,801 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:52:36,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:52:36,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:52:36,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:52:36,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:52:36,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:52:36,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:52:36,803 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:52:36,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:52:36,804 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:52:36,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:52:36,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:52:36,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:52:36,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:52:36,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:52:36,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:52:36,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:52:36,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:52:36,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:52:36,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:52:36,808 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:52:36,809 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:52:36,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:52:36,809 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 582aea72bf150e6792f444cf029a22a25cb033a365b198fc215f246088fb4d39 [2022-11-18 19:52:37,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:52:37,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:52:37,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:52:37,266 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:52:37,268 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:52:37,270 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/rfi010.i [2022-11-18 19:52:37,359 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro/data/7a6ecde73/39e4ac84e9f74342973ba308102939f4/FLAG00ce92998 [2022-11-18 19:52:38,087 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:52:38,088 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/sv-benchmarks/c/pthread-wmm/rfi010.i [2022-11-18 19:52:38,128 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro/data/7a6ecde73/39e4ac84e9f74342973ba308102939f4/FLAG00ce92998 [2022-11-18 19:52:38,343 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro/data/7a6ecde73/39e4ac84e9f74342973ba308102939f4 [2022-11-18 19:52:38,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:52:38,352 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:52:38,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:52:38,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:52:38,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:52:38,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:52:38" (1/1) ... [2022-11-18 19:52:38,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57103e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:52:38, skipping insertion in model container [2022-11-18 19:52:38,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:52:38" (1/1) ... [2022-11-18 19:52:38,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:52:38,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:52:38,711 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/sv-benchmarks/c/pthread-wmm/rfi010.i[983,996] [2022-11-18 19:52:39,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:52:39,066 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:52:39,094 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/sv-benchmarks/c/pthread-wmm/rfi010.i[983,996] [2022-11-18 19:52:39,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:52:39,210 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:52:39,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:52:39 WrapperNode [2022-11-18 19:52:39,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:52:39,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:52:39,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:52:39,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:52:39,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:52:39" (1/1) ... [2022-11-18 19:52:39,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:52:39" (1/1) ... [2022-11-18 19:52:39,311 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-11-18 19:52:39,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:52:39,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:52:39,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:52:39,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:52:39,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:52:39" (1/1) ... [2022-11-18 19:52:39,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:52:39" (1/1) ... [2022-11-18 19:52:39,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:52:39" (1/1) ... [2022-11-18 19:52:39,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:52:39" (1/1) ... [2022-11-18 19:52:39,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:52:39" (1/1) ... [2022-11-18 19:52:39,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:52:39" (1/1) ... [2022-11-18 19:52:39,376 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:52:39" (1/1) ... [2022-11-18 19:52:39,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:52:39" (1/1) ... [2022-11-18 19:52:39,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:52:39,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:52:39,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:52:39,396 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:52:39,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:52:39" (1/1) ... [2022-11-18 19:52:39,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:52:39,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:52:39,441 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:52:39,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:52:39,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:52:39,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 19:52:39,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:52:39,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:52:39,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:52:39,506 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 19:52:39,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 19:52:39,506 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 19:52:39,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 19:52:39,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:52:39,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 19:52:39,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:52:39,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:52:39,510 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 19:52:39,742 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:52:39,744 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:52:40,254 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:52:40,517 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:52:40,518 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 19:52:40,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:52:40 BoogieIcfgContainer [2022-11-18 19:52:40,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:52:40,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:52:40,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:52:40,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:52:40,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:52:38" (1/3) ... [2022-11-18 19:52:40,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b76395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:52:40, skipping insertion in model container [2022-11-18 19:52:40,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:52:39" (2/3) ... [2022-11-18 19:52:40,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b76395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:52:40, skipping insertion in model container [2022-11-18 19:52:40,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:52:40" (3/3) ... [2022-11-18 19:52:40,541 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010.i [2022-11-18 19:52:40,553 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 19:52:40,566 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:52:40,567 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 19:52:40,567 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:52:40,657 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 19:52:40,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 202 flow [2022-11-18 19:52:40,822 INFO L130 PetriNetUnfolder]: 2/94 cut-off events. [2022-11-18 19:52:40,822 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:52:40,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2022-11-18 19:52:40,844 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 96 transitions, 202 flow [2022-11-18 19:52:40,863 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 94 transitions, 194 flow [2022-11-18 19:52:40,877 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:52:40,892 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@e0854a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:52:40,895 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-18 19:52:40,932 INFO L130 PetriNetUnfolder]: 0/57 cut-off events. [2022-11-18 19:52:40,933 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:52:40,933 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:40,934 INFO L209 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, 1, 1, 1] [2022-11-18 19:52:40,934 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:52:40,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:40,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1437239626, now seen corresponding path program 1 times [2022-11-18 19:52:40,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:40,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702739334] [2022-11-18 19:52:40,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:40,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:52:41,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:41,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702739334] [2022-11-18 19:52:41,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702739334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:41,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:41,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:52:41,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239243341] [2022-11-18 19:52:41,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:41,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:52:41,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:41,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:52:41,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:52:41,876 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 96 [2022-11-18 19:52:41,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 94 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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) [2022-11-18 19:52:41,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:41,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 96 [2022-11-18 19:52:41,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:41,993 INFO L130 PetriNetUnfolder]: 14/133 cut-off events. [2022-11-18 19:52:41,993 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-18 19:52:41,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 133 events. 14/133 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 250 event pairs, 2 based on Foata normal form. 5/129 useless extension candidates. Maximal degree in co-relation 127. Up to 25 conditions per place. [2022-11-18 19:52:41,998 INFO L137 encePairwiseOnDemand]: 91/96 looper letters, 8 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2022-11-18 19:52:41,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 92 transitions, 210 flow [2022-11-18 19:52:42,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:52:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:52:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2022-11-18 19:52:42,016 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9270833333333334 [2022-11-18 19:52:42,017 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2022-11-18 19:52:42,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2022-11-18 19:52:42,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:42,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2022-11-18 19:52:42,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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) [2022-11-18 19:52:42,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 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) [2022-11-18 19:52:42,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 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) [2022-11-18 19:52:42,035 INFO L175 Difference]: Start difference. First operand has 99 places, 94 transitions, 194 flow. Second operand 3 states and 267 transitions. [2022-11-18 19:52:42,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 92 transitions, 210 flow [2022-11-18 19:52:42,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 92 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 19:52:42,045 INFO L231 Difference]: Finished difference. Result has 97 places, 90 transitions, 188 flow [2022-11-18 19:52:42,047 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=97, PETRI_TRANSITIONS=90} [2022-11-18 19:52:42,052 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, -2 predicate places. [2022-11-18 19:52:42,052 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 90 transitions, 188 flow [2022-11-18 19:52:42,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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) [2022-11-18 19:52:42,053 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:42,053 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:42,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:52:42,054 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:52:42,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:42,055 INFO L85 PathProgramCache]: Analyzing trace with hash 418486813, now seen corresponding path program 1 times [2022-11-18 19:52:42,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:42,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132227656] [2022-11-18 19:52:42,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:42,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:52:42,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:42,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132227656] [2022-11-18 19:52:42,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132227656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:42,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:42,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:52:42,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744502698] [2022-11-18 19:52:42,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:42,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:52:42,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:42,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:52:42,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:52:42,498 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 96 [2022-11-18 19:52:42,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 90 transitions, 188 flow. Second operand has 7 states, 7 states have (on average 75.71428571428571) internal successors, (530), 7 states have internal predecessors, (530), 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) [2022-11-18 19:52:42,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:42,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 96 [2022-11-18 19:52:42,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:43,069 INFO L130 PetriNetUnfolder]: 119/446 cut-off events. [2022-11-18 19:52:43,069 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-11-18 19:52:43,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 446 events. 119/446 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2222 event pairs, 30 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 649. Up to 104 conditions per place. [2022-11-18 19:52:43,080 INFO L137 encePairwiseOnDemand]: 90/96 looper letters, 17 selfloop transitions, 2 changer transitions 37/119 dead transitions. [2022-11-18 19:52:43,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 119 transitions, 346 flow [2022-11-18 19:52:43,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:52:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 19:52:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 715 transitions. [2022-11-18 19:52:43,091 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8275462962962963 [2022-11-18 19:52:43,091 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 715 transitions. [2022-11-18 19:52:43,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 715 transitions. [2022-11-18 19:52:43,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:43,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 715 transitions. [2022-11-18 19:52:43,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 79.44444444444444) internal successors, (715), 9 states have internal predecessors, (715), 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) [2022-11-18 19:52:43,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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) [2022-11-18 19:52:43,105 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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) [2022-11-18 19:52:43,105 INFO L175 Difference]: Start difference. First operand has 97 places, 90 transitions, 188 flow. Second operand 9 states and 715 transitions. [2022-11-18 19:52:43,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 119 transitions, 346 flow [2022-11-18 19:52:43,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 119 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 19:52:43,113 INFO L231 Difference]: Finished difference. Result has 110 places, 80 transitions, 184 flow [2022-11-18 19:52:43,113 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=110, PETRI_TRANSITIONS=80} [2022-11-18 19:52:43,114 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, 11 predicate places. [2022-11-18 19:52:43,115 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 80 transitions, 184 flow [2022-11-18 19:52:43,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.71428571428571) internal successors, (530), 7 states have internal predecessors, (530), 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) [2022-11-18 19:52:43,116 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:43,117 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:43,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:52:43,117 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:52:43,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:43,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2016707608, now seen corresponding path program 1 times [2022-11-18 19:52:43,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:43,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424497753] [2022-11-18 19:52:43,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:43,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:52:43,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:43,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424497753] [2022-11-18 19:52:43,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424497753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:43,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:43,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:52:43,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690867576] [2022-11-18 19:52:43,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:43,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:52:43,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:43,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:52:43,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:52:43,586 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 96 [2022-11-18 19:52:43,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 80 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 77.0) internal successors, (462), 6 states have internal predecessors, (462), 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) [2022-11-18 19:52:43,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:43,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 96 [2022-11-18 19:52:43,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:44,045 INFO L130 PetriNetUnfolder]: 155/444 cut-off events. [2022-11-18 19:52:44,045 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-11-18 19:52:44,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 444 events. 155/444 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2050 event pairs, 14 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 817. Up to 79 conditions per place. [2022-11-18 19:52:44,049 INFO L137 encePairwiseOnDemand]: 87/96 looper letters, 24 selfloop transitions, 5 changer transitions 40/132 dead transitions. [2022-11-18 19:52:44,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 132 transitions, 449 flow [2022-11-18 19:52:44,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:52:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 19:52:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 821 transitions. [2022-11-18 19:52:44,054 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8552083333333333 [2022-11-18 19:52:44,054 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 821 transitions. [2022-11-18 19:52:44,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 821 transitions. [2022-11-18 19:52:44,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:44,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 821 transitions. [2022-11-18 19:52:44,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 82.1) internal successors, (821), 10 states have internal predecessors, (821), 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) [2022-11-18 19:52:44,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 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) [2022-11-18 19:52:44,064 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 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) [2022-11-18 19:52:44,065 INFO L175 Difference]: Start difference. First operand has 110 places, 80 transitions, 184 flow. Second operand 10 states and 821 transitions. [2022-11-18 19:52:44,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 132 transitions, 449 flow [2022-11-18 19:52:44,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 132 transitions, 419 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-18 19:52:44,074 INFO L231 Difference]: Finished difference. Result has 101 places, 81 transitions, 210 flow [2022-11-18 19:52:44,074 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=210, PETRI_PLACES=101, PETRI_TRANSITIONS=81} [2022-11-18 19:52:44,077 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, 2 predicate places. [2022-11-18 19:52:44,078 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 81 transitions, 210 flow [2022-11-18 19:52:44,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.0) internal successors, (462), 6 states have internal predecessors, (462), 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) [2022-11-18 19:52:44,079 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:44,079 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:44,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:52:44,080 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:52:44,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:44,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1480682087, now seen corresponding path program 1 times [2022-11-18 19:52:44,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:44,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255978427] [2022-11-18 19:52:44,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:44,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:44,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:52:44,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:44,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255978427] [2022-11-18 19:52:44,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255978427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:44,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:44,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:52:44,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953927027] [2022-11-18 19:52:44,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:44,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:52:44,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:44,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:52:44,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:52:44,496 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 96 [2022-11-18 19:52:44,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 81 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 77.0) internal successors, (539), 7 states have internal predecessors, (539), 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) [2022-11-18 19:52:44,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:44,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 96 [2022-11-18 19:52:44,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:44,812 INFO L130 PetriNetUnfolder]: 33/177 cut-off events. [2022-11-18 19:52:44,813 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-11-18 19:52:44,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 177 events. 33/177 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 481 event pairs, 4 based on Foata normal form. 7/183 useless extension candidates. Maximal degree in co-relation 359. Up to 26 conditions per place. [2022-11-18 19:52:44,814 INFO L137 encePairwiseOnDemand]: 88/96 looper letters, 16 selfloop transitions, 7 changer transitions 19/105 dead transitions. [2022-11-18 19:52:44,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 105 transitions, 390 flow [2022-11-18 19:52:44,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 19:52:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 19:52:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 794 transitions. [2022-11-18 19:52:44,819 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8270833333333333 [2022-11-18 19:52:44,819 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 794 transitions. [2022-11-18 19:52:44,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 794 transitions. [2022-11-18 19:52:44,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:44,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 794 transitions. [2022-11-18 19:52:44,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 79.4) internal successors, (794), 10 states have internal predecessors, (794), 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) [2022-11-18 19:52:44,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 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) [2022-11-18 19:52:44,826 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 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) [2022-11-18 19:52:44,826 INFO L175 Difference]: Start difference. First operand has 101 places, 81 transitions, 210 flow. Second operand 10 states and 794 transitions. [2022-11-18 19:52:44,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 105 transitions, 390 flow [2022-11-18 19:52:44,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 105 transitions, 348 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-11-18 19:52:44,832 INFO L231 Difference]: Finished difference. Result has 104 places, 81 transitions, 222 flow [2022-11-18 19:52:44,832 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=222, PETRI_PLACES=104, PETRI_TRANSITIONS=81} [2022-11-18 19:52:44,833 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, 5 predicate places. [2022-11-18 19:52:44,833 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 81 transitions, 222 flow [2022-11-18 19:52:44,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.0) internal successors, (539), 7 states have internal predecessors, (539), 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) [2022-11-18 19:52:44,834 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:44,835 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:44,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:52:44,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:52:44,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:44,836 INFO L85 PathProgramCache]: Analyzing trace with hash 776019113, now seen corresponding path program 1 times [2022-11-18 19:52:44,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:44,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824653560] [2022-11-18 19:52:44,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:52:45,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:45,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824653560] [2022-11-18 19:52:45,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824653560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:45,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:45,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:52:45,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685670436] [2022-11-18 19:52:45,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:45,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:52:45,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:45,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:52:45,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:52:45,315 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 96 [2022-11-18 19:52:45,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 81 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 76.42857142857143) internal successors, (535), 7 states have internal predecessors, (535), 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) [2022-11-18 19:52:45,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:45,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 96 [2022-11-18 19:52:45,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:45,558 INFO L130 PetriNetUnfolder]: 12/145 cut-off events. [2022-11-18 19:52:45,559 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-18 19:52:45,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 145 events. 12/145 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 272 event pairs, 0 based on Foata normal form. 1/145 useless extension candidates. Maximal degree in co-relation 232. Up to 26 conditions per place. [2022-11-18 19:52:45,561 INFO L137 encePairwiseOnDemand]: 90/96 looper letters, 17 selfloop transitions, 1 changer transitions 11/93 dead transitions. [2022-11-18 19:52:45,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 93 transitions, 306 flow [2022-11-18 19:52:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:52:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 19:52:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 548 transitions. [2022-11-18 19:52:45,564 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8154761904761905 [2022-11-18 19:52:45,564 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 548 transitions. [2022-11-18 19:52:45,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 548 transitions. [2022-11-18 19:52:45,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:45,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 548 transitions. [2022-11-18 19:52:45,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 78.28571428571429) internal successors, (548), 7 states have internal predecessors, (548), 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) [2022-11-18 19:52:45,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 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) [2022-11-18 19:52:45,570 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 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) [2022-11-18 19:52:45,570 INFO L175 Difference]: Start difference. First operand has 104 places, 81 transitions, 222 flow. Second operand 7 states and 548 transitions. [2022-11-18 19:52:45,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 93 transitions, 306 flow [2022-11-18 19:52:45,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 93 transitions, 260 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-11-18 19:52:45,579 INFO L231 Difference]: Finished difference. Result has 98 places, 81 transitions, 189 flow [2022-11-18 19:52:45,580 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=189, PETRI_PLACES=98, PETRI_TRANSITIONS=81} [2022-11-18 19:52:45,583 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, -1 predicate places. [2022-11-18 19:52:45,583 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 81 transitions, 189 flow [2022-11-18 19:52:45,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 76.42857142857143) internal successors, (535), 7 states have internal predecessors, (535), 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) [2022-11-18 19:52:45,584 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:45,585 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:45,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:52:45,586 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:52:45,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:45,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2130929445, now seen corresponding path program 2 times [2022-11-18 19:52:45,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:45,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984477358] [2022-11-18 19:52:45,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:45,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:52:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:52:48,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:52:48,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984477358] [2022-11-18 19:52:48,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984477358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:52:48,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:52:48,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-18 19:52:48,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694125424] [2022-11-18 19:52:48,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:52:48,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 19:52:48,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:52:48,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 19:52:48,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-18 19:52:48,905 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 96 [2022-11-18 19:52:48,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 81 transitions, 189 flow. Second operand has 13 states, 13 states have (on average 68.84615384615384) internal successors, (895), 13 states have internal predecessors, (895), 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) [2022-11-18 19:52:48,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:52:48,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 96 [2022-11-18 19:52:48,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:52:49,464 INFO L130 PetriNetUnfolder]: 4/126 cut-off events. [2022-11-18 19:52:49,464 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-18 19:52:49,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 126 events. 4/126 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 185 event pairs, 0 based on Foata normal form. 1/127 useless extension candidates. Maximal degree in co-relation 189. Up to 8 conditions per place. [2022-11-18 19:52:49,465 INFO L137 encePairwiseOnDemand]: 82/96 looper letters, 15 selfloop transitions, 9 changer transitions 12/93 dead transitions. [2022-11-18 19:52:49,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 93 transitions, 293 flow [2022-11-18 19:52:49,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 19:52:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-18 19:52:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1176 transitions. [2022-11-18 19:52:49,470 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7205882352941176 [2022-11-18 19:52:49,470 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1176 transitions. [2022-11-18 19:52:49,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1176 transitions. [2022-11-18 19:52:49,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:52:49,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1176 transitions. [2022-11-18 19:52:49,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 69.17647058823529) internal successors, (1176), 17 states have internal predecessors, (1176), 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) [2022-11-18 19:52:49,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 96.0) internal successors, (1728), 18 states have internal predecessors, (1728), 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) [2022-11-18 19:52:49,479 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 96.0) internal successors, (1728), 18 states have internal predecessors, (1728), 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) [2022-11-18 19:52:49,479 INFO L175 Difference]: Start difference. First operand has 98 places, 81 transitions, 189 flow. Second operand 17 states and 1176 transitions. [2022-11-18 19:52:49,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 93 transitions, 293 flow [2022-11-18 19:52:49,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 93 transitions, 278 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-18 19:52:49,482 INFO L231 Difference]: Finished difference. Result has 112 places, 81 transitions, 218 flow [2022-11-18 19:52:49,482 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=218, PETRI_PLACES=112, PETRI_TRANSITIONS=81} [2022-11-18 19:52:49,483 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, 13 predicate places. [2022-11-18 19:52:49,484 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 81 transitions, 218 flow [2022-11-18 19:52:49,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 68.84615384615384) internal successors, (895), 13 states have internal predecessors, (895), 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) [2022-11-18 19:52:49,485 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:52:49,485 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:52:49,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:52:49,485 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 19:52:49,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:52:49,486 INFO L85 PathProgramCache]: Analyzing trace with hash 145374343, now seen corresponding path program 3 times [2022-11-18 19:52:49,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:52:49,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174810064] [2022-11-18 19:52:49,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:52:49,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:52:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:52:49,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 19:52:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 19:52:49,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 19:52:49,656 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 19:52:49,657 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-18 19:52:49,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-18 19:52:49,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-18 19:52:49,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-18 19:52:49,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-18 19:52:49,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:52:49,662 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-11-18 19:52:49,670 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 19:52:49,670 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:52:49,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:52:49 BasicIcfg [2022-11-18 19:52:49,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:52:49,761 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:52:49,761 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:52:49,762 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:52:49,762 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:52:40" (3/4) ... [2022-11-18 19:52:49,764 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 19:52:49,914 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 19:52:49,920 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:52:49,921 INFO L158 Benchmark]: Toolchain (without parser) took 11568.41ms. Allocated memory was 96.5MB in the beginning and 220.2MB in the end (delta: 123.7MB). Free memory was 59.7MB in the beginning and 159.5MB in the end (delta: -99.8MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2022-11-18 19:52:49,922 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 96.5MB. Free memory was 66.9MB in the beginning and 66.8MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:52:49,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 854.62ms. Allocated memory is still 96.5MB. Free memory was 59.4MB in the beginning and 58.2MB in the end (delta: 1.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 19:52:49,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.50ms. Allocated memory is still 96.5MB. Free memory was 58.2MB in the beginning and 55.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:52:49,923 INFO L158 Benchmark]: Boogie Preprocessor took 83.31ms. Allocated memory is still 96.5MB. Free memory was 55.5MB in the beginning and 53.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:52:49,924 INFO L158 Benchmark]: RCFGBuilder took 1131.94ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 53.8MB in the beginning and 83.4MB in the end (delta: -29.6MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2022-11-18 19:52:49,924 INFO L158 Benchmark]: TraceAbstraction took 9230.09ms. Allocated memory was 125.8MB in the beginning and 220.2MB in the end (delta: 94.4MB). Free memory was 82.5MB in the beginning and 175.3MB in the end (delta: -92.7MB). Peak memory consumption was 112.4MB. Max. memory is 16.1GB. [2022-11-18 19:52:49,925 INFO L158 Benchmark]: Witness Printer took 158.87ms. Allocated memory is still 220.2MB. Free memory was 175.3MB in the beginning and 159.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-18 19:52:49,929 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 96.5MB. Free memory was 66.9MB in the beginning and 66.8MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 854.62ms. Allocated memory is still 96.5MB. Free memory was 59.4MB in the beginning and 58.2MB in the end (delta: 1.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.50ms. Allocated memory is still 96.5MB. Free memory was 58.2MB in the beginning and 55.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.31ms. Allocated memory is still 96.5MB. Free memory was 55.5MB in the beginning and 53.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1131.94ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 53.8MB in the beginning and 83.4MB in the end (delta: -29.6MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9230.09ms. Allocated memory was 125.8MB in the beginning and 220.2MB in the end (delta: 94.4MB). Free memory was 82.5MB in the beginning and 175.3MB in the end (delta: -92.7MB). Peak memory consumption was 112.4MB. Max. memory is 16.1GB. * Witness Printer took 158.87ms. Allocated memory is still 220.2MB. Free memory was 175.3MB in the beginning and 159.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L736] 0 _Bool weak$$choice0; VAL [weak$$choice0=0] [L737] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0] [L732] 0 int y$w_buff0; VAL [weak$$choice0=0, weak$$choice2=0, y$w_buff0=0] [L734] 0 int y$w_buff1; VAL [weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L723] 0 int y$mem_tmp; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L724] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L725] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L722] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L728] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L823] 0 pthread_t t1761; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1761={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1761, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1761, ((void *)0), P0, ((void *)0))=-1, t1761={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 pthread_t t1762; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1761={5:0}, t1762={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] FCALL, FORK 0 pthread_create(&t1762, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1762, ((void *)0), P1, ((void *)0))=0, t1761={5:0}, t1762={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff1 = y$w_buff0 [L772] 2 y$w_buff0 = 1 [L773] 2 y$w_buff1_used = y$w_buff0_used [L774] 2 y$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L776] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 y$flush_delayed = weak$$choice2 [L785] 2 y$mem_tmp = y [L786] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L787] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L788] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L789] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L790] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L792] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = y [L794] 2 y = y$flush_delayed ? y$mem_tmp : y [L795] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 y$flush_delayed = weak$$choice2 [L749] 1 y$mem_tmp = y [L750] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L751] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L752] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L753] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L754] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L756] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = y [L758] 1 y = y$flush_delayed ? y$mem_tmp : y [L759] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761={5:0}, t1762={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761={5:0}, t1762={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761={5:0}, t1762={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 114 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: 9.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 234 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 232 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 184 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 519 IncrementalHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 48 mSDtfsCounter, 519 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=4, InterpolantAutomatonStates: 56, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 398 ConstructedInterpolants, 0 QuantifiedInterpolants, 2197 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 RESULT: Ultimate proved your program to be incorrect! [2022-11-18 19:52:49,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_786b4fa9-82fb-49b1-b05a-b441f5ee6ec1/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE