./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/bin/uautomizer-QkZJyEgLgS --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 b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 03:27:02,117 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:27:02,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:27:02,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:27:02,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:27:02,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:27:02,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:27:02,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:27:02,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:27:02,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:27:02,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:27:02,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:27:02,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:27:02,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:27:02,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:27:02,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:27:02,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:27:02,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:27:02,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:27:02,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:27:02,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:27:02,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:27:02,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:27:02,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:27:02,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:27:02,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:27:02,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:27:02,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:27:02,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:27:02,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:27:02,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:27:02,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:27:02,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:27:02,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:27:02,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:27:02,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:27:02,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:27:02,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:27:02,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:27:02,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:27:02,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:27:02,203 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 03:27:02,226 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:27:02,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:27:02,227 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:27:02,227 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:27:02,228 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:27:02,228 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:27:02,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:27:02,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:27:02,230 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:27:02,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:27:02,230 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:27:02,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:27:02,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:27:02,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:27:02,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:27:02,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:27:02,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:27:02,232 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:27:02,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:27:02,232 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:27:02,233 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:27:02,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:27:02,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:27:02,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:27:02,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:27:02,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:27:02,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:27:02,235 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:27:02,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:27:02,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:27:02,235 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:27:02,236 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:27:02,236 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:27:02,236 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:27:02,236 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/bin/uautomizer-QkZJyEgLgS/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_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/bin/uautomizer-QkZJyEgLgS 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 -> b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 [2022-11-23 03:27:02,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:27:02,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:27:02,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:27:02,567 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:27:02,568 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:27:02,569 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-23 03:27:05,705 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:27:06,048 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:27:06,048 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-23 03:27:06,063 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/bin/uautomizer-QkZJyEgLgS/data/8b4278efd/09727c1bafe443a493aece3e7c337510/FLAG1b9d71778 [2022-11-23 03:27:06,083 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/bin/uautomizer-QkZJyEgLgS/data/8b4278efd/09727c1bafe443a493aece3e7c337510 [2022-11-23 03:27:06,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:27:06,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:27:06,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:27:06,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:27:06,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:27:06,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:27:06" (1/1) ... [2022-11-23 03:27:06,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@739091e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:06, skipping insertion in model container [2022-11-23 03:27:06,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:27:06" (1/1) ... [2022-11-23 03:27:06,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:27:06,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:27:06,331 WARN L237 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_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-11-23 03:27:06,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:27:06,639 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:27:06,661 WARN L237 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_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-11-23 03:27:06,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:27:06,785 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:27:06,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:06 WrapperNode [2022-11-23 03:27:06,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:27:06,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:27:06,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:27:06,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:27:06,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:06" (1/1) ... [2022-11-23 03:27:06,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:06" (1/1) ... [2022-11-23 03:27:06,888 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-11-23 03:27:06,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:27:06,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:27:06,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:27:06,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:27:06,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:06" (1/1) ... [2022-11-23 03:27:06,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:06" (1/1) ... [2022-11-23 03:27:06,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:06" (1/1) ... [2022-11-23 03:27:06,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:06" (1/1) ... [2022-11-23 03:27:06,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:06" (1/1) ... [2022-11-23 03:27:06,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:06" (1/1) ... [2022-11-23 03:27:06,950 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:06" (1/1) ... [2022-11-23 03:27:06,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:06" (1/1) ... [2022-11-23 03:27:06,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:27:06,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:27:06,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:27:06,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:27:06,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:06" (1/1) ... [2022-11-23 03:27:06,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:27:06,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:27:07,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:27:07,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:27:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 03:27:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 03:27:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:27:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:27:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:27:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 03:27:07,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 03:27:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 03:27:07,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 03:27:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 03:27:07,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 03:27:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:27:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 03:27:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:27:07,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:27:07,061 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 03:27:07,214 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:27:07,216 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:27:07,700 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:27:07,929 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:27:07,932 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 03:27:07,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:27:07 BoogieIcfgContainer [2022-11-23 03:27:07,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:27:07,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:27:07,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:27:07,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:27:07,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:27:06" (1/3) ... [2022-11-23 03:27:07,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bde879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:27:07, skipping insertion in model container [2022-11-23 03:27:07,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:27:06" (2/3) ... [2022-11-23 03:27:07,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bde879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:27:07, skipping insertion in model container [2022-11-23 03:27:07,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:27:07" (3/3) ... [2022-11-23 03:27:07,944 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-23 03:27:07,952 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 03:27:07,960 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:27:07,960 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 03:27:07,960 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 03:27:08,040 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 03:27:08,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2022-11-23 03:27:08,233 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-11-23 03:27:08,234 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:27:08,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-11-23 03:27:08,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2022-11-23 03:27:08,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2022-11-23 03:27:08,248 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 03:27:08,277 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2022-11-23 03:27:08,280 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2022-11-23 03:27:08,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2022-11-23 03:27:08,310 INFO L130 PetriNetUnfolder]: 2/109 cut-off events. [2022-11-23 03:27:08,310 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:27:08,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-11-23 03:27:08,313 INFO L119 LiptonReduction]: Number of co-enabled transitions 1986 [2022-11-23 03:27:14,726 INFO L134 LiptonReduction]: Checked pairs total: 4802 [2022-11-23 03:27:14,726 INFO L136 LiptonReduction]: Total number of compositions: 100 [2022-11-23 03:27:14,754 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:27:14,761 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@35aa4fcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:27:14,761 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-23 03:27:14,765 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-11-23 03:27:14,766 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:27:14,766 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:27:14,767 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 03:27:14,768 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:27:14,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:27:14,773 INFO L85 PathProgramCache]: Analyzing trace with hash 484277, now seen corresponding path program 1 times [2022-11-23 03:27:14,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:27:14,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987256897] [2022-11-23 03:27:14,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:27:14,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:27:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:27:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:27:15,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:27:15,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987256897] [2022-11-23 03:27:15,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987256897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:27:15,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:27:15,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:27:15,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461402091] [2022-11-23 03:27:15,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:27:15,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:27:15,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:27:15,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:27:15,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:27:15,283 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 212 [2022-11-23 03:27:15,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:15,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:27:15,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 212 [2022-11-23 03:27:15,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:27:15,690 INFO L130 PetriNetUnfolder]: 711/1130 cut-off events. [2022-11-23 03:27:15,690 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-23 03:27:15,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2249 conditions, 1130 events. 711/1130 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5115 event pairs, 191 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 2238. Up to 871 conditions per place. [2022-11-23 03:27:15,707 INFO L137 encePairwiseOnDemand]: 209/212 looper letters, 29 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2022-11-23 03:27:15,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 151 flow [2022-11-23 03:27:15,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:27:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:27:15,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2022-11-23 03:27:15,723 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5157232704402516 [2022-11-23 03:27:15,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2022-11-23 03:27:15,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2022-11-23 03:27:15,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:27:15,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2022-11-23 03:27:15,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:15,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:15,740 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:15,742 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 53 flow. Second operand 3 states and 328 transitions. [2022-11-23 03:27:15,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 151 flow [2022-11-23 03:27:15,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 03:27:15,747 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2022-11-23 03:27:15,749 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-11-23 03:27:15,752 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2022-11-23 03:27:15,753 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2022-11-23 03:27:15,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:15,753 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:27:15,753 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:27:15,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:27:15,754 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:27:15,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:27:15,755 INFO L85 PathProgramCache]: Analyzing trace with hash -374928528, now seen corresponding path program 1 times [2022-11-23 03:27:15,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:27:15,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982531881] [2022-11-23 03:27:15,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:27:15,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:27:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:27:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:27:17,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:27:17,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982531881] [2022-11-23 03:27:17,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982531881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:27:17,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:27:17,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:27:17,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959344758] [2022-11-23 03:27:17,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:27:17,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:27:17,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:27:17,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:27:17,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:27:17,488 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2022-11-23 03:27:17,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:17,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:27:17,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2022-11-23 03:27:17,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:27:17,864 INFO L130 PetriNetUnfolder]: 830/1263 cut-off events. [2022-11-23 03:27:17,864 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-11-23 03:27:17,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2652 conditions, 1263 events. 830/1263 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5672 event pairs, 134 based on Foata normal form. 24/1285 useless extension candidates. Maximal degree in co-relation 2642. Up to 1069 conditions per place. [2022-11-23 03:27:17,873 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 34 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2022-11-23 03:27:17,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 45 transitions, 198 flow [2022-11-23 03:27:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:27:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:27:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2022-11-23 03:27:17,877 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47877358490566035 [2022-11-23 03:27:17,877 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 406 transitions. [2022-11-23 03:27:17,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 406 transitions. [2022-11-23 03:27:17,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:27:17,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 406 transitions. [2022-11-23 03:27:17,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:17,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 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) [2022-11-23 03:27:17,883 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 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) [2022-11-23 03:27:17,883 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 4 states and 406 transitions. [2022-11-23 03:27:17,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 45 transitions, 198 flow [2022-11-23 03:27:17,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 45 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:27:17,885 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 109 flow [2022-11-23 03:27:17,885 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2022-11-23 03:27:17,886 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2022-11-23 03:27:17,886 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 109 flow [2022-11-23 03:27:17,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:17,887 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:27:17,887 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:27:17,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:27:17,888 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:27:17,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:27:17,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1262116541, now seen corresponding path program 1 times [2022-11-23 03:27:17,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:27:17,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959197276] [2022-11-23 03:27:17,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:27:17,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:27:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:27:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:27:19,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:27:19,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959197276] [2022-11-23 03:27:19,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959197276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:27:19,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:27:19,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:27:19,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931210608] [2022-11-23 03:27:19,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:27:19,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:27:19,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:27:19,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:27:19,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:27:19,162 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2022-11-23 03:27:19,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:19,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:27:19,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2022-11-23 03:27:19,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:27:19,500 INFO L130 PetriNetUnfolder]: 780/1246 cut-off events. [2022-11-23 03:27:19,501 INFO L131 PetriNetUnfolder]: For 442/442 co-relation queries the response was YES. [2022-11-23 03:27:19,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3436 conditions, 1246 events. 780/1246 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5469 event pairs, 163 based on Foata normal form. 18/1264 useless extension candidates. Maximal degree in co-relation 3424. Up to 809 conditions per place. [2022-11-23 03:27:19,510 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 35 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2022-11-23 03:27:19,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 265 flow [2022-11-23 03:27:19,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:27:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:27:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 397 transitions. [2022-11-23 03:27:19,513 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4681603773584906 [2022-11-23 03:27:19,513 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 397 transitions. [2022-11-23 03:27:19,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 397 transitions. [2022-11-23 03:27:19,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:27:19,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 397 transitions. [2022-11-23 03:27:19,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:19,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 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) [2022-11-23 03:27:19,518 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 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) [2022-11-23 03:27:19,518 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 109 flow. Second operand 4 states and 397 transitions. [2022-11-23 03:27:19,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 265 flow [2022-11-23 03:27:19,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 265 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 03:27:19,522 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 194 flow [2022-11-23 03:27:19,522 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2022-11-23 03:27:19,523 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2022-11-23 03:27:19,523 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 194 flow [2022-11-23 03:27:19,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:19,524 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:27:19,524 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:27:19,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:27:19,524 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:27:19,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:27:19,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1027071655, now seen corresponding path program 1 times [2022-11-23 03:27:19,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:27:19,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421615192] [2022-11-23 03:27:19,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:27:19,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:27:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:27:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:27:19,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:27:19,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421615192] [2022-11-23 03:27:19,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421615192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:27:19,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:27:19,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:27:19,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79161554] [2022-11-23 03:27:19,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:27:19,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:27:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:27:19,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:27:19,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:27:19,956 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 212 [2022-11-23 03:27:19,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:19,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:27:19,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 212 [2022-11-23 03:27:19,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:27:20,301 INFO L130 PetriNetUnfolder]: 903/1369 cut-off events. [2022-11-23 03:27:20,301 INFO L131 PetriNetUnfolder]: For 1375/1443 co-relation queries the response was YES. [2022-11-23 03:27:20,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4397 conditions, 1369 events. 903/1369 cut-off events. For 1375/1443 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5663 event pairs, 369 based on Foata normal form. 58/1412 useless extension candidates. Maximal degree in co-relation 4380. Up to 1254 conditions per place. [2022-11-23 03:27:20,316 INFO L137 encePairwiseOnDemand]: 206/212 looper letters, 44 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2022-11-23 03:27:20,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 370 flow [2022-11-23 03:27:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:27:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:27:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-11-23 03:27:20,321 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5011792452830188 [2022-11-23 03:27:20,322 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 425 transitions. [2022-11-23 03:27:20,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 425 transitions. [2022-11-23 03:27:20,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:27:20,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 425 transitions. [2022-11-23 03:27:20,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:20,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 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) [2022-11-23 03:27:20,332 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 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) [2022-11-23 03:27:20,332 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 194 flow. Second operand 4 states and 425 transitions. [2022-11-23 03:27:20,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 370 flow [2022-11-23 03:27:20,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:27:20,345 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 240 flow [2022-11-23 03:27:20,346 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2022-11-23 03:27:20,348 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2022-11-23 03:27:20,348 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 240 flow [2022-11-23 03:27:20,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:20,349 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:27:20,349 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:27:20,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 03:27:20,350 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:27:20,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:27:20,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1668870555, now seen corresponding path program 1 times [2022-11-23 03:27:20,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:27:20,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195964081] [2022-11-23 03:27:20,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:27:20,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:27:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:27:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:27:21,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:27:21,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195964081] [2022-11-23 03:27:21,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195964081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:27:21,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:27:21,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:27:21,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210999723] [2022-11-23 03:27:21,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:27:21,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:27:21,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:27:21,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:27:21,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:27:21,539 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2022-11-23 03:27:21,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:21,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:27:21,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2022-11-23 03:27:21,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:27:21,969 INFO L130 PetriNetUnfolder]: 1080/1739 cut-off events. [2022-11-23 03:27:21,969 INFO L131 PetriNetUnfolder]: For 1885/1925 co-relation queries the response was YES. [2022-11-23 03:27:21,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5877 conditions, 1739 events. 1080/1739 cut-off events. For 1885/1925 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8449 event pairs, 275 based on Foata normal form. 40/1762 useless extension candidates. Maximal degree in co-relation 5857. Up to 909 conditions per place. [2022-11-23 03:27:21,982 INFO L137 encePairwiseOnDemand]: 205/212 looper letters, 46 selfloop transitions, 11 changer transitions 2/62 dead transitions. [2022-11-23 03:27:21,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 444 flow [2022-11-23 03:27:21,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:27:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:27:21,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 403 transitions. [2022-11-23 03:27:21,985 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47523584905660377 [2022-11-23 03:27:21,985 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 403 transitions. [2022-11-23 03:27:21,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 403 transitions. [2022-11-23 03:27:21,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:27:21,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 403 transitions. [2022-11-23 03:27:21,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:21,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 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) [2022-11-23 03:27:21,991 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 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) [2022-11-23 03:27:21,992 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 240 flow. Second operand 4 states and 403 transitions. [2022-11-23 03:27:21,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 444 flow [2022-11-23 03:27:22,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 444 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 03:27:22,006 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 294 flow [2022-11-23 03:27:22,006 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=294, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2022-11-23 03:27:22,009 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2022-11-23 03:27:22,009 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 294 flow [2022-11-23 03:27:22,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:22,010 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:27:22,010 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:27:22,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:27:22,011 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:27:22,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:27:22,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1670705538, now seen corresponding path program 1 times [2022-11-23 03:27:22,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:27:22,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039960672] [2022-11-23 03:27:22,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:27:22,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:27:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:27:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:27:22,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:27:22,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039960672] [2022-11-23 03:27:22,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039960672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:27:22,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:27:22,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:27:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89548411] [2022-11-23 03:27:22,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:27:22,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:27:22,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:27:22,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:27:22,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:27:22,672 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 212 [2022-11-23 03:27:22,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 294 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:22,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:27:22,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 212 [2022-11-23 03:27:22,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:27:23,051 INFO L130 PetriNetUnfolder]: 1041/1614 cut-off events. [2022-11-23 03:27:23,051 INFO L131 PetriNetUnfolder]: For 2594/2646 co-relation queries the response was YES. [2022-11-23 03:27:23,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5758 conditions, 1614 events. 1041/1614 cut-off events. For 2594/2646 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7310 event pairs, 353 based on Foata normal form. 54/1664 useless extension candidates. Maximal degree in co-relation 5734. Up to 1470 conditions per place. [2022-11-23 03:27:23,065 INFO L137 encePairwiseOnDemand]: 206/212 looper letters, 51 selfloop transitions, 13 changer transitions 1/68 dead transitions. [2022-11-23 03:27:23,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 68 transitions, 566 flow [2022-11-23 03:27:23,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:27:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:27:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 422 transitions. [2022-11-23 03:27:23,068 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49764150943396224 [2022-11-23 03:27:23,068 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 422 transitions. [2022-11-23 03:27:23,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 422 transitions. [2022-11-23 03:27:23,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:27:23,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 422 transitions. [2022-11-23 03:27:23,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:23,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 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) [2022-11-23 03:27:23,072 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 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) [2022-11-23 03:27:23,073 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 294 flow. Second operand 4 states and 422 transitions. [2022-11-23 03:27:23,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 68 transitions, 566 flow [2022-11-23 03:27:23,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 549 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-23 03:27:23,084 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 376 flow [2022-11-23 03:27:23,084 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=376, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2022-11-23 03:27:23,085 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2022-11-23 03:27:23,085 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 376 flow [2022-11-23 03:27:23,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:23,085 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:27:23,085 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:27:23,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 03:27:23,086 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:27:23,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:27:23,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1775837532, now seen corresponding path program 1 times [2022-11-23 03:27:23,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:27:23,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381121229] [2022-11-23 03:27:23,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:27:23,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:27:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:27:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:27:23,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:27:23,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381121229] [2022-11-23 03:27:23,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381121229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:27:23,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:27:23,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:27:23,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503857250] [2022-11-23 03:27:23,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:27:23,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:27:23,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:27:23,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:27:23,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:27:23,521 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 212 [2022-11-23 03:27:23,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 376 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:23,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:27:23,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 212 [2022-11-23 03:27:23,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:27:23,937 INFO L130 PetriNetUnfolder]: 1045/1624 cut-off events. [2022-11-23 03:27:23,938 INFO L131 PetriNetUnfolder]: For 3474/3523 co-relation queries the response was YES. [2022-11-23 03:27:23,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6302 conditions, 1624 events. 1045/1624 cut-off events. For 3474/3523 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7309 event pairs, 453 based on Foata normal form. 34/1650 useless extension candidates. Maximal degree in co-relation 6275. Up to 1396 conditions per place. [2022-11-23 03:27:23,952 INFO L137 encePairwiseOnDemand]: 205/212 looper letters, 57 selfloop transitions, 18 changer transitions 0/78 dead transitions. [2022-11-23 03:27:23,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 78 transitions, 667 flow [2022-11-23 03:27:23,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:27:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:27:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2022-11-23 03:27:23,955 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5075471698113208 [2022-11-23 03:27:23,955 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2022-11-23 03:27:23,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2022-11-23 03:27:23,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:27:23,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2022-11-23 03:27:23,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:23,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 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) [2022-11-23 03:27:23,960 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 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) [2022-11-23 03:27:23,961 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 376 flow. Second operand 5 states and 538 transitions. [2022-11-23 03:27:23,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 78 transitions, 667 flow [2022-11-23 03:27:23,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 78 transitions, 665 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-23 03:27:23,973 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 481 flow [2022-11-23 03:27:23,974 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=481, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2022-11-23 03:27:23,974 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2022-11-23 03:27:23,975 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 481 flow [2022-11-23 03:27:23,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:23,975 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:27:23,975 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:27:23,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 03:27:23,980 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:27:23,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:27:23,980 INFO L85 PathProgramCache]: Analyzing trace with hash 250582761, now seen corresponding path program 1 times [2022-11-23 03:27:23,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:27:23,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663912676] [2022-11-23 03:27:23,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:27:23,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:27:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:27:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:27:25,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:27:25,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663912676] [2022-11-23 03:27:25,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663912676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:27:25,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:27:25,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:27:25,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531116111] [2022-11-23 03:27:25,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:27:25,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:27:25,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:27:25,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:27:25,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:27:25,182 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 212 [2022-11-23 03:27:25,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:25,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:27:25,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 212 [2022-11-23 03:27:25,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:27:25,823 INFO L130 PetriNetUnfolder]: 1182/1837 cut-off events. [2022-11-23 03:27:25,824 INFO L131 PetriNetUnfolder]: For 6089/6137 co-relation queries the response was YES. [2022-11-23 03:27:25,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8203 conditions, 1837 events. 1182/1837 cut-off events. For 6089/6137 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8573 event pairs, 316 based on Foata normal form. 58/1886 useless extension candidates. Maximal degree in co-relation 8172. Up to 1490 conditions per place. [2022-11-23 03:27:25,839 INFO L137 encePairwiseOnDemand]: 204/212 looper letters, 72 selfloop transitions, 33 changer transitions 1/109 dead transitions. [2022-11-23 03:27:25,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 109 transitions, 1063 flow [2022-11-23 03:27:25,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:27:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:27:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2022-11-23 03:27:25,842 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4849056603773585 [2022-11-23 03:27:25,842 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 514 transitions. [2022-11-23 03:27:25,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 514 transitions. [2022-11-23 03:27:25,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:27:25,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 514 transitions. [2022-11-23 03:27:25,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:25,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 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) [2022-11-23 03:27:25,847 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 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) [2022-11-23 03:27:25,847 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 481 flow. Second operand 5 states and 514 transitions. [2022-11-23 03:27:25,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 109 transitions, 1063 flow [2022-11-23 03:27:25,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 109 transitions, 1019 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-11-23 03:27:25,860 INFO L231 Difference]: Finished difference. Result has 61 places, 75 transitions, 743 flow [2022-11-23 03:27:25,860 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=743, PETRI_PLACES=61, PETRI_TRANSITIONS=75} [2022-11-23 03:27:25,861 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2022-11-23 03:27:25,861 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 75 transitions, 743 flow [2022-11-23 03:27:25,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:25,862 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:27:25,862 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:27:25,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 03:27:25,862 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:27:25,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:27:25,863 INFO L85 PathProgramCache]: Analyzing trace with hash 252261411, now seen corresponding path program 2 times [2022-11-23 03:27:25,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:27:25,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603459875] [2022-11-23 03:27:25,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:27:25,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:27:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:27:27,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:27:27,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:27:27,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603459875] [2022-11-23 03:27:27,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603459875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:27:27,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:27:27,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:27:27,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179786320] [2022-11-23 03:27:27,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:27:27,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:27:27,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:27:27,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:27:27,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:27:27,125 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 212 [2022-11-23 03:27:27,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 75 transitions, 743 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:27,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:27:27,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 212 [2022-11-23 03:27:27,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:27:27,645 INFO L130 PetriNetUnfolder]: 1176/1826 cut-off events. [2022-11-23 03:27:27,646 INFO L131 PetriNetUnfolder]: For 8555/8628 co-relation queries the response was YES. [2022-11-23 03:27:27,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8984 conditions, 1826 events. 1176/1826 cut-off events. For 8555/8628 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8445 event pairs, 345 based on Foata normal form. 61/1876 useless extension candidates. Maximal degree in co-relation 8951. Up to 1265 conditions per place. [2022-11-23 03:27:27,671 INFO L137 encePairwiseOnDemand]: 206/212 looper letters, 78 selfloop transitions, 33 changer transitions 2/116 dead transitions. [2022-11-23 03:27:27,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 116 transitions, 1268 flow [2022-11-23 03:27:27,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:27:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:27:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2022-11-23 03:27:27,675 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5037735849056604 [2022-11-23 03:27:27,675 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2022-11-23 03:27:27,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2022-11-23 03:27:27,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:27:27,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2022-11-23 03:27:27,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:27,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 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) [2022-11-23 03:27:27,680 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 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) [2022-11-23 03:27:27,680 INFO L175 Difference]: Start difference. First operand has 61 places, 75 transitions, 743 flow. Second operand 5 states and 534 transitions. [2022-11-23 03:27:27,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 116 transitions, 1268 flow [2022-11-23 03:27:27,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 116 transitions, 1255 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-11-23 03:27:27,703 INFO L231 Difference]: Finished difference. Result has 66 places, 82 transitions, 911 flow [2022-11-23 03:27:27,703 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=911, PETRI_PLACES=66, PETRI_TRANSITIONS=82} [2022-11-23 03:27:27,705 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 34 predicate places. [2022-11-23 03:27:27,705 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 82 transitions, 911 flow [2022-11-23 03:27:27,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:27,708 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:27:27,708 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:27:27,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 03:27:27,710 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:27:27,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:27:27,711 INFO L85 PathProgramCache]: Analyzing trace with hash 783522368, now seen corresponding path program 1 times [2022-11-23 03:27:27,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:27:27,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101917706] [2022-11-23 03:27:27,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:27:27,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:27:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:27:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:27:28,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:27:28,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101917706] [2022-11-23 03:27:28,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101917706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:27:28,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:27:28,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:27:28,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998150714] [2022-11-23 03:27:28,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:27:28,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:27:28,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:27:28,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:27:28,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:27:28,343 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 212 [2022-11-23 03:27:28,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 82 transitions, 911 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:28,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:27:28,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 212 [2022-11-23 03:27:28,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:27:28,790 INFO L130 PetriNetUnfolder]: 1163/1805 cut-off events. [2022-11-23 03:27:28,790 INFO L131 PetriNetUnfolder]: For 10395/10469 co-relation queries the response was YES. [2022-11-23 03:27:28,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9639 conditions, 1805 events. 1163/1805 cut-off events. For 10395/10469 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8347 event pairs, 432 based on Foata normal form. 50/1844 useless extension candidates. Maximal degree in co-relation 9603. Up to 1569 conditions per place. [2022-11-23 03:27:28,813 INFO L137 encePairwiseOnDemand]: 206/212 looper letters, 76 selfloop transitions, 18 changer transitions 0/97 dead transitions. [2022-11-23 03:27:28,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 97 transitions, 1181 flow [2022-11-23 03:27:28,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:27:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:27:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 424 transitions. [2022-11-23 03:27:28,816 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-11-23 03:27:28,816 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 424 transitions. [2022-11-23 03:27:28,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 424 transitions. [2022-11-23 03:27:28,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:27:28,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 424 transitions. [2022-11-23 03:27:28,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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) [2022-11-23 03:27:28,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 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) [2022-11-23 03:27:28,824 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 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) [2022-11-23 03:27:28,824 INFO L175 Difference]: Start difference. First operand has 66 places, 82 transitions, 911 flow. Second operand 4 states and 424 transitions. [2022-11-23 03:27:28,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 97 transitions, 1181 flow [2022-11-23 03:27:28,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 97 transitions, 1168 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-23 03:27:28,846 INFO L231 Difference]: Finished difference. Result has 69 places, 82 transitions, 951 flow [2022-11-23 03:27:28,847 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=951, PETRI_PLACES=69, PETRI_TRANSITIONS=82} [2022-11-23 03:27:28,848 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 37 predicate places. [2022-11-23 03:27:28,849 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 82 transitions, 951 flow [2022-11-23 03:27:28,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:28,850 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:27:28,850 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:27:28,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 03:27:28,850 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:27:28,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:27:28,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1663907587, now seen corresponding path program 1 times [2022-11-23 03:27:28,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:27:28,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753798304] [2022-11-23 03:27:28,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:27:28,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:27:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:27:29,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:27:29,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:27:29,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753798304] [2022-11-23 03:27:29,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753798304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:27:29,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:27:29,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:27:29,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530220434] [2022-11-23 03:27:29,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:27:29,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:27:29,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:27:29,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:27:29,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:27:29,056 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2022-11-23 03:27:29,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 82 transitions, 951 flow. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:29,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:27:29,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2022-11-23 03:27:29,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:27:29,568 INFO L130 PetriNetUnfolder]: 833/1389 cut-off events. [2022-11-23 03:27:29,569 INFO L131 PetriNetUnfolder]: For 10656/10743 co-relation queries the response was YES. [2022-11-23 03:27:29,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7559 conditions, 1389 events. 833/1389 cut-off events. For 10656/10743 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7057 event pairs, 104 based on Foata normal form. 231/1605 useless extension candidates. Maximal degree in co-relation 7521. Up to 762 conditions per place. [2022-11-23 03:27:29,584 INFO L137 encePairwiseOnDemand]: 206/212 looper letters, 81 selfloop transitions, 6 changer transitions 69/163 dead transitions. [2022-11-23 03:27:29,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 163 transitions, 2117 flow [2022-11-23 03:27:29,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:27:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:27:29,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2022-11-23 03:27:29,587 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49245283018867925 [2022-11-23 03:27:29,587 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2022-11-23 03:27:29,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2022-11-23 03:27:29,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:27:29,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2022-11-23 03:27:29,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:29,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 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) [2022-11-23 03:27:29,593 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 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) [2022-11-23 03:27:29,593 INFO L175 Difference]: Start difference. First operand has 69 places, 82 transitions, 951 flow. Second operand 5 states and 522 transitions. [2022-11-23 03:27:29,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 163 transitions, 2117 flow [2022-11-23 03:27:29,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 163 transitions, 1998 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-11-23 03:27:29,614 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 650 flow [2022-11-23 03:27:29,614 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=650, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2022-11-23 03:27:29,615 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2022-11-23 03:27:29,615 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 650 flow [2022-11-23 03:27:29,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:29,615 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:27:29,616 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:27:29,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 03:27:29,616 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:27:29,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:27:29,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1975738788, now seen corresponding path program 1 times [2022-11-23 03:27:29,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:27:29,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168782339] [2022-11-23 03:27:29,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:27:29,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:27:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:27:30,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:27:30,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:27:30,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168782339] [2022-11-23 03:27:30,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168782339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:27:30,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:27:30,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:27:30,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705025881] [2022-11-23 03:27:30,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:27:30,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:27:30,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:27:30,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:27:30,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:27:30,032 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2022-11-23 03:27:30,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 650 flow. Second operand has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:30,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:27:30,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2022-11-23 03:27:30,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:27:30,382 INFO L130 PetriNetUnfolder]: 580/1014 cut-off events. [2022-11-23 03:27:30,382 INFO L131 PetriNetUnfolder]: For 8140/8237 co-relation queries the response was YES. [2022-11-23 03:27:30,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5783 conditions, 1014 events. 580/1014 cut-off events. For 8140/8237 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5178 event pairs, 43 based on Foata normal form. 161/1167 useless extension candidates. Maximal degree in co-relation 5745. Up to 457 conditions per place. [2022-11-23 03:27:30,390 INFO L137 encePairwiseOnDemand]: 206/212 looper letters, 85 selfloop transitions, 10 changer transitions 71/173 dead transitions. [2022-11-23 03:27:30,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 173 transitions, 2105 flow [2022-11-23 03:27:30,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:27:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:27:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 729 transitions. [2022-11-23 03:27:30,394 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4912398921832884 [2022-11-23 03:27:30,394 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 729 transitions. [2022-11-23 03:27:30,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 729 transitions. [2022-11-23 03:27:30,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:27:30,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 729 transitions. [2022-11-23 03:27:30,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.14285714285714) internal successors, (729), 7 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:30,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 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) [2022-11-23 03:27:30,400 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 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) [2022-11-23 03:27:30,400 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 650 flow. Second operand 7 states and 729 transitions. [2022-11-23 03:27:30,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 173 transitions, 2105 flow [2022-11-23 03:27:30,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 173 transitions, 1994 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-11-23 03:27:30,414 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 614 flow [2022-11-23 03:27:30,414 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=614, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2022-11-23 03:27:30,415 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2022-11-23 03:27:30,415 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 614 flow [2022-11-23 03:27:30,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:30,415 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:27:30,416 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:27:30,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 03:27:30,416 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:27:30,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:27:30,417 INFO L85 PathProgramCache]: Analyzing trace with hash 236450760, now seen corresponding path program 1 times [2022-11-23 03:27:30,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:27:30,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910110386] [2022-11-23 03:27:30,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:27:30,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:27:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:27:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:27:30,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:27:30,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910110386] [2022-11-23 03:27:30,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910110386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:27:30,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:27:30,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:27:30,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079548091] [2022-11-23 03:27:30,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:27:30,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:27:30,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:27:30,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:27:30,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:27:30,823 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2022-11-23 03:27:30,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 614 flow. Second operand has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:30,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:27:30,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2022-11-23 03:27:30,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:27:31,193 INFO L130 PetriNetUnfolder]: 491/857 cut-off events. [2022-11-23 03:27:31,194 INFO L131 PetriNetUnfolder]: For 6224/6283 co-relation queries the response was YES. [2022-11-23 03:27:31,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5036 conditions, 857 events. 491/857 cut-off events. For 6224/6283 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4309 event pairs, 37 based on Foata normal form. 56/906 useless extension candidates. Maximal degree in co-relation 4997. Up to 381 conditions per place. [2022-11-23 03:27:31,201 INFO L137 encePairwiseOnDemand]: 206/212 looper letters, 63 selfloop transitions, 10 changer transitions 88/166 dead transitions. [2022-11-23 03:27:31,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 166 transitions, 1962 flow [2022-11-23 03:27:31,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:27:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 03:27:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 915 transitions. [2022-11-23 03:27:31,204 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47955974842767296 [2022-11-23 03:27:31,205 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 915 transitions. [2022-11-23 03:27:31,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 915 transitions. [2022-11-23 03:27:31,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:27:31,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 915 transitions. [2022-11-23 03:27:31,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.66666666666667) internal successors, (915), 9 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:31,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 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) [2022-11-23 03:27:31,212 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 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) [2022-11-23 03:27:31,212 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 614 flow. Second operand 9 states and 915 transitions. [2022-11-23 03:27:31,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 166 transitions, 1962 flow [2022-11-23 03:27:31,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 166 transitions, 1862 flow, removed 27 selfloop flow, removed 7 redundant places. [2022-11-23 03:27:31,231 INFO L231 Difference]: Finished difference. Result has 77 places, 53 transitions, 508 flow [2022-11-23 03:27:31,232 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=508, PETRI_PLACES=77, PETRI_TRANSITIONS=53} [2022-11-23 03:27:31,233 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 45 predicate places. [2022-11-23 03:27:31,233 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 53 transitions, 508 flow [2022-11-23 03:27:31,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:31,234 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:27:31,234 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:27:31,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 03:27:31,234 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:27:31,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:27:31,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1011308070, now seen corresponding path program 1 times [2022-11-23 03:27:31,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:27:31,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470158660] [2022-11-23 03:27:31,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:27:31,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:27:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:27:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:27:32,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:27:32,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470158660] [2022-11-23 03:27:32,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470158660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:27:32,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:27:32,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:27:32,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639866769] [2022-11-23 03:27:32,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:27:32,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:27:32,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:27:32,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:27:32,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:27:32,731 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 212 [2022-11-23 03:27:32,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 53 transitions, 508 flow. Second operand has 7 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:32,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:27:32,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 212 [2022-11-23 03:27:32,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:27:33,137 INFO L130 PetriNetUnfolder]: 162/309 cut-off events. [2022-11-23 03:27:33,137 INFO L131 PetriNetUnfolder]: For 1490/1495 co-relation queries the response was YES. [2022-11-23 03:27:33,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1744 conditions, 309 events. 162/309 cut-off events. For 1490/1495 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1070 event pairs, 24 based on Foata normal form. 3/311 useless extension candidates. Maximal degree in co-relation 1706. Up to 159 conditions per place. [2022-11-23 03:27:33,140 INFO L137 encePairwiseOnDemand]: 207/212 looper letters, 46 selfloop transitions, 13 changer transitions 17/78 dead transitions. [2022-11-23 03:27:33,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 78 transitions, 850 flow [2022-11-23 03:27:33,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:27:33,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 03:27:33,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 601 transitions. [2022-11-23 03:27:33,143 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4724842767295597 [2022-11-23 03:27:33,143 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 601 transitions. [2022-11-23 03:27:33,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 601 transitions. [2022-11-23 03:27:33,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:27:33,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 601 transitions. [2022-11-23 03:27:33,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:33,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:33,148 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:33,148 INFO L175 Difference]: Start difference. First operand has 77 places, 53 transitions, 508 flow. Second operand 6 states and 601 transitions. [2022-11-23 03:27:33,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 78 transitions, 850 flow [2022-11-23 03:27:33,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 710 flow, removed 42 selfloop flow, removed 12 redundant places. [2022-11-23 03:27:33,155 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 440 flow [2022-11-23 03:27:33,155 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=440, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2022-11-23 03:27:33,156 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 32 predicate places. [2022-11-23 03:27:33,156 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 440 flow [2022-11-23 03:27:33,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:27:33,157 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:27:33,157 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:27:33,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 03:27:33,158 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:27:33,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:27:33,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1819629972, now seen corresponding path program 2 times [2022-11-23 03:27:33,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:27:33,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178359402] [2022-11-23 03:27:33,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:27:33,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:27:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:27:33,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:27:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:27:33,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:27:33,290 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 03:27:33,291 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-23 03:27:33,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-23 03:27:33,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-23 03:27:33,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-23 03:27:33,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-23 03:27:33,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-23 03:27:33,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 03:27:33,294 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:27:33,301 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 03:27:33,301 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 03:27:33,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:27:33 BasicIcfg [2022-11-23 03:27:33,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 03:27:33,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 03:27:33,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 03:27:33,374 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 03:27:33,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:27:07" (3/4) ... [2022-11-23 03:27:33,376 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 03:27:33,490 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 03:27:33,491 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 03:27:33,491 INFO L158 Benchmark]: Toolchain (without parser) took 27399.32ms. Allocated memory was 226.5MB in the beginning and 570.4MB in the end (delta: 343.9MB). Free memory was 191.6MB in the beginning and 269.3MB in the end (delta: -77.7MB). Peak memory consumption was 268.1MB. Max. memory is 16.1GB. [2022-11-23 03:27:33,492 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:27:33,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 690.51ms. Allocated memory is still 226.5MB. Free memory was 191.6MB in the beginning and 168.0MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 03:27:33,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.55ms. Allocated memory is still 226.5MB. Free memory was 168.0MB in the beginning and 165.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:27:33,493 INFO L158 Benchmark]: Boogie Preprocessor took 66.95ms. Allocated memory is still 226.5MB. Free memory was 165.3MB in the beginning and 163.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:27:33,493 INFO L158 Benchmark]: RCFGBuilder took 970.88ms. Allocated memory is still 226.5MB. Free memory was 163.2MB in the beginning and 128.9MB in the end (delta: 34.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-23 03:27:33,494 INFO L158 Benchmark]: TraceAbstraction took 25434.83ms. Allocated memory was 226.5MB in the beginning and 570.4MB in the end (delta: 343.9MB). Free memory was 128.1MB in the beginning and 278.8MB in the end (delta: -150.6MB). Peak memory consumption was 194.7MB. Max. memory is 16.1GB. [2022-11-23 03:27:33,494 INFO L158 Benchmark]: Witness Printer took 117.58ms. Allocated memory is still 570.4MB. Free memory was 278.8MB in the beginning and 269.3MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 03:27:33,499 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.29ms. Allocated memory is still 142.6MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 690.51ms. Allocated memory is still 226.5MB. Free memory was 191.6MB in the beginning and 168.0MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.55ms. Allocated memory is still 226.5MB. Free memory was 168.0MB in the beginning and 165.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.95ms. Allocated memory is still 226.5MB. Free memory was 165.3MB in the beginning and 163.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 970.88ms. Allocated memory is still 226.5MB. Free memory was 163.2MB in the beginning and 128.9MB in the end (delta: 34.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 25434.83ms. Allocated memory was 226.5MB in the beginning and 570.4MB in the end (delta: 343.9MB). Free memory was 128.1MB in the beginning and 278.8MB in the end (delta: -150.6MB). Peak memory consumption was 194.7MB. Max. memory is 16.1GB. * Witness Printer took 117.58ms. Allocated memory is still 570.4MB. Free memory was 278.8MB in the beginning and 269.3MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4s, 117 PlacesBefore, 32 PlacesAfterwards, 109 TransitionsBefore, 22 TransitionsAfterwards, 1986 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 100 TotalNumberOfCompositions, 4802 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2512, independent: 2349, independent conditional: 0, independent unconditional: 2349, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1492, independent: 1438, independent conditional: 0, independent unconditional: 1438, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1492, independent: 1426, independent conditional: 0, independent unconditional: 1426, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 486, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 446, dependent conditional: 0, dependent unconditional: 446, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2512, independent: 911, independent conditional: 0, independent unconditional: 911, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 1492, unknown conditional: 0, unknown unconditional: 1492] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 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; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2177, ((void *)0), P0, ((void *)0))=-1, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2178, ((void *)0), P1, ((void *)0))=0, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2179; [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2179, ((void *)0), P2, ((void *)0))=1, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=66, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$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: 818]: 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: 814]: 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: 816]: 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, 138 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: 25.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 610 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 503 mSDsluCounter, 160 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1222 IncrementalHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 64 mSDtfsCounter, 1222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=951occurred in iteration=10, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 2394 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-23 03:27:33,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_27f79bd5-e2d0-4a84-8ee8-f2aa0f4dcb9f/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE