./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg --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 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 09:50:31,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:50:31,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:50:31,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:50:31,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:50:31,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:50:31,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:50:31,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:50:31,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:50:31,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:50:31,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:50:31,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:50:31,062 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:50:31,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:50:31,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:50:31,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:50:31,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:50:31,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:50:31,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:50:31,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:50:31,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:50:31,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:50:31,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:50:31,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:50:31,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:50:31,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:50:31,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:50:31,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:50:31,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:50:31,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:50:31,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:50:31,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:50:31,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:50:31,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:50:31,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:50:31,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:50:31,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:50:31,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:50:31,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:50:31,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:50:31,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:50:31,103 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 09:50:31,131 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:50:31,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:50:31,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:50:31,132 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:50:31,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:50:31,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:50:31,134 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:50:31,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:50:31,135 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:50:31,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:50:31,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:50:31,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:50:31,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 09:50:31,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:50:31,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 09:50:31,136 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:50:31,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:50:31,137 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:50:31,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 09:50:31,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:50:31,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:50:31,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:50:31,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:50:31,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:50:31,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:50:31,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 09:50:31,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:50:31,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:50:31,140 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 09:50:31,140 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 09:50:31,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 09:50:31,140 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:50:31,141 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_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg/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_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg 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 -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2021-10-28 09:50:31,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:50:31,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:50:31,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:50:31,410 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:50:31,411 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:50:31,412 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2021-10-28 09:50:31,521 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg/data/f386f8820/e61ce4a148ac4e67b4c262effa424811/FLAG324ea702f [2021-10-28 09:50:32,077 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:50:32,078 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0436198-3ff1-4129-a0e6-4fdc2a58b725/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2021-10-28 09:50:32,095 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg/data/f386f8820/e61ce4a148ac4e67b4c262effa424811/FLAG324ea702f [2021-10-28 09:50:32,384 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg/data/f386f8820/e61ce4a148ac4e67b4c262effa424811 [2021-10-28 09:50:32,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:50:32,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:50:32,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:50:32,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:50:32,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:50:32,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:50:32" (1/1) ... [2021-10-28 09:50:32,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5db90e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:50:32, skipping insertion in model container [2021-10-28 09:50:32,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:50:32" (1/1) ... [2021-10-28 09:50:32,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:50:32,449 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:50:32,651 WARN L228 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_e0436198-3ff1-4129-a0e6-4fdc2a58b725/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2021-10-28 09:50:32,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:50:32,864 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:50:32,877 WARN L228 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_e0436198-3ff1-4129-a0e6-4fdc2a58b725/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2021-10-28 09:50:32,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:50:32,969 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:50:32,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:50:32 WrapperNode [2021-10-28 09:50:32,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:50:32,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:50:32,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:50:32,971 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:50:32,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:50:32" (1/1) ... [2021-10-28 09:50:33,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:50:32" (1/1) ... [2021-10-28 09:50:33,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:50:33,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:50:33,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:50:33,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:50:33,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:50:32" (1/1) ... [2021-10-28 09:50:33,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:50:32" (1/1) ... [2021-10-28 09:50:33,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:50:32" (1/1) ... [2021-10-28 09:50:33,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:50:32" (1/1) ... [2021-10-28 09:50:33,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:50:32" (1/1) ... [2021-10-28 09:50:33,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:50:32" (1/1) ... [2021-10-28 09:50:33,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:50:32" (1/1) ... [2021-10-28 09:50:33,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:50:33,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:50:33,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:50:33,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:50:33,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:50:32" (1/1) ... [2021-10-28 09:50:33,105 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:50:33,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:50:33,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:50:33,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:50:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 09:50:33,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-28 09:50:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:50:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 09:50:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-28 09:50:33,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-28 09:50:33,198 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-28 09:50:33,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-28 09:50:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-28 09:50:33,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-28 09:50:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:50:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-28 09:50:33,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:50:33,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:50:33,202 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-28 09:50:35,279 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:50:35,279 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-28 09:50:35,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:50:35 BoogieIcfgContainer [2021-10-28 09:50:35,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:50:35,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:50:35,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:50:35,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:50:35,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:50:32" (1/3) ... [2021-10-28 09:50:35,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5486c4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:50:35, skipping insertion in model container [2021-10-28 09:50:35,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:50:32" (2/3) ... [2021-10-28 09:50:35,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5486c4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:50:35, skipping insertion in model container [2021-10-28 09:50:35,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:50:35" (3/3) ... [2021-10-28 09:50:35,298 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2021-10-28 09:50:35,304 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-28 09:50:35,304 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:50:35,304 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-28 09:50:35,304 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-28 09:50:35,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,349 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,349 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,350 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,350 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,350 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,351 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,351 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,352 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,357 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,358 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,358 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,358 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,363 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,363 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,364 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,364 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,373 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,374 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,374 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,376 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,377 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,380 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,380 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,380 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,381 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-28 09:50:35,383 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-28 09:50:35,434 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:50:35,441 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 09:50:35,441 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-28 09:50:35,454 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2021-10-28 09:50:35,498 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-10-28 09:50:35,498 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 09:50:35,502 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-10-28 09:50:35,502 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2021-10-28 09:50:35,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2021-10-28 09:50:35,517 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2021-10-28 09:50:35,517 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 09:50:35,517 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:50:35,518 INFO L254 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] [2021-10-28 09:50:35,519 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:50:35,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:50:35,524 INFO L85 PathProgramCache]: Analyzing trace with hash -728222433, now seen corresponding path program 1 times [2021-10-28 09:50:35,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:50:35,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475399706] [2021-10-28 09:50:35,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:50:35,535 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:50:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:50:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:50:35,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:50:35,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475399706] [2021-10-28 09:50:35,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475399706] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:50:35,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:50:35,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:50:35,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240003108] [2021-10-28 09:50:35,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:50:35,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:50:35,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:50:35,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:50:35,853 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 106 [2021-10-28 09:50:35,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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) [2021-10-28 09:50:35,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:50:35,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 106 [2021-10-28 09:50:35,861 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:50:36,022 INFO L129 PetriNetUnfolder]: 49/393 cut-off events. [2021-10-28 09:50:36,022 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 09:50:36,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 393 events. 49/393 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1977 event pairs, 38 based on Foata normal form. 18/387 useless extension candidates. Maximal degree in co-relation 442. Up to 65 conditions per place. [2021-10-28 09:50:36,029 INFO L132 encePairwiseOnDemand]: 101/106 looper letters, 9 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2021-10-28 09:50:36,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 103 transitions, 237 flow [2021-10-28 09:50:36,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:50:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-28 09:50:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2021-10-28 09:50:36,044 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9465408805031447 [2021-10-28 09:50:36,045 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2021-10-28 09:50:36,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2021-10-28 09:50:36,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:50:36,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2021-10-28 09:50:36,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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) [2021-10-28 09:50:36,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 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) [2021-10-28 09:50:36,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 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) [2021-10-28 09:50:36,063 INFO L186 Difference]: Start difference. First operand has 111 places, 103 transitions, 215 flow. Second operand 3 states and 301 transitions. [2021-10-28 09:50:36,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 103 transitions, 237 flow [2021-10-28 09:50:36,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 103 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-10-28 09:50:36,071 INFO L242 Difference]: Finished difference. Result has 108 places, 99 transitions, 208 flow [2021-10-28 09:50:36,074 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=108, PETRI_TRANSITIONS=99} [2021-10-28 09:50:36,075 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, -3 predicate places. [2021-10-28 09:50:36,075 INFO L470 AbstractCegarLoop]: Abstraction has has 108 places, 99 transitions, 208 flow [2021-10-28 09:50:36,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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) [2021-10-28 09:50:36,076 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:50:36,076 INFO L254 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] [2021-10-28 09:50:36,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:50:36,076 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:50:36,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:50:36,077 INFO L85 PathProgramCache]: Analyzing trace with hash 136358668, now seen corresponding path program 1 times [2021-10-28 09:50:36,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:50:36,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588426446] [2021-10-28 09:50:36,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:50:36,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:50:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:50:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:50:36,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:50:36,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588426446] [2021-10-28 09:50:36,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588426446] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:50:36,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:50:36,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:50:36,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731286506] [2021-10-28 09:50:36,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:50:36,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:50:36,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:50:36,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:50:36,430 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 106 [2021-10-28 09:50:36,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 99 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 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) [2021-10-28 09:50:36,432 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:50:36,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 106 [2021-10-28 09:50:36,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:50:36,620 INFO L129 PetriNetUnfolder]: 4/136 cut-off events. [2021-10-28 09:50:36,621 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-28 09:50:36,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 136 events. 4/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 181 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2021-10-28 09:50:36,623 INFO L132 encePairwiseOnDemand]: 100/106 looper letters, 6 selfloop transitions, 2 changer transitions 23/111 dead transitions. [2021-10-28 09:50:36,623 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 111 transitions, 274 flow [2021-10-28 09:50:36,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:50:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 09:50:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 869 transitions. [2021-10-28 09:50:36,635 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.910901467505241 [2021-10-28 09:50:36,636 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 869 transitions. [2021-10-28 09:50:36,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 869 transitions. [2021-10-28 09:50:36,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:50:36,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 869 transitions. [2021-10-28 09:50:36,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.55555555555556) internal successors, (869), 9 states have internal predecessors, (869), 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) [2021-10-28 09:50:36,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 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) [2021-10-28 09:50:36,652 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 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) [2021-10-28 09:50:36,652 INFO L186 Difference]: Start difference. First operand has 108 places, 99 transitions, 208 flow. Second operand 9 states and 869 transitions. [2021-10-28 09:50:36,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 111 transitions, 274 flow [2021-10-28 09:50:36,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-10-28 09:50:36,665 INFO L242 Difference]: Finished difference. Result has 121 places, 88 transitions, 202 flow [2021-10-28 09:50:36,666 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=202, PETRI_PLACES=121, PETRI_TRANSITIONS=88} [2021-10-28 09:50:36,666 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 10 predicate places. [2021-10-28 09:50:36,667 INFO L470 AbstractCegarLoop]: Abstraction has has 121 places, 88 transitions, 202 flow [2021-10-28 09:50:36,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 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) [2021-10-28 09:50:36,668 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:50:36,668 INFO L254 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] [2021-10-28 09:50:36,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:50:36,669 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:50:36,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:50:36,684 INFO L85 PathProgramCache]: Analyzing trace with hash 801415437, now seen corresponding path program 1 times [2021-10-28 09:50:36,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:50:36,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139809971] [2021-10-28 09:50:36,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:50:36,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:50:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:50:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:50:36,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:50:36,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139809971] [2021-10-28 09:50:36,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139809971] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:50:36,954 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:50:36,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:50:36,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151684671] [2021-10-28 09:50:36,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:50:36,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:50:36,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:50:36,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:50:36,958 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-10-28 09:50:36,960 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 88 transitions, 202 flow. Second operand has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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) [2021-10-28 09:50:36,960 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:50:36,960 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-10-28 09:50:36,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:50:37,178 INFO L129 PetriNetUnfolder]: 4/111 cut-off events. [2021-10-28 09:50:37,178 INFO L130 PetriNetUnfolder]: For 17/24 co-relation queries the response was YES. [2021-10-28 09:50:37,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 111 events. 4/111 cut-off events. For 17/24 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 147 event pairs, 0 based on Foata normal form. 2/113 useless extension candidates. Maximal degree in co-relation 158. Up to 7 conditions per place. [2021-10-28 09:50:37,180 INFO L132 encePairwiseOnDemand]: 98/106 looper letters, 6 selfloop transitions, 4 changer transitions 12/100 dead transitions. [2021-10-28 09:50:37,180 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 100 transitions, 293 flow [2021-10-28 09:50:37,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 09:50:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-28 09:50:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 944 transitions. [2021-10-28 09:50:37,185 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8905660377358491 [2021-10-28 09:50:37,185 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 944 transitions. [2021-10-28 09:50:37,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 944 transitions. [2021-10-28 09:50:37,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:50:37,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 944 transitions. [2021-10-28 09:50:37,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.4) internal successors, (944), 10 states have internal predecessors, (944), 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) [2021-10-28 09:50:37,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 106.0) internal successors, (1166), 11 states have internal predecessors, (1166), 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) [2021-10-28 09:50:37,196 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 106.0) internal successors, (1166), 11 states have internal predecessors, (1166), 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) [2021-10-28 09:50:37,197 INFO L186 Difference]: Start difference. First operand has 121 places, 88 transitions, 202 flow. Second operand 10 states and 944 transitions. [2021-10-28 09:50:37,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 100 transitions, 293 flow [2021-10-28 09:50:37,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 100 transitions, 259 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-10-28 09:50:37,203 INFO L242 Difference]: Finished difference. Result has 113 places, 88 transitions, 216 flow [2021-10-28 09:50:37,204 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=216, PETRI_PLACES=113, PETRI_TRANSITIONS=88} [2021-10-28 09:50:37,204 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 2 predicate places. [2021-10-28 09:50:37,204 INFO L470 AbstractCegarLoop]: Abstraction has has 113 places, 88 transitions, 216 flow [2021-10-28 09:50:37,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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) [2021-10-28 09:50:37,205 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:50:37,206 INFO L254 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] [2021-10-28 09:50:37,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:50:37,206 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:50:37,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:50:37,207 INFO L85 PathProgramCache]: Analyzing trace with hash -614344647, now seen corresponding path program 1 times [2021-10-28 09:50:37,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:50:37,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092045493] [2021-10-28 09:50:37,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:50:37,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:50:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:50:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:50:37,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:50:37,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092045493] [2021-10-28 09:50:37,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092045493] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:50:37,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:50:37,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:50:37,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554529485] [2021-10-28 09:50:37,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:50:37,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:50:37,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:50:37,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:50:37,538 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 106 [2021-10-28 09:50:37,541 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 88 transitions, 216 flow. Second operand has 10 states, 10 states have (on average 86.1) internal successors, (861), 10 states have internal predecessors, (861), 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) [2021-10-28 09:50:37,541 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:50:37,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 106 [2021-10-28 09:50:37,542 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:50:38,131 INFO L129 PetriNetUnfolder]: 300/693 cut-off events. [2021-10-28 09:50:38,131 INFO L130 PetriNetUnfolder]: For 251/254 co-relation queries the response was YES. [2021-10-28 09:50:38,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1433 conditions, 693 events. 300/693 cut-off events. For 251/254 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3620 event pairs, 75 based on Foata normal form. 18/702 useless extension candidates. Maximal degree in co-relation 1372. Up to 297 conditions per place. [2021-10-28 09:50:38,140 INFO L132 encePairwiseOnDemand]: 94/106 looper letters, 14 selfloop transitions, 10 changer transitions 44/140 dead transitions. [2021-10-28 09:50:38,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 140 transitions, 492 flow [2021-10-28 09:50:38,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 09:50:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-28 09:50:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1346 transitions. [2021-10-28 09:50:38,148 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8465408805031447 [2021-10-28 09:50:38,148 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1346 transitions. [2021-10-28 09:50:38,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1346 transitions. [2021-10-28 09:50:38,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:50:38,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1346 transitions. [2021-10-28 09:50:38,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 89.73333333333333) internal successors, (1346), 15 states have internal predecessors, (1346), 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) [2021-10-28 09:50:38,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 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) [2021-10-28 09:50:38,160 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 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) [2021-10-28 09:50:38,160 INFO L186 Difference]: Start difference. First operand has 113 places, 88 transitions, 216 flow. Second operand 15 states and 1346 transitions. [2021-10-28 09:50:38,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 140 transitions, 492 flow [2021-10-28 09:50:38,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 140 transitions, 434 flow, removed 24 selfloop flow, removed 10 redundant places. [2021-10-28 09:50:38,171 INFO L242 Difference]: Finished difference. Result has 122 places, 94 transitions, 274 flow [2021-10-28 09:50:38,171 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=274, PETRI_PLACES=122, PETRI_TRANSITIONS=94} [2021-10-28 09:50:38,171 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 11 predicate places. [2021-10-28 09:50:38,172 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 94 transitions, 274 flow [2021-10-28 09:50:38,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 86.1) internal successors, (861), 10 states have internal predecessors, (861), 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) [2021-10-28 09:50:38,172 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:50:38,173 INFO L254 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] [2021-10-28 09:50:38,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:50:38,173 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:50:38,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:50:38,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1607729013, now seen corresponding path program 1 times [2021-10-28 09:50:38,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:50:38,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725223317] [2021-10-28 09:50:38,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:50:38,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:50:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:50:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:50:38,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:50:38,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725223317] [2021-10-28 09:50:38,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725223317] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:50:38,781 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:50:38,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 09:50:38,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014441738] [2021-10-28 09:50:38,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 09:50:38,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:50:38,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 09:50:38,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:50:38,789 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 106 [2021-10-28 09:50:38,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 94 transitions, 274 flow. Second operand has 14 states, 14 states have (on average 83.07142857142857) internal successors, (1163), 14 states have internal predecessors, (1163), 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) [2021-10-28 09:50:38,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:50:38,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 106 [2021-10-28 09:50:38,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:50:39,354 INFO L129 PetriNetUnfolder]: 205/515 cut-off events. [2021-10-28 09:50:39,355 INFO L130 PetriNetUnfolder]: For 1034/1070 co-relation queries the response was YES. [2021-10-28 09:50:39,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 515 events. 205/515 cut-off events. For 1034/1070 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2418 event pairs, 72 based on Foata normal form. 19/527 useless extension candidates. Maximal degree in co-relation 1495. Up to 259 conditions per place. [2021-10-28 09:50:39,363 INFO L132 encePairwiseOnDemand]: 92/106 looper letters, 16 selfloop transitions, 15 changer transitions 35/135 dead transitions. [2021-10-28 09:50:39,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 135 transitions, 670 flow [2021-10-28 09:50:39,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-28 09:50:39,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-10-28 09:50:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1623 transitions. [2021-10-28 09:50:39,376 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8058589870903674 [2021-10-28 09:50:39,377 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1623 transitions. [2021-10-28 09:50:39,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1623 transitions. [2021-10-28 09:50:39,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:50:39,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1623 transitions. [2021-10-28 09:50:39,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 85.42105263157895) internal successors, (1623), 19 states have internal predecessors, (1623), 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) [2021-10-28 09:50:39,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 106.0) internal successors, (2120), 20 states have internal predecessors, (2120), 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) [2021-10-28 09:50:39,392 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 106.0) internal successors, (2120), 20 states have internal predecessors, (2120), 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) [2021-10-28 09:50:39,393 INFO L186 Difference]: Start difference. First operand has 122 places, 94 transitions, 274 flow. Second operand 19 states and 1623 transitions. [2021-10-28 09:50:39,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 135 transitions, 670 flow [2021-10-28 09:50:39,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 135 transitions, 648 flow, removed 9 selfloop flow, removed 5 redundant places. [2021-10-28 09:50:39,403 INFO L242 Difference]: Finished difference. Result has 137 places, 98 transitions, 373 flow [2021-10-28 09:50:39,404 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=373, PETRI_PLACES=137, PETRI_TRANSITIONS=98} [2021-10-28 09:50:39,404 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 26 predicate places. [2021-10-28 09:50:39,404 INFO L470 AbstractCegarLoop]: Abstraction has has 137 places, 98 transitions, 373 flow [2021-10-28 09:50:39,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 83.07142857142857) internal successors, (1163), 14 states have internal predecessors, (1163), 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) [2021-10-28 09:50:39,406 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:50:39,406 INFO L254 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] [2021-10-28 09:50:39,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:50:39,407 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:50:39,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:50:39,408 INFO L85 PathProgramCache]: Analyzing trace with hash 771354867, now seen corresponding path program 1 times [2021-10-28 09:50:39,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:50:39,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441297522] [2021-10-28 09:50:39,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:50:39,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:50:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:50:39,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:50:39,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:50:39,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441297522] [2021-10-28 09:50:39,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441297522] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:50:39,654 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:50:39,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:50:39,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742652278] [2021-10-28 09:50:39,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:50:39,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:50:39,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:50:39,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:50:39,658 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 106 [2021-10-28 09:50:39,664 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 98 transitions, 373 flow. Second operand has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 9 states have internal predecessors, (785), 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) [2021-10-28 09:50:39,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:50:39,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 106 [2021-10-28 09:50:39,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:50:40,373 INFO L129 PetriNetUnfolder]: 246/583 cut-off events. [2021-10-28 09:50:40,374 INFO L130 PetriNetUnfolder]: For 3787/3847 co-relation queries the response was YES. [2021-10-28 09:50:40,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 583 events. 246/583 cut-off events. For 3787/3847 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2740 event pairs, 54 based on Foata normal form. 21/596 useless extension candidates. Maximal degree in co-relation 2314. Up to 213 conditions per place. [2021-10-28 09:50:40,389 INFO L132 encePairwiseOnDemand]: 95/106 looper letters, 26 selfloop transitions, 11 changer transitions 37/147 dead transitions. [2021-10-28 09:50:40,390 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 147 transitions, 911 flow [2021-10-28 09:50:40,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 09:50:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-10-28 09:50:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1272 transitions. [2021-10-28 09:50:40,396 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2021-10-28 09:50:40,396 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1272 transitions. [2021-10-28 09:50:40,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1272 transitions. [2021-10-28 09:50:40,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:50:40,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1272 transitions. [2021-10-28 09:50:40,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.85714285714286) internal successors, (1272), 14 states have internal predecessors, (1272), 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) [2021-10-28 09:50:40,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 106.0) internal successors, (1590), 15 states have internal predecessors, (1590), 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) [2021-10-28 09:50:40,409 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 106.0) internal successors, (1590), 15 states have internal predecessors, (1590), 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) [2021-10-28 09:50:40,409 INFO L186 Difference]: Start difference. First operand has 137 places, 98 transitions, 373 flow. Second operand 14 states and 1272 transitions. [2021-10-28 09:50:40,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 147 transitions, 911 flow [2021-10-28 09:50:40,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 147 transitions, 721 flow, removed 89 selfloop flow, removed 15 redundant places. [2021-10-28 09:50:40,423 INFO L242 Difference]: Finished difference. Result has 136 places, 102 transitions, 399 flow [2021-10-28 09:50:40,424 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=399, PETRI_PLACES=136, PETRI_TRANSITIONS=102} [2021-10-28 09:50:40,424 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 25 predicate places. [2021-10-28 09:50:40,424 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 102 transitions, 399 flow [2021-10-28 09:50:40,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 9 states have internal predecessors, (785), 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) [2021-10-28 09:50:40,425 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:50:40,425 INFO L254 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] [2021-10-28 09:50:40,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:50:40,426 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:50:40,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:50:40,426 INFO L85 PathProgramCache]: Analyzing trace with hash 347871633, now seen corresponding path program 2 times [2021-10-28 09:50:40,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:50:40,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231729322] [2021-10-28 09:50:40,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:50:40,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:50:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:50:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:50:40,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:50:40,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231729322] [2021-10-28 09:50:40,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231729322] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:50:40,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:50:40,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:50:40,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710363521] [2021-10-28 09:50:40,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:50:40,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:50:40,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:50:40,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:50:40,636 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 106 [2021-10-28 09:50:40,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 102 transitions, 399 flow. Second operand has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 9 states have internal predecessors, (785), 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) [2021-10-28 09:50:40,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:50:40,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 106 [2021-10-28 09:50:40,638 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:50:41,094 INFO L129 PetriNetUnfolder]: 201/490 cut-off events. [2021-10-28 09:50:41,094 INFO L130 PetriNetUnfolder]: For 2773/2885 co-relation queries the response was YES. [2021-10-28 09:50:41,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 490 events. 201/490 cut-off events. For 2773/2885 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2092 event pairs, 61 based on Foata normal form. 22/505 useless extension candidates. Maximal degree in co-relation 2158. Up to 195 conditions per place. [2021-10-28 09:50:41,105 INFO L132 encePairwiseOnDemand]: 98/106 looper letters, 25 selfloop transitions, 8 changer transitions 25/131 dead transitions. [2021-10-28 09:50:41,105 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 131 transitions, 813 flow [2021-10-28 09:50:41,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 09:50:41,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-10-28 09:50:41,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 995 transitions. [2021-10-28 09:50:41,110 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8533447684391081 [2021-10-28 09:50:41,111 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 995 transitions. [2021-10-28 09:50:41,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 995 transitions. [2021-10-28 09:50:41,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:50:41,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 995 transitions. [2021-10-28 09:50:41,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 90.45454545454545) internal successors, (995), 11 states have internal predecessors, (995), 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) [2021-10-28 09:50:41,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 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) [2021-10-28 09:50:41,121 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 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) [2021-10-28 09:50:41,122 INFO L186 Difference]: Start difference. First operand has 136 places, 102 transitions, 399 flow. Second operand 11 states and 995 transitions. [2021-10-28 09:50:41,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 131 transitions, 813 flow [2021-10-28 09:50:41,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 131 transitions, 757 flow, removed 23 selfloop flow, removed 8 redundant places. [2021-10-28 09:50:41,132 INFO L242 Difference]: Finished difference. Result has 136 places, 102 transitions, 402 flow [2021-10-28 09:50:41,133 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=402, PETRI_PLACES=136, PETRI_TRANSITIONS=102} [2021-10-28 09:50:41,133 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 25 predicate places. [2021-10-28 09:50:41,133 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 102 transitions, 402 flow [2021-10-28 09:50:41,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.22222222222223) internal successors, (785), 9 states have internal predecessors, (785), 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) [2021-10-28 09:50:41,134 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:50:41,135 INFO L254 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] [2021-10-28 09:50:41,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:50:41,135 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:50:41,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:50:41,136 INFO L85 PathProgramCache]: Analyzing trace with hash -885546683, now seen corresponding path program 1 times [2021-10-28 09:50:41,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:50:41,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888508714] [2021-10-28 09:50:41,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:50:41,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:50:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:50:41,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:50:41,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:50:41,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888508714] [2021-10-28 09:50:41,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888508714] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:50:41,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:50:41,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:50:41,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29677904] [2021-10-28 09:50:41,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:50:41,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:50:41,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:50:41,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:50:41,400 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 106 [2021-10-28 09:50:41,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 102 transitions, 402 flow. Second operand has 8 states, 8 states have (on average 88.5) internal successors, (708), 8 states have internal predecessors, (708), 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) [2021-10-28 09:50:41,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:50:41,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 106 [2021-10-28 09:50:41,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:50:41,815 INFO L129 PetriNetUnfolder]: 196/522 cut-off events. [2021-10-28 09:50:41,815 INFO L130 PetriNetUnfolder]: For 2752/2852 co-relation queries the response was YES. [2021-10-28 09:50:41,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2263 conditions, 522 events. 196/522 cut-off events. For 2752/2852 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2479 event pairs, 42 based on Foata normal form. 13/526 useless extension candidates. Maximal degree in co-relation 2183. Up to 194 conditions per place. [2021-10-28 09:50:41,826 INFO L132 encePairwiseOnDemand]: 96/106 looper letters, 26 selfloop transitions, 12 changer transitions 25/136 dead transitions. [2021-10-28 09:50:41,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 136 transitions, 886 flow [2021-10-28 09:50:41,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 09:50:41,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-10-28 09:50:41,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1008 transitions. [2021-10-28 09:50:41,831 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8644939965694682 [2021-10-28 09:50:41,831 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1008 transitions. [2021-10-28 09:50:41,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1008 transitions. [2021-10-28 09:50:41,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:50:41,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1008 transitions. [2021-10-28 09:50:41,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 91.63636363636364) internal successors, (1008), 11 states have internal predecessors, (1008), 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) [2021-10-28 09:50:41,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 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) [2021-10-28 09:50:41,841 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 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) [2021-10-28 09:50:41,841 INFO L186 Difference]: Start difference. First operand has 136 places, 102 transitions, 402 flow. Second operand 11 states and 1008 transitions. [2021-10-28 09:50:41,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 136 transitions, 886 flow [2021-10-28 09:50:41,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 136 transitions, 801 flow, removed 36 selfloop flow, removed 12 redundant places. [2021-10-28 09:50:41,854 INFO L242 Difference]: Finished difference. Result has 135 places, 105 transitions, 472 flow [2021-10-28 09:50:41,855 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=472, PETRI_PLACES=135, PETRI_TRANSITIONS=105} [2021-10-28 09:50:41,855 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 24 predicate places. [2021-10-28 09:50:41,855 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 105 transitions, 472 flow [2021-10-28 09:50:41,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.5) internal successors, (708), 8 states have internal predecessors, (708), 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) [2021-10-28 09:50:41,856 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:50:41,856 INFO L254 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, 1] [2021-10-28 09:50:41,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:50:41,857 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:50:41,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:50:41,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1450946230, now seen corresponding path program 1 times [2021-10-28 09:50:41,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:50:41,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479973515] [2021-10-28 09:50:41,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:50:41,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:50:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:50:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:50:42,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:50:42,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479973515] [2021-10-28 09:50:42,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479973515] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:50:42,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:50:42,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:50:42,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150635235] [2021-10-28 09:50:42,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:50:42,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:50:42,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:50:42,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:50:42,011 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-10-28 09:50:42,012 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 105 transitions, 472 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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) [2021-10-28 09:50:42,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:50:42,012 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-10-28 09:50:42,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:50:42,344 INFO L129 PetriNetUnfolder]: 333/929 cut-off events. [2021-10-28 09:50:42,344 INFO L130 PetriNetUnfolder]: For 3711/3754 co-relation queries the response was YES. [2021-10-28 09:50:42,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2975 conditions, 929 events. 333/929 cut-off events. For 3711/3754 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6242 event pairs, 50 based on Foata normal form. 40/912 useless extension candidates. Maximal degree in co-relation 2899. Up to 206 conditions per place. [2021-10-28 09:50:42,366 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 19 selfloop transitions, 16 changer transitions 0/130 dead transitions. [2021-10-28 09:50:42,366 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 130 transitions, 592 flow [2021-10-28 09:50:42,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:50:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-28 09:50:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 865 transitions. [2021-10-28 09:50:42,370 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9067085953878407 [2021-10-28 09:50:42,371 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 865 transitions. [2021-10-28 09:50:42,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 865 transitions. [2021-10-28 09:50:42,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:50:42,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 865 transitions. [2021-10-28 09:50:42,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.11111111111111) internal successors, (865), 9 states have internal predecessors, (865), 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) [2021-10-28 09:50:42,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 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) [2021-10-28 09:50:42,379 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 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) [2021-10-28 09:50:42,379 INFO L186 Difference]: Start difference. First operand has 135 places, 105 transitions, 472 flow. Second operand 9 states and 865 transitions. [2021-10-28 09:50:42,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 130 transitions, 592 flow [2021-10-28 09:50:42,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 130 transitions, 566 flow, removed 6 selfloop flow, removed 6 redundant places. [2021-10-28 09:50:42,394 INFO L242 Difference]: Finished difference. Result has 136 places, 119 transitions, 557 flow [2021-10-28 09:50:42,395 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=557, PETRI_PLACES=136, PETRI_TRANSITIONS=119} [2021-10-28 09:50:42,395 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 25 predicate places. [2021-10-28 09:50:42,395 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 119 transitions, 557 flow [2021-10-28 09:50:42,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 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) [2021-10-28 09:50:42,396 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:50:42,396 INFO L254 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, 1, 1] [2021-10-28 09:50:42,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:50:42,397 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:50:42,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:50:42,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1705551678, now seen corresponding path program 1 times [2021-10-28 09:50:42,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:50:42,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728078960] [2021-10-28 09:50:42,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:50:42,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:50:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:50:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:50:42,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:50:42,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728078960] [2021-10-28 09:50:42,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728078960] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:50:42,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:50:42,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:50:42,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617306849] [2021-10-28 09:50:42,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:50:42,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:50:42,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:50:42,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:50:42,549 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-10-28 09:50:42,550 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 119 transitions, 557 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 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) [2021-10-28 09:50:42,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:50:42,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-10-28 09:50:42,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:50:42,901 INFO L129 PetriNetUnfolder]: 224/783 cut-off events. [2021-10-28 09:50:42,901 INFO L130 PetriNetUnfolder]: For 2191/2669 co-relation queries the response was YES. [2021-10-28 09:50:42,909 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2584 conditions, 783 events. 224/783 cut-off events. For 2191/2669 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5624 event pairs, 11 based on Foata normal form. 150/880 useless extension candidates. Maximal degree in co-relation 2506. Up to 199 conditions per place. [2021-10-28 09:50:42,916 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 15 selfloop transitions, 31 changer transitions 6/146 dead transitions. [2021-10-28 09:50:42,916 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 837 flow [2021-10-28 09:50:42,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:50:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-10-28 09:50:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1154 transitions. [2021-10-28 09:50:42,920 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9072327044025157 [2021-10-28 09:50:42,920 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1154 transitions. [2021-10-28 09:50:42,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1154 transitions. [2021-10-28 09:50:42,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:50:42,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1154 transitions. [2021-10-28 09:50:42,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 96.16666666666667) internal successors, (1154), 12 states have internal predecessors, (1154), 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) [2021-10-28 09:50:42,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 106.0) internal successors, (1378), 13 states have internal predecessors, (1378), 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) [2021-10-28 09:50:42,929 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 106.0) internal successors, (1378), 13 states have internal predecessors, (1378), 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) [2021-10-28 09:50:42,929 INFO L186 Difference]: Start difference. First operand has 136 places, 119 transitions, 557 flow. Second operand 12 states and 1154 transitions. [2021-10-28 09:50:42,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 837 flow [2021-10-28 09:50:42,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 828 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-10-28 09:50:42,944 INFO L242 Difference]: Finished difference. Result has 148 places, 137 transitions, 773 flow [2021-10-28 09:50:42,945 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=773, PETRI_PLACES=148, PETRI_TRANSITIONS=137} [2021-10-28 09:50:42,945 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 37 predicate places. [2021-10-28 09:50:42,945 INFO L470 AbstractCegarLoop]: Abstraction has has 148 places, 137 transitions, 773 flow [2021-10-28 09:50:42,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 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) [2021-10-28 09:50:42,946 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:50:42,946 INFO L254 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, 1, 1, 1, 1] [2021-10-28 09:50:42,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:50:42,947 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:50:42,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:50:42,948 INFO L85 PathProgramCache]: Analyzing trace with hash 455395135, now seen corresponding path program 1 times [2021-10-28 09:50:42,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:50:42,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076809126] [2021-10-28 09:50:42,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:50:42,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:50:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:50:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:50:43,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:50:43,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076809126] [2021-10-28 09:50:43,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076809126] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:50:43,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:50:43,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:50:43,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437307888] [2021-10-28 09:50:43,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:50:43,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:50:43,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:50:43,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:50:43,099 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 106 [2021-10-28 09:50:43,100 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 773 flow. Second operand has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 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) [2021-10-28 09:50:43,100 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:50:43,101 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 106 [2021-10-28 09:50:43,101 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:50:43,464 INFO L129 PetriNetUnfolder]: 182/695 cut-off events. [2021-10-28 09:50:43,465 INFO L130 PetriNetUnfolder]: For 2376/3018 co-relation queries the response was YES. [2021-10-28 09:50:43,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2523 conditions, 695 events. 182/695 cut-off events. For 2376/3018 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5174 event pairs, 1 based on Foata normal form. 150/793 useless extension candidates. Maximal degree in co-relation 2441. Up to 177 conditions per place. [2021-10-28 09:50:43,480 INFO L132 encePairwiseOnDemand]: 97/106 looper letters, 10 selfloop transitions, 36 changer transitions 16/156 dead transitions. [2021-10-28 09:50:43,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 156 transitions, 1027 flow [2021-10-28 09:50:43,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 09:50:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-10-28 09:50:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1431 transitions. [2021-10-28 09:50:43,485 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9 [2021-10-28 09:50:43,485 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1431 transitions. [2021-10-28 09:50:43,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1431 transitions. [2021-10-28 09:50:43,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:50:43,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1431 transitions. [2021-10-28 09:50:43,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 95.4) internal successors, (1431), 15 states have internal predecessors, (1431), 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) [2021-10-28 09:50:43,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 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) [2021-10-28 09:50:43,498 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 106.0) internal successors, (1696), 16 states have internal predecessors, (1696), 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) [2021-10-28 09:50:43,498 INFO L186 Difference]: Start difference. First operand has 148 places, 137 transitions, 773 flow. Second operand 15 states and 1431 transitions. [2021-10-28 09:50:43,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 156 transitions, 1027 flow [2021-10-28 09:50:43,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 156 transitions, 819 flow, removed 88 selfloop flow, removed 11 redundant places. [2021-10-28 09:50:43,525 INFO L242 Difference]: Finished difference. Result has 157 places, 137 transitions, 709 flow [2021-10-28 09:50:43,526 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=709, PETRI_PLACES=157, PETRI_TRANSITIONS=137} [2021-10-28 09:50:43,526 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 46 predicate places. [2021-10-28 09:50:43,526 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 137 transitions, 709 flow [2021-10-28 09:50:43,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 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) [2021-10-28 09:50:43,527 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:50:43,528 INFO L254 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:50:43,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 09:50:43,528 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:50:43,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:50:43,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1621304470, now seen corresponding path program 1 times [2021-10-28 09:50:43,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:50:43,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671912821] [2021-10-28 09:50:43,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:50:43,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:50:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:50:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:50:43,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:50:43,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671912821] [2021-10-28 09:50:43,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671912821] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:50:43,752 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:50:43,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:50:43,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75874573] [2021-10-28 09:50:43,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:50:43,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:50:43,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:50:43,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:50:43,755 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 106 [2021-10-28 09:50:43,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 137 transitions, 709 flow. Second operand has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 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) [2021-10-28 09:50:43,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:50:43,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 106 [2021-10-28 09:50:43,756 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:50:43,998 INFO L129 PetriNetUnfolder]: 233/975 cut-off events. [2021-10-28 09:50:43,998 INFO L130 PetriNetUnfolder]: For 2396/2491 co-relation queries the response was YES. [2021-10-28 09:50:44,010 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2912 conditions, 975 events. 233/975 cut-off events. For 2396/2491 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 8553 event pairs, 2 based on Foata normal form. 1/904 useless extension candidates. Maximal degree in co-relation 2847. Up to 131 conditions per place. [2021-10-28 09:50:44,015 INFO L132 encePairwiseOnDemand]: 100/106 looper letters, 7 selfloop transitions, 2 changer transitions 13/142 dead transitions. [2021-10-28 09:50:44,015 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 142 transitions, 747 flow [2021-10-28 09:50:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:50:44,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-10-28 09:50:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 573 transitions. [2021-10-28 09:50:44,017 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9009433962264151 [2021-10-28 09:50:44,017 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 573 transitions. [2021-10-28 09:50:44,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 573 transitions. [2021-10-28 09:50:44,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:50:44,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 573 transitions. [2021-10-28 09:50:44,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 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) [2021-10-28 09:50:44,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 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) [2021-10-28 09:50:44,021 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 106.0) internal successors, (742), 7 states have internal predecessors, (742), 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) [2021-10-28 09:50:44,022 INFO L186 Difference]: Start difference. First operand has 157 places, 137 transitions, 709 flow. Second operand 6 states and 573 transitions. [2021-10-28 09:50:44,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 142 transitions, 747 flow [2021-10-28 09:50:44,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 142 transitions, 656 flow, removed 21 selfloop flow, removed 17 redundant places. [2021-10-28 09:50:44,059 INFO L242 Difference]: Finished difference. Result has 147 places, 129 transitions, 571 flow [2021-10-28 09:50:44,059 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=147, PETRI_TRANSITIONS=129} [2021-10-28 09:50:44,060 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 36 predicate places. [2021-10-28 09:50:44,060 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 129 transitions, 571 flow [2021-10-28 09:50:44,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 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) [2021-10-28 09:50:44,061 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:50:44,061 INFO L254 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:50:44,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:50:44,063 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:50:44,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:50:44,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1789051788, now seen corresponding path program 2 times [2021-10-28 09:50:44,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:50:44,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787954288] [2021-10-28 09:50:44,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:50:44,065 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:50:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:50:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:50:44,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:50:44,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787954288] [2021-10-28 09:50:44,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787954288] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:50:44,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:50:44,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 09:50:44,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900833826] [2021-10-28 09:50:44,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 09:50:44,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:50:44,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 09:50:44,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:50:44,500 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 106 [2021-10-28 09:50:44,501 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 129 transitions, 571 flow. Second operand has 14 states, 14 states have (on average 81.5) internal successors, (1141), 14 states have internal predecessors, (1141), 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) [2021-10-28 09:50:44,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-28 09:50:44,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 106 [2021-10-28 09:50:44,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-28 09:50:44,864 INFO L129 PetriNetUnfolder]: 158/701 cut-off events. [2021-10-28 09:50:44,864 INFO L130 PetriNetUnfolder]: For 792/841 co-relation queries the response was YES. [2021-10-28 09:50:44,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 701 events. 158/701 cut-off events. For 792/841 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5453 event pairs, 0 based on Foata normal form. 1/661 useless extension candidates. Maximal degree in co-relation 1810. Up to 79 conditions per place. [2021-10-28 09:50:44,872 INFO L132 encePairwiseOnDemand]: 95/106 looper letters, 20 selfloop transitions, 9 changer transitions 7/136 dead transitions. [2021-10-28 09:50:44,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 136 transitions, 669 flow [2021-10-28 09:50:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 09:50:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-10-28 09:50:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 910 transitions. [2021-10-28 09:50:44,875 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7804459691252144 [2021-10-28 09:50:44,876 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 910 transitions. [2021-10-28 09:50:44,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 910 transitions. [2021-10-28 09:50:44,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-28 09:50:44,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 910 transitions. [2021-10-28 09:50:44,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 82.72727272727273) internal successors, (910), 11 states have internal predecessors, (910), 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) [2021-10-28 09:50:44,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 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) [2021-10-28 09:50:44,892 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 106.0) internal successors, (1272), 12 states have internal predecessors, (1272), 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) [2021-10-28 09:50:44,900 INFO L186 Difference]: Start difference. First operand has 147 places, 129 transitions, 571 flow. Second operand 11 states and 910 transitions. [2021-10-28 09:50:44,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 136 transitions, 669 flow [2021-10-28 09:50:44,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 136 transitions, 639 flow, removed 9 selfloop flow, removed 10 redundant places. [2021-10-28 09:50:44,918 INFO L242 Difference]: Finished difference. Result has 146 places, 127 transitions, 561 flow [2021-10-28 09:50:44,919 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=561, PETRI_PLACES=146, PETRI_TRANSITIONS=127} [2021-10-28 09:50:44,919 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 35 predicate places. [2021-10-28 09:50:44,919 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 127 transitions, 561 flow [2021-10-28 09:50:44,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 81.5) internal successors, (1141), 14 states have internal predecessors, (1141), 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) [2021-10-28 09:50:44,921 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-28 09:50:44,921 INFO L254 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, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:50:44,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 09:50:44,922 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-28 09:50:44,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:50:44,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1315076062, now seen corresponding path program 3 times [2021-10-28 09:50:44,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:50:44,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103249345] [2021-10-28 09:50:44,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:50:44,923 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:50:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:50:44,993 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:50:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:50:45,147 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:50:45,147 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 09:50:45,148 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:50:45,151 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:50:45,151 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-28 09:50:45,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-28 09:50:45,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-28 09:50:45,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:50:45,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 09:50:45,157 INFO L731 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:50:45,162 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-28 09:50:45,163 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:50:45,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:50:45 BasicIcfg [2021-10-28 09:50:45,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:50:45,351 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:50:45,351 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:50:45,351 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:50:45,352 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:50:35" (3/4) ... [2021-10-28 09:50:45,354 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 09:50:45,522 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:50:45,523 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:50:45,524 INFO L168 Benchmark]: Toolchain (without parser) took 13135.05 ms. Allocated memory was 98.6 MB in the beginning and 251.7 MB in the end (delta: 153.1 MB). Free memory was 62.6 MB in the beginning and 95.0 MB in the end (delta: -32.4 MB). Peak memory consumption was 119.2 MB. Max. memory is 16.1 GB. [2021-10-28 09:50:45,524 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 98.6 MB. Free memory is still 53.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:50:45,525 INFO L168 Benchmark]: CACSL2BoogieTranslator took 580.13 ms. Allocated memory is still 98.6 MB. Free memory was 62.4 MB in the beginning and 60.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:50:45,525 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.84 ms. Allocated memory is still 98.6 MB. Free memory was 60.6 MB in the beginning and 57.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:50:45,526 INFO L168 Benchmark]: Boogie Preprocessor took 38.47 ms. Allocated memory is still 98.6 MB. Free memory was 57.5 MB in the beginning and 55.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:50:45,526 INFO L168 Benchmark]: RCFGBuilder took 2208.11 ms. Allocated memory was 98.6 MB in the beginning and 132.1 MB in the end (delta: 33.6 MB). Free memory was 55.3 MB in the beginning and 75.3 MB in the end (delta: -20.0 MB). Peak memory consumption was 55.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:50:45,527 INFO L168 Benchmark]: TraceAbstraction took 10063.29 ms. Allocated memory was 132.1 MB in the beginning and 251.7 MB in the end (delta: 119.5 MB). Free memory was 74.2 MB in the beginning and 124.3 MB in the end (delta: -50.1 MB). Peak memory consumption was 70.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:50:45,527 INFO L168 Benchmark]: Witness Printer took 171.70 ms. Allocated memory is still 251.7 MB. Free memory was 124.3 MB in the beginning and 95.0 MB in the end (delta: 29.4 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2021-10-28 09:50:45,529 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.31 ms. Allocated memory is still 98.6 MB. Free memory is still 53.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 580.13 ms. Allocated memory is still 98.6 MB. Free memory was 62.4 MB in the beginning and 60.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.84 ms. Allocated memory is still 98.6 MB. Free memory was 60.6 MB in the beginning and 57.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.47 ms. Allocated memory is still 98.6 MB. Free memory was 57.5 MB in the beginning and 55.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2208.11 ms. Allocated memory was 98.6 MB in the beginning and 132.1 MB in the end (delta: 33.6 MB). Free memory was 55.3 MB in the beginning and 75.3 MB in the end (delta: -20.0 MB). Peak memory consumption was 55.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10063.29 ms. Allocated memory was 132.1 MB in the beginning and 251.7 MB in the end (delta: 119.5 MB). Free memory was 74.2 MB in the beginning and 124.3 MB in the end (delta: -50.1 MB). Peak memory consumption was 70.5 MB. Max. memory is 16.1 GB. * Witness Printer took 171.70 ms. Allocated memory is still 251.7 MB. Free memory was 124.3 MB in the beginning and 95.0 MB in the end (delta: 29.4 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L720] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L721] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L722] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L723] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L724] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L725] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L726] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L727] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L728] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L729] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L730] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L731] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L732] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L733] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L734] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L735] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2025; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2026; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2027; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0: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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0: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=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0: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=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0: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=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0: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=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: 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: 823]: 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: 821]: 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: 819]: 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 7 procedures, 133 locations, 6 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.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 132 SDtfs, 377 SDslu, 458 SDs, 0 SdLazy, 860 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=773occurred in iteration=10, InterpolantAutomatonStates: 145, 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.8s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1021 NumberOfCodeBlocks, 1021 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 926 ConstructedInterpolants, 0 QuantifiedInterpolants, 5100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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! [2021-10-28 09:50:45,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0436198-3ff1-4129-a0e6-4fdc2a58b725/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...