./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8 --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 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf --- 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-e04fb08 [2022-11-16 12:32:46,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:32:46,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:32:46,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:32:46,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:32:46,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:32:46,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:32:46,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:32:46,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:32:46,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:32:46,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:32:46,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:32:46,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:32:46,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:32:46,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:32:46,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:32:46,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:32:46,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:32:46,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:32:46,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:32:46,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:32:46,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:32:46,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:32:46,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:32:46,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:32:46,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:32:46,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:32:46,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:32:46,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:32:46,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:32:46,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:32:46,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:32:46,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:32:46,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:32:46,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:32:46,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:32:46,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:32:46,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:32:46,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:32:46,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:32:46,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:32:46,923 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:32:46,962 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:32:46,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:32:46,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:32:46,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:32:46,964 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:32:46,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:32:46,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:32:46,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:32:46,965 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:32:46,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:32:46,967 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:32:46,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:32:46,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:32:46,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:32:46,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:32:46,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:32:46,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:32:46,968 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:32:46,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:32:46,969 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:32:46,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:32:46,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:32:46,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:32:46,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:32:46,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:32:46,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:32:46,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:32:46,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:32:46,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:32:46,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:32:46,971 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:32:46,971 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:32:46,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:32:46,972 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8/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_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8 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 -> 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf [2022-11-16 12:32:47,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:32:47,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:32:47,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:32:47,264 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:32:47,265 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:32:47,266 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:32:47,344 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8/data/e57d14a51/5cd8feb18ace497cb1dfd9af20a1e442/FLAG5ae29fa3b [2022-11-16 12:32:47,829 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:32:47,830 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81f7aff0-98e9-482e-80c8-715c3499d00e/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:32:47,849 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8/data/e57d14a51/5cd8feb18ace497cb1dfd9af20a1e442/FLAG5ae29fa3b [2022-11-16 12:32:48,147 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8/data/e57d14a51/5cd8feb18ace497cb1dfd9af20a1e442 [2022-11-16 12:32:48,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:32:48,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:32:48,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:32:48,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:32:48,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:32:48,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:32:48" (1/1) ... [2022-11-16 12:32:48,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c95fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:48, skipping insertion in model container [2022-11-16 12:32:48,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:32:48" (1/1) ... [2022-11-16 12:32:48,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:32:48,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:32:48,438 WARN L229 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_81f7aff0-98e9-482e-80c8-715c3499d00e/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-11-16 12:32:48,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:32:48,715 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:32:48,729 WARN L229 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_81f7aff0-98e9-482e-80c8-715c3499d00e/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-11-16 12:32:48,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:32:48,875 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:32:48,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:48 WrapperNode [2022-11-16 12:32:48,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:32:48,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:32:48,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:32:48,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:32:48,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:48" (1/1) ... [2022-11-16 12:32:48,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:48" (1/1) ... [2022-11-16 12:32:48,953 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-16 12:32:48,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:32:48,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:32:48,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:32:48,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:32:48,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:48" (1/1) ... [2022-11-16 12:32:48,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:48" (1/1) ... [2022-11-16 12:32:48,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:48" (1/1) ... [2022-11-16 12:32:48,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:48" (1/1) ... [2022-11-16 12:32:48,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:48" (1/1) ... [2022-11-16 12:32:48,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:48" (1/1) ... [2022-11-16 12:32:48,998 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:48" (1/1) ... [2022-11-16 12:32:49,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:48" (1/1) ... [2022-11-16 12:32:49,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:32:49,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:32:49,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:32:49,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:32:49,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:48" (1/1) ... [2022-11-16 12:32:49,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:32:49,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:32:49,076 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:32:49,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:32:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:32:49,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:32:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:32:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:32:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:32:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 12:32:49,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 12:32:49,120 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 12:32:49,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 12:32:49,121 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 12:32:49,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 12:32:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:32:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:32:49,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:32:49,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:32:49,124 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:32:49,339 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:32:49,341 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:32:49,861 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:32:50,129 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:32:50,130 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:32:50,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:50 BoogieIcfgContainer [2022-11-16 12:32:50,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:32:50,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:32:50,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:32:50,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:32:50,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:32:48" (1/3) ... [2022-11-16 12:32:50,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df2f3f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:32:50, skipping insertion in model container [2022-11-16 12:32:50,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:48" (2/3) ... [2022-11-16 12:32:50,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df2f3f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:32:50, skipping insertion in model container [2022-11-16 12:32:50,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:50" (3/3) ... [2022-11-16 12:32:50,143 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:32:50,152 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:32:50,163 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:32:50,163 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 12:32:50,163 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:32:50,252 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:32:50,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-11-16 12:32:50,391 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-16 12:32:50,391 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:32:50,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-16 12:32:50,398 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-11-16 12:32:50,402 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-11-16 12:32:50,418 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:32:50,425 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;@6dcc6b92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:32:50,431 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 12:32:50,441 INFO L130 PetriNetUnfolder]: 0/46 cut-off events. [2022-11-16 12:32:50,443 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:32:50,444 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:32:50,445 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:50,446 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-16 12:32:50,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:50,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1849045882, now seen corresponding path program 1 times [2022-11-16 12:32:50,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:50,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556408832] [2022-11-16 12:32:50,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:50,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:51,084 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-16 12:32:51,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:51,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556408832] [2022-11-16 12:32:51,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556408832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:51,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:51,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:32:51,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247161138] [2022-11-16 12:32:51,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:51,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:32:51,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:51,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:32:51,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:32:51,128 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 115 [2022-11-16 12:32:51,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-16 12:32:51,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:32:51,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 115 [2022-11-16 12:32:51,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:32:51,435 INFO L130 PetriNetUnfolder]: 124/550 cut-off events. [2022-11-16 12:32:51,436 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-16 12:32:51,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 550 events. 124/550 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2941 event pairs, 24 based on Foata normal form. 23/542 useless extension candidates. Maximal degree in co-relation 729. Up to 155 conditions per place. [2022-11-16 12:32:51,446 INFO L137 encePairwiseOnDemand]: 110/115 looper letters, 18 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2022-11-16 12:32:51,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 116 transitions, 287 flow [2022-11-16 12:32:51,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:32:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:32:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2022-11-16 12:32:51,469 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2022-11-16 12:32:51,470 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2022-11-16 12:32:51,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2022-11-16 12:32:51,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:32:51,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2022-11-16 12:32:51,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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-16 12:32:51,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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-16 12:32:51,493 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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-16 12:32:51,494 INFO L175 Difference]: Start difference. First operand has 120 places, 112 transitions, 233 flow. Second operand 3 states and 322 transitions. [2022-11-16 12:32:51,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 116 transitions, 287 flow [2022-11-16 12:32:51,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 116 transitions, 282 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 12:32:51,506 INFO L231 Difference]: Finished difference. Result has 117 places, 108 transitions, 226 flow [2022-11-16 12:32:51,509 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2022-11-16 12:32:51,515 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2022-11-16 12:32:51,516 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 226 flow [2022-11-16 12:32:51,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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-16 12:32:51,517 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:32:51,517 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:51,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:32:51,518 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-16 12:32:51,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:51,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1744232137, now seen corresponding path program 1 times [2022-11-16 12:32:51,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:51,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973863916] [2022-11-16 12:32:51,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:51,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:52,948 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-16 12:32:52,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:52,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973863916] [2022-11-16 12:32:52,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973863916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:52,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:52,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:32:52,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231096019] [2022-11-16 12:32:52,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:52,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:32:52,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:52,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:32:52,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:32:52,954 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 115 [2022-11-16 12:32:52,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 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-16 12:32:52,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:32:52,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 115 [2022-11-16 12:32:52,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:32:54,091 INFO L130 PetriNetUnfolder]: 1114/2953 cut-off events. [2022-11-16 12:32:54,092 INFO L131 PetriNetUnfolder]: For 190/190 co-relation queries the response was YES. [2022-11-16 12:32:54,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4870 conditions, 2953 events. 1114/2953 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 22793 event pairs, 408 based on Foata normal form. 0/2856 useless extension candidates. Maximal degree in co-relation 4809. Up to 901 conditions per place. [2022-11-16 12:32:54,108 INFO L137 encePairwiseOnDemand]: 108/115 looper letters, 32 selfloop transitions, 3 changer transitions 60/163 dead transitions. [2022-11-16 12:32:54,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 163 transitions, 520 flow [2022-11-16 12:32:54,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:32:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 12:32:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 906 transitions. [2022-11-16 12:32:54,111 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7878260869565218 [2022-11-16 12:32:54,112 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 906 transitions. [2022-11-16 12:32:54,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 906 transitions. [2022-11-16 12:32:54,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:32:54,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 906 transitions. [2022-11-16 12:32:54,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 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-16 12:32:54,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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-16 12:32:54,119 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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-16 12:32:54,119 INFO L175 Difference]: Start difference. First operand has 117 places, 108 transitions, 226 flow. Second operand 10 states and 906 transitions. [2022-11-16 12:32:54,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 163 transitions, 520 flow [2022-11-16 12:32:54,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 163 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:32:54,123 INFO L231 Difference]: Finished difference. Result has 131 places, 96 transitions, 220 flow [2022-11-16 12:32:54,124 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=220, PETRI_PLACES=131, PETRI_TRANSITIONS=96} [2022-11-16 12:32:54,125 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 11 predicate places. [2022-11-16 12:32:54,125 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 96 transitions, 220 flow [2022-11-16 12:32:54,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 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-16 12:32:54,125 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:32:54,126 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:54,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:32:54,126 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-16 12:32:54,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:54,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1429018902, now seen corresponding path program 1 times [2022-11-16 12:32:54,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:54,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849938576] [2022-11-16 12:32:54,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:54,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:54,477 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-16 12:32:54,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:54,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849938576] [2022-11-16 12:32:54,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849938576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:54,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:54,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:32:54,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689962327] [2022-11-16 12:32:54,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:54,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:32:54,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:54,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:32:54,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:32:54,481 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 115 [2022-11-16 12:32:54,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 96 transitions, 220 flow. Second operand has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 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-16 12:32:54,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:32:54,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 115 [2022-11-16 12:32:54,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:32:55,172 INFO L130 PetriNetUnfolder]: 621/1328 cut-off events. [2022-11-16 12:32:55,173 INFO L131 PetriNetUnfolder]: For 323/323 co-relation queries the response was YES. [2022-11-16 12:32:55,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2706 conditions, 1328 events. 621/1328 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7881 event pairs, 205 based on Foata normal form. 32/1293 useless extension candidates. Maximal degree in co-relation 2645. Up to 319 conditions per place. [2022-11-16 12:32:55,181 INFO L137 encePairwiseOnDemand]: 107/115 looper letters, 28 selfloop transitions, 4 changer transitions 44/152 dead transitions. [2022-11-16 12:32:55,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 152 transitions, 513 flow [2022-11-16 12:32:55,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:32:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 12:32:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 978 transitions. [2022-11-16 12:32:55,184 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8504347826086956 [2022-11-16 12:32:55,185 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 978 transitions. [2022-11-16 12:32:55,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 978 transitions. [2022-11-16 12:32:55,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:32:55,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 978 transitions. [2022-11-16 12:32:55,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.8) internal successors, (978), 10 states have internal predecessors, (978), 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-16 12:32:55,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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-16 12:32:55,191 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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-16 12:32:55,191 INFO L175 Difference]: Start difference. First operand has 131 places, 96 transitions, 220 flow. Second operand 10 states and 978 transitions. [2022-11-16 12:32:55,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 152 transitions, 513 flow [2022-11-16 12:32:55,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 152 transitions, 477 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-11-16 12:32:55,202 INFO L231 Difference]: Finished difference. Result has 121 places, 96 transitions, 232 flow [2022-11-16 12:32:55,203 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=232, PETRI_PLACES=121, PETRI_TRANSITIONS=96} [2022-11-16 12:32:55,203 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 1 predicate places. [2022-11-16 12:32:55,203 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 96 transitions, 232 flow [2022-11-16 12:32:55,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 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-16 12:32:55,204 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:32:55,204 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:55,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:32:55,205 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-16 12:32:55,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:55,205 INFO L85 PathProgramCache]: Analyzing trace with hash -441615774, now seen corresponding path program 1 times [2022-11-16 12:32:55,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:55,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277939612] [2022-11-16 12:32:55,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:55,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:56,163 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-16 12:32:56,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:56,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277939612] [2022-11-16 12:32:56,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277939612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:56,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:56,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:32:56,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300861235] [2022-11-16 12:32:56,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:56,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:32:56,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:56,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:32:56,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:32:56,167 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 115 [2022-11-16 12:32:56,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 96 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 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-16 12:32:56,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:32:56,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 115 [2022-11-16 12:32:56,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:32:56,713 INFO L130 PetriNetUnfolder]: 392/902 cut-off events. [2022-11-16 12:32:56,714 INFO L131 PetriNetUnfolder]: For 371/371 co-relation queries the response was YES. [2022-11-16 12:32:56,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1890 conditions, 902 events. 392/902 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4519 event pairs, 97 based on Foata normal form. 24/893 useless extension candidates. Maximal degree in co-relation 1818. Up to 259 conditions per place. [2022-11-16 12:32:56,720 INFO L137 encePairwiseOnDemand]: 109/115 looper letters, 32 selfloop transitions, 2 changer transitions 34/136 dead transitions. [2022-11-16 12:32:56,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 136 transitions, 474 flow [2022-11-16 12:32:56,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:32:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:32:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 808 transitions. [2022-11-16 12:32:56,723 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7806763285024154 [2022-11-16 12:32:56,723 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 808 transitions. [2022-11-16 12:32:56,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 808 transitions. [2022-11-16 12:32:56,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:32:56,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 808 transitions. [2022-11-16 12:32:56,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 89.77777777777777) internal successors, (808), 9 states have internal predecessors, (808), 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-16 12:32:56,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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-16 12:32:56,728 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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-16 12:32:56,728 INFO L175 Difference]: Start difference. First operand has 121 places, 96 transitions, 232 flow. Second operand 9 states and 808 transitions. [2022-11-16 12:32:56,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 136 transitions, 474 flow [2022-11-16 12:32:56,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 136 transitions, 426 flow, removed 18 selfloop flow, removed 10 redundant places. [2022-11-16 12:32:56,734 INFO L231 Difference]: Finished difference. Result has 120 places, 96 transitions, 226 flow [2022-11-16 12:32:56,734 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=226, PETRI_PLACES=120, PETRI_TRANSITIONS=96} [2022-11-16 12:32:56,735 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2022-11-16 12:32:56,735 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 96 transitions, 226 flow [2022-11-16 12:32:56,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 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-16 12:32:56,735 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:32:56,735 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:56,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:32:56,736 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-16 12:32:56,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:56,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1993856565, now seen corresponding path program 1 times [2022-11-16 12:32:56,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:56,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585374638] [2022-11-16 12:32:56,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:56,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:57,385 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-16 12:32:57,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:57,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585374638] [2022-11-16 12:32:57,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585374638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:57,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:57,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:32:57,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327180686] [2022-11-16 12:32:57,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:57,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:32:57,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:57,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:32:57,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:32:57,390 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2022-11-16 12:32:57,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 96 transitions, 226 flow. Second operand has 9 states, 9 states have (on average 90.88888888888889) internal successors, (818), 9 states have internal predecessors, (818), 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-16 12:32:57,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:32:57,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2022-11-16 12:32:57,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:32:57,874 INFO L130 PetriNetUnfolder]: 319/799 cut-off events. [2022-11-16 12:32:57,874 INFO L131 PetriNetUnfolder]: For 190/190 co-relation queries the response was YES. [2022-11-16 12:32:57,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 799 events. 319/799 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4019 event pairs, 74 based on Foata normal form. 12/766 useless extension candidates. Maximal degree in co-relation 1537. Up to 260 conditions per place. [2022-11-16 12:32:57,880 INFO L137 encePairwiseOnDemand]: 104/115 looper letters, 23 selfloop transitions, 10 changer transitions 23/131 dead transitions. [2022-11-16 12:32:57,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 131 transitions, 436 flow [2022-11-16 12:32:57,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:32:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 12:32:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 947 transitions. [2022-11-16 12:32:57,883 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8234782608695652 [2022-11-16 12:32:57,884 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 947 transitions. [2022-11-16 12:32:57,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 947 transitions. [2022-11-16 12:32:57,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:32:57,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 947 transitions. [2022-11-16 12:32:57,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.7) internal successors, (947), 10 states have internal predecessors, (947), 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-16 12:32:57,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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-16 12:32:57,892 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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-16 12:32:57,892 INFO L175 Difference]: Start difference. First operand has 120 places, 96 transitions, 226 flow. Second operand 10 states and 947 transitions. [2022-11-16 12:32:57,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 131 transitions, 436 flow [2022-11-16 12:32:57,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 131 transitions, 404 flow, removed 10 selfloop flow, removed 8 redundant places. [2022-11-16 12:32:57,898 INFO L231 Difference]: Finished difference. Result has 120 places, 100 transitions, 256 flow [2022-11-16 12:32:57,898 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=256, PETRI_PLACES=120, PETRI_TRANSITIONS=100} [2022-11-16 12:32:57,902 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2022-11-16 12:32:57,902 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 100 transitions, 256 flow [2022-11-16 12:32:57,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.88888888888889) internal successors, (818), 9 states have internal predecessors, (818), 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-16 12:32:57,903 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:32:57,903 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:57,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:32:57,904 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-16 12:32:57,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:57,906 INFO L85 PathProgramCache]: Analyzing trace with hash 928812905, now seen corresponding path program 2 times [2022-11-16 12:32:57,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:57,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475397554] [2022-11-16 12:32:57,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:57,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:59,918 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-16 12:32:59,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:59,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475397554] [2022-11-16 12:32:59,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475397554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:59,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:59,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 12:32:59,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244454875] [2022-11-16 12:32:59,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:59,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:32:59,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:59,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:32:59,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:32:59,925 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 115 [2022-11-16 12:32:59,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 100 transitions, 256 flow. Second operand has 12 states, 12 states have (on average 84.0) internal successors, (1008), 12 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:32:59,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:32:59,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 115 [2022-11-16 12:32:59,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:33:01,192 INFO L130 PetriNetUnfolder]: 317/758 cut-off events. [2022-11-16 12:33:01,193 INFO L131 PetriNetUnfolder]: For 161/161 co-relation queries the response was YES. [2022-11-16 12:33:01,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 758 events. 317/758 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3379 event pairs, 72 based on Foata normal form. 17/744 useless extension candidates. Maximal degree in co-relation 1469. Up to 304 conditions per place. [2022-11-16 12:33:01,198 INFO L137 encePairwiseOnDemand]: 96/115 looper letters, 30 selfloop transitions, 39 changer transitions 32/169 dead transitions. [2022-11-16 12:33:01,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 169 transitions, 651 flow [2022-11-16 12:33:01,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 12:33:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-16 12:33:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1824 transitions. [2022-11-16 12:33:01,204 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7552795031055901 [2022-11-16 12:33:01,204 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1824 transitions. [2022-11-16 12:33:01,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1824 transitions. [2022-11-16 12:33:01,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:33:01,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1824 transitions. [2022-11-16 12:33:01,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 86.85714285714286) internal successors, (1824), 21 states have internal predecessors, (1824), 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-16 12:33:01,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 115.0) internal successors, (2530), 22 states have internal predecessors, (2530), 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-16 12:33:01,218 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 115.0) internal successors, (2530), 22 states have internal predecessors, (2530), 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-16 12:33:01,218 INFO L175 Difference]: Start difference. First operand has 120 places, 100 transitions, 256 flow. Second operand 21 states and 1824 transitions. [2022-11-16 12:33:01,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 169 transitions, 651 flow [2022-11-16 12:33:01,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 169 transitions, 616 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-11-16 12:33:01,225 INFO L231 Difference]: Finished difference. Result has 141 places, 127 transitions, 455 flow [2022-11-16 12:33:01,225 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=455, PETRI_PLACES=141, PETRI_TRANSITIONS=127} [2022-11-16 12:33:01,228 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 21 predicate places. [2022-11-16 12:33:01,228 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 127 transitions, 455 flow [2022-11-16 12:33:01,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 84.0) internal successors, (1008), 12 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:33:01,229 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:33:01,229 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:33:01,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:33:01,229 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-16 12:33:01,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:01,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1407953911, now seen corresponding path program 3 times [2022-11-16 12:33:01,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:01,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355645463] [2022-11-16 12:33:01,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:01,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:02,725 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-16 12:33:02,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:02,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355645463] [2022-11-16 12:33:02,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355645463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:33:02,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:33:02,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 12:33:02,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137571601] [2022-11-16 12:33:02,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:33:02,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 12:33:02,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:33:02,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 12:33:02,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:33:02,729 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 115 [2022-11-16 12:33:02,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 127 transitions, 455 flow. Second operand has 13 states, 13 states have (on average 82.0) internal successors, (1066), 13 states have internal predecessors, (1066), 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-16 12:33:02,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:33:02,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 115 [2022-11-16 12:33:02,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:33:03,494 INFO L130 PetriNetUnfolder]: 353/879 cut-off events. [2022-11-16 12:33:03,494 INFO L131 PetriNetUnfolder]: For 2071/2987 co-relation queries the response was YES. [2022-11-16 12:33:03,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2841 conditions, 879 events. 353/879 cut-off events. For 2071/2987 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4712 event pairs, 40 based on Foata normal form. 34/885 useless extension candidates. Maximal degree in co-relation 2754. Up to 290 conditions per place. [2022-11-16 12:33:03,502 INFO L137 encePairwiseOnDemand]: 98/115 looper letters, 40 selfloop transitions, 17 changer transitions 45/168 dead transitions. [2022-11-16 12:33:03,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 168 transitions, 909 flow [2022-11-16 12:33:03,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:33:03,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-16 12:33:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1270 transitions. [2022-11-16 12:33:03,507 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.736231884057971 [2022-11-16 12:33:03,507 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1270 transitions. [2022-11-16 12:33:03,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1270 transitions. [2022-11-16 12:33:03,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:33:03,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1270 transitions. [2022-11-16 12:33:03,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 84.66666666666667) internal successors, (1270), 15 states have internal predecessors, (1270), 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-16 12:33:03,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 115.0) internal successors, (1840), 16 states have internal predecessors, (1840), 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-16 12:33:03,515 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 115.0) internal successors, (1840), 16 states have internal predecessors, (1840), 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-16 12:33:03,515 INFO L175 Difference]: Start difference. First operand has 141 places, 127 transitions, 455 flow. Second operand 15 states and 1270 transitions. [2022-11-16 12:33:03,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 168 transitions, 909 flow [2022-11-16 12:33:03,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 168 transitions, 866 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-11-16 12:33:03,526 INFO L231 Difference]: Finished difference. Result has 145 places, 113 transitions, 406 flow [2022-11-16 12:33:03,526 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=406, PETRI_PLACES=145, PETRI_TRANSITIONS=113} [2022-11-16 12:33:03,527 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 25 predicate places. [2022-11-16 12:33:03,527 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 113 transitions, 406 flow [2022-11-16 12:33:03,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 82.0) internal successors, (1066), 13 states have internal predecessors, (1066), 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-16 12:33:03,528 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:33:03,528 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:33:03,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:33:03,529 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-16 12:33:03,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:03,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1267980084, now seen corresponding path program 1 times [2022-11-16 12:33:03,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:03,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763704963] [2022-11-16 12:33:03,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:03,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:04,209 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-16 12:33:04,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:04,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763704963] [2022-11-16 12:33:04,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763704963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:33:04,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:33:04,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:33:04,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823686899] [2022-11-16 12:33:04,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:33:04,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:33:04,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:33:04,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:33:04,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:33:04,213 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 115 [2022-11-16 12:33:04,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 113 transitions, 406 flow. Second operand has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 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-16 12:33:04,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:33:04,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 115 [2022-11-16 12:33:04,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:33:04,814 INFO L130 PetriNetUnfolder]: 217/610 cut-off events. [2022-11-16 12:33:04,814 INFO L131 PetriNetUnfolder]: For 1654/1814 co-relation queries the response was YES. [2022-11-16 12:33:04,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 610 events. 217/610 cut-off events. For 1654/1814 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2739 event pairs, 61 based on Foata normal form. 21/609 useless extension candidates. Maximal degree in co-relation 1971. Up to 242 conditions per place. [2022-11-16 12:33:04,821 INFO L137 encePairwiseOnDemand]: 104/115 looper letters, 33 selfloop transitions, 14 changer transitions 45/166 dead transitions. [2022-11-16 12:33:04,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 166 transitions, 949 flow [2022-11-16 12:33:04,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:33:04,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-16 12:33:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1129 transitions. [2022-11-16 12:33:04,826 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8181159420289855 [2022-11-16 12:33:04,826 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1129 transitions. [2022-11-16 12:33:04,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1129 transitions. [2022-11-16 12:33:04,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:33:04,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1129 transitions. [2022-11-16 12:33:04,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 94.08333333333333) internal successors, (1129), 12 states have internal predecessors, (1129), 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-16 12:33:04,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 115.0) internal successors, (1495), 13 states have internal predecessors, (1495), 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-16 12:33:04,835 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 115.0) internal successors, (1495), 13 states have internal predecessors, (1495), 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-16 12:33:04,835 INFO L175 Difference]: Start difference. First operand has 145 places, 113 transitions, 406 flow. Second operand 12 states and 1129 transitions. [2022-11-16 12:33:04,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 166 transitions, 949 flow [2022-11-16 12:33:04,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 166 transitions, 851 flow, removed 31 selfloop flow, removed 16 redundant places. [2022-11-16 12:33:04,844 INFO L231 Difference]: Finished difference. Result has 144 places, 117 transitions, 471 flow [2022-11-16 12:33:04,845 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=471, PETRI_PLACES=144, PETRI_TRANSITIONS=117} [2022-11-16 12:33:04,847 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 24 predicate places. [2022-11-16 12:33:04,848 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 117 transitions, 471 flow [2022-11-16 12:33:04,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 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-16 12:33:04,848 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:33:04,849 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:33:04,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:33:04,849 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-16 12:33:04,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:04,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1286439398, now seen corresponding path program 2 times [2022-11-16 12:33:04,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:04,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736189444] [2022-11-16 12:33:04,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:04,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:33:05,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:05,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736189444] [2022-11-16 12:33:05,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736189444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:33:05,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:33:05,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:33:05,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637859037] [2022-11-16 12:33:05,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:33:05,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:33:05,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:33:05,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:33:05,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:33:05,904 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 115 [2022-11-16 12:33:05,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 117 transitions, 471 flow. Second operand has 11 states, 11 states have (on average 86.0909090909091) internal successors, (947), 11 states have internal predecessors, (947), 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-16 12:33:05,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:33:05,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 115 [2022-11-16 12:33:05,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:33:06,648 INFO L130 PetriNetUnfolder]: 213/595 cut-off events. [2022-11-16 12:33:06,649 INFO L131 PetriNetUnfolder]: For 3256/3626 co-relation queries the response was YES. [2022-11-16 12:33:06,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 595 events. 213/595 cut-off events. For 3256/3626 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2731 event pairs, 51 based on Foata normal form. 30/618 useless extension candidates. Maximal degree in co-relation 2422. Up to 194 conditions per place. [2022-11-16 12:33:06,655 INFO L137 encePairwiseOnDemand]: 104/115 looper letters, 54 selfloop transitions, 17 changer transitions 31/172 dead transitions. [2022-11-16 12:33:06,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 172 transitions, 1209 flow [2022-11-16 12:33:06,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:33:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-16 12:33:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1260 transitions. [2022-11-16 12:33:06,660 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2022-11-16 12:33:06,661 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1260 transitions. [2022-11-16 12:33:06,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1260 transitions. [2022-11-16 12:33:06,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:33:06,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1260 transitions. [2022-11-16 12:33:06,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.0) internal successors, (1260), 14 states have internal predecessors, (1260), 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-16 12:33:06,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 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-16 12:33:06,671 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 115.0) internal successors, (1725), 15 states have internal predecessors, (1725), 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-16 12:33:06,671 INFO L175 Difference]: Start difference. First operand has 144 places, 117 transitions, 471 flow. Second operand 14 states and 1260 transitions. [2022-11-16 12:33:06,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 172 transitions, 1209 flow [2022-11-16 12:33:06,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 172 transitions, 1069 flow, removed 70 selfloop flow, removed 7 redundant places. [2022-11-16 12:33:06,681 INFO L231 Difference]: Finished difference. Result has 151 places, 120 transitions, 544 flow [2022-11-16 12:33:06,682 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=544, PETRI_PLACES=151, PETRI_TRANSITIONS=120} [2022-11-16 12:33:06,683 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 31 predicate places. [2022-11-16 12:33:06,683 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 120 transitions, 544 flow [2022-11-16 12:33:06,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 86.0909090909091) internal successors, (947), 11 states have internal predecessors, (947), 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-16 12:33:06,684 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:33:06,684 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:33:06,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:33:06,684 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-16 12:33:06,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash 696341420, now seen corresponding path program 1 times [2022-11-16 12:33:06,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:06,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171775722] [2022-11-16 12:33:06,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:06,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:07,929 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-16 12:33:07,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:07,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171775722] [2022-11-16 12:33:07,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171775722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:33:07,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:33:07,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:33:07,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154686189] [2022-11-16 12:33:07,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:33:07,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:33:07,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:33:07,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:33:07,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:33:07,933 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 115 [2022-11-16 12:33:07,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 120 transitions, 544 flow. Second operand has 10 states, 10 states have (on average 87.2) internal successors, (872), 10 states have internal predecessors, (872), 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-16 12:33:07,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:33:07,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 115 [2022-11-16 12:33:07,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:33:08,922 INFO L130 PetriNetUnfolder]: 261/710 cut-off events. [2022-11-16 12:33:08,923 INFO L131 PetriNetUnfolder]: For 3757/4689 co-relation queries the response was YES. [2022-11-16 12:33:08,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3074 conditions, 710 events. 261/710 cut-off events. For 3757/4689 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3467 event pairs, 29 based on Foata normal form. 23/705 useless extension candidates. Maximal degree in co-relation 2987. Up to 244 conditions per place. [2022-11-16 12:33:08,931 INFO L137 encePairwiseOnDemand]: 102/115 looper letters, 45 selfloop transitions, 23 changer transitions 49/188 dead transitions. [2022-11-16 12:33:08,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 188 transitions, 1461 flow [2022-11-16 12:33:08,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:33:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-16 12:33:08,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1093 transitions. [2022-11-16 12:33:08,934 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7920289855072464 [2022-11-16 12:33:08,935 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1093 transitions. [2022-11-16 12:33:08,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1093 transitions. [2022-11-16 12:33:08,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:33:08,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1093 transitions. [2022-11-16 12:33:08,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 91.08333333333333) internal successors, (1093), 12 states have internal predecessors, (1093), 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-16 12:33:08,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 115.0) internal successors, (1495), 13 states have internal predecessors, (1495), 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-16 12:33:08,941 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 115.0) internal successors, (1495), 13 states have internal predecessors, (1495), 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-16 12:33:08,941 INFO L175 Difference]: Start difference. First operand has 151 places, 120 transitions, 544 flow. Second operand 12 states and 1093 transitions. [2022-11-16 12:33:08,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 188 transitions, 1461 flow [2022-11-16 12:33:08,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 188 transitions, 1390 flow, removed 34 selfloop flow, removed 11 redundant places. [2022-11-16 12:33:08,955 INFO L231 Difference]: Finished difference. Result has 151 places, 131 transitions, 794 flow [2022-11-16 12:33:08,955 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=794, PETRI_PLACES=151, PETRI_TRANSITIONS=131} [2022-11-16 12:33:08,956 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 31 predicate places. [2022-11-16 12:33:08,956 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 131 transitions, 794 flow [2022-11-16 12:33:08,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.2) internal successors, (872), 10 states have internal predecessors, (872), 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-16 12:33:08,957 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:33:08,957 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:33:08,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:33:08,957 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-16 12:33:08,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:08,958 INFO L85 PathProgramCache]: Analyzing trace with hash 916641874, now seen corresponding path program 3 times [2022-11-16 12:33:08,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:08,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550062534] [2022-11-16 12:33:08,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:08,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:10,321 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-16 12:33:10,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:10,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550062534] [2022-11-16 12:33:10,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550062534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:33:10,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:33:10,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 12:33:10,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84733599] [2022-11-16 12:33:10,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:33:10,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 12:33:10,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:33:10,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 12:33:10,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:33:10,325 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 115 [2022-11-16 12:33:10,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 131 transitions, 794 flow. Second operand has 13 states, 13 states have (on average 86.6923076923077) internal successors, (1127), 13 states have internal predecessors, (1127), 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-16 12:33:10,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:33:10,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 115 [2022-11-16 12:33:10,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:33:10,976 INFO L130 PetriNetUnfolder]: 209/641 cut-off events. [2022-11-16 12:33:10,976 INFO L131 PetriNetUnfolder]: For 5319/6237 co-relation queries the response was YES. [2022-11-16 12:33:10,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 641 events. 209/641 cut-off events. For 5319/6237 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3191 event pairs, 19 based on Foata normal form. 26/640 useless extension candidates. Maximal degree in co-relation 3210. Up to 233 conditions per place. [2022-11-16 12:33:10,984 INFO L137 encePairwiseOnDemand]: 101/115 looper letters, 48 selfloop transitions, 15 changer transitions 52/186 dead transitions. [2022-11-16 12:33:10,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 186 transitions, 1837 flow [2022-11-16 12:33:10,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:33:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 12:33:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1165 transitions. [2022-11-16 12:33:10,987 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7792642140468228 [2022-11-16 12:33:10,987 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1165 transitions. [2022-11-16 12:33:10,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1165 transitions. [2022-11-16 12:33:10,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:33:10,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1165 transitions. [2022-11-16 12:33:10,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 89.61538461538461) internal successors, (1165), 13 states have internal predecessors, (1165), 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-16 12:33:10,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 115.0) internal successors, (1610), 14 states have internal predecessors, (1610), 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-16 12:33:10,996 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 115.0) internal successors, (1610), 14 states have internal predecessors, (1610), 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-16 12:33:10,996 INFO L175 Difference]: Start difference. First operand has 151 places, 131 transitions, 794 flow. Second operand 13 states and 1165 transitions. [2022-11-16 12:33:10,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 186 transitions, 1837 flow [2022-11-16 12:33:11,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 186 transitions, 1745 flow, removed 43 selfloop flow, removed 7 redundant places. [2022-11-16 12:33:11,014 INFO L231 Difference]: Finished difference. Result has 154 places, 124 transitions, 716 flow [2022-11-16 12:33:11,014 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=716, PETRI_PLACES=154, PETRI_TRANSITIONS=124} [2022-11-16 12:33:11,015 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 34 predicate places. [2022-11-16 12:33:11,015 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 124 transitions, 716 flow [2022-11-16 12:33:11,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 86.6923076923077) internal successors, (1127), 13 states have internal predecessors, (1127), 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-16 12:33:11,016 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:33:11,016 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:33:11,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:33:11,016 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-16 12:33:11,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:11,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2038635770, now seen corresponding path program 1 times [2022-11-16 12:33:11,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:11,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389755969] [2022-11-16 12:33:11,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:11,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:13,168 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-16 12:33:13,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:13,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389755969] [2022-11-16 12:33:13,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389755969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:33:13,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:33:13,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-16 12:33:13,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229627700] [2022-11-16 12:33:13,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:33:13,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:33:13,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:33:13,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:33:13,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:33:13,171 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 115 [2022-11-16 12:33:13,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 124 transitions, 716 flow. Second operand has 15 states, 15 states have (on average 83.73333333333333) internal successors, (1256), 15 states have internal predecessors, (1256), 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-16 12:33:13,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:33:13,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 115 [2022-11-16 12:33:13,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:33:14,102 INFO L130 PetriNetUnfolder]: 135/476 cut-off events. [2022-11-16 12:33:14,102 INFO L131 PetriNetUnfolder]: For 3234/3672 co-relation queries the response was YES. [2022-11-16 12:33:14,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2222 conditions, 476 events. 135/476 cut-off events. For 3234/3672 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2333 event pairs, 13 based on Foata normal form. 29/496 useless extension candidates. Maximal degree in co-relation 2136. Up to 152 conditions per place. [2022-11-16 12:33:14,107 INFO L137 encePairwiseOnDemand]: 102/115 looper letters, 36 selfloop transitions, 16 changer transitions 51/171 dead transitions. [2022-11-16 12:33:14,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 171 transitions, 1517 flow [2022-11-16 12:33:14,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 12:33:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-16 12:33:14,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1556 transitions. [2022-11-16 12:33:14,112 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7516908212560387 [2022-11-16 12:33:14,112 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1556 transitions. [2022-11-16 12:33:14,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1556 transitions. [2022-11-16 12:33:14,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:33:14,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1556 transitions. [2022-11-16 12:33:14,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 86.44444444444444) internal successors, (1556), 18 states have internal predecessors, (1556), 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-16 12:33:14,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 115.0) internal successors, (2185), 19 states have internal predecessors, (2185), 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-16 12:33:14,136 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 115.0) internal successors, (2185), 19 states have internal predecessors, (2185), 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-16 12:33:14,136 INFO L175 Difference]: Start difference. First operand has 154 places, 124 transitions, 716 flow. Second operand 18 states and 1556 transitions. [2022-11-16 12:33:14,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 171 transitions, 1517 flow [2022-11-16 12:33:14,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 171 transitions, 1377 flow, removed 34 selfloop flow, removed 15 redundant places. [2022-11-16 12:33:14,150 INFO L231 Difference]: Finished difference. Result has 163 places, 111 transitions, 548 flow [2022-11-16 12:33:14,151 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=548, PETRI_PLACES=163, PETRI_TRANSITIONS=111} [2022-11-16 12:33:14,151 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 43 predicate places. [2022-11-16 12:33:14,151 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 111 transitions, 548 flow [2022-11-16 12:33:14,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 83.73333333333333) internal successors, (1256), 15 states have internal predecessors, (1256), 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-16 12:33:14,153 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:33:14,153 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:33:14,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:33:14,153 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-16 12:33:14,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:14,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1224068759, now seen corresponding path program 1 times [2022-11-16 12:33:14,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:14,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909409215] [2022-11-16 12:33:14,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:14,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:14,438 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-16 12:33:14,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:14,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909409215] [2022-11-16 12:33:14,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909409215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:33:14,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:33:14,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:33:14,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184089503] [2022-11-16 12:33:14,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:33:14,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:33:14,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:33:14,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:33:14,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:33:14,442 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2022-11-16 12:33:14,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 111 transitions, 548 flow. Second operand has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 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-16 12:33:14,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:33:14,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2022-11-16 12:33:14,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:33:15,114 INFO L130 PetriNetUnfolder]: 829/1700 cut-off events. [2022-11-16 12:33:15,115 INFO L131 PetriNetUnfolder]: For 16174/16174 co-relation queries the response was YES. [2022-11-16 12:33:15,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7273 conditions, 1700 events. 829/1700 cut-off events. For 16174/16174 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9566 event pairs, 24 based on Foata normal form. 0/1666 useless extension candidates. Maximal degree in co-relation 7187. Up to 500 conditions per place. [2022-11-16 12:33:15,131 INFO L137 encePairwiseOnDemand]: 105/115 looper letters, 48 selfloop transitions, 6 changer transitions 80/208 dead transitions. [2022-11-16 12:33:15,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 208 transitions, 1907 flow [2022-11-16 12:33:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:33:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 12:33:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 982 transitions. [2022-11-16 12:33:15,136 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8539130434782609 [2022-11-16 12:33:15,136 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 982 transitions. [2022-11-16 12:33:15,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 982 transitions. [2022-11-16 12:33:15,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:33:15,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 982 transitions. [2022-11-16 12:33:15,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.2) internal successors, (982), 10 states have internal predecessors, (982), 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-16 12:33:15,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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-16 12:33:15,141 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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-16 12:33:15,141 INFO L175 Difference]: Start difference. First operand has 163 places, 111 transitions, 548 flow. Second operand 10 states and 982 transitions. [2022-11-16 12:33:15,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 208 transitions, 1907 flow [2022-11-16 12:33:15,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 208 transitions, 1451 flow, removed 116 selfloop flow, removed 30 redundant places. [2022-11-16 12:33:15,161 INFO L231 Difference]: Finished difference. Result has 136 places, 106 transitions, 418 flow [2022-11-16 12:33:15,161 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=418, PETRI_PLACES=136, PETRI_TRANSITIONS=106} [2022-11-16 12:33:15,162 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 16 predicate places. [2022-11-16 12:33:15,162 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 106 transitions, 418 flow [2022-11-16 12:33:15,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 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-16 12:33:15,163 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:33:15,163 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:33:15,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:33:15,163 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-16 12:33:15,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:15,164 INFO L85 PathProgramCache]: Analyzing trace with hash 38271923, now seen corresponding path program 1 times [2022-11-16 12:33:15,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:15,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540952855] [2022-11-16 12:33:15,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:15,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:15,451 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-16 12:33:15,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:15,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540952855] [2022-11-16 12:33:15,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540952855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:33:15,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:33:15,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:33:15,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314247919] [2022-11-16 12:33:15,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:33:15,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:33:15,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:33:15,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:33:15,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:33:15,455 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2022-11-16 12:33:15,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 106 transitions, 418 flow. Second operand has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 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-16 12:33:15,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:33:15,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2022-11-16 12:33:15,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:33:15,895 INFO L130 PetriNetUnfolder]: 275/755 cut-off events. [2022-11-16 12:33:15,896 INFO L131 PetriNetUnfolder]: For 3455/3463 co-relation queries the response was YES. [2022-11-16 12:33:15,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2952 conditions, 755 events. 275/755 cut-off events. For 3455/3463 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3805 event pairs, 5 based on Foata normal form. 29/782 useless extension candidates. Maximal degree in co-relation 2880. Up to 185 conditions per place. [2022-11-16 12:33:15,901 INFO L137 encePairwiseOnDemand]: 106/115 looper letters, 45 selfloop transitions, 9 changer transitions 48/176 dead transitions. [2022-11-16 12:33:15,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 176 transitions, 1286 flow [2022-11-16 12:33:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:33:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 12:33:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 974 transitions. [2022-11-16 12:33:15,904 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8469565217391304 [2022-11-16 12:33:15,904 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 974 transitions. [2022-11-16 12:33:15,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 974 transitions. [2022-11-16 12:33:15,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:33:15,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 974 transitions. [2022-11-16 12:33:15,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.4) internal successors, (974), 10 states have internal predecessors, (974), 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-16 12:33:15,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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-16 12:33:15,909 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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-16 12:33:15,909 INFO L175 Difference]: Start difference. First operand has 136 places, 106 transitions, 418 flow. Second operand 10 states and 974 transitions. [2022-11-16 12:33:15,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 176 transitions, 1286 flow [2022-11-16 12:33:15,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 176 transitions, 1228 flow, removed 17 selfloop flow, removed 7 redundant places. [2022-11-16 12:33:15,918 INFO L231 Difference]: Finished difference. Result has 138 places, 109 transitions, 464 flow [2022-11-16 12:33:15,918 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=464, PETRI_PLACES=138, PETRI_TRANSITIONS=109} [2022-11-16 12:33:15,919 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 18 predicate places. [2022-11-16 12:33:15,919 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 109 transitions, 464 flow [2022-11-16 12:33:15,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 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-16 12:33:15,919 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:33:15,920 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:33:15,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:33:15,920 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-16 12:33:15,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:15,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1485970706, now seen corresponding path program 1 times [2022-11-16 12:33:15,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:15,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630319681] [2022-11-16 12:33:15,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:15,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:16,251 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-16 12:33:16,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:16,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630319681] [2022-11-16 12:33:16,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630319681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:33:16,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:33:16,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:33:16,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648986293] [2022-11-16 12:33:16,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:33:16,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:33:16,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:33:16,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:33:16,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:33:16,255 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2022-11-16 12:33:16,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 109 transitions, 464 flow. Second operand has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 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-16 12:33:16,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:33:16,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2022-11-16 12:33:16,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:33:16,586 INFO L130 PetriNetUnfolder]: 82/337 cut-off events. [2022-11-16 12:33:16,586 INFO L131 PetriNetUnfolder]: For 1394/1394 co-relation queries the response was YES. [2022-11-16 12:33:16,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249 conditions, 337 events. 82/337 cut-off events. For 1394/1394 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1329 event pairs, 5 based on Foata normal form. 9/344 useless extension candidates. Maximal degree in co-relation 1204. Up to 68 conditions per place. [2022-11-16 12:33:16,589 INFO L137 encePairwiseOnDemand]: 106/115 looper letters, 36 selfloop transitions, 12 changer transitions 23/145 dead transitions. [2022-11-16 12:33:16,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 145 transitions, 979 flow [2022-11-16 12:33:16,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:33:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 12:33:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1040 transitions. [2022-11-16 12:33:16,592 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8221343873517787 [2022-11-16 12:33:16,592 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1040 transitions. [2022-11-16 12:33:16,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1040 transitions. [2022-11-16 12:33:16,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:33:16,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1040 transitions. [2022-11-16 12:33:16,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.54545454545455) internal successors, (1040), 11 states have internal predecessors, (1040), 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-16 12:33:16,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 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-16 12:33:16,597 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 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-16 12:33:16,598 INFO L175 Difference]: Start difference. First operand has 138 places, 109 transitions, 464 flow. Second operand 11 states and 1040 transitions. [2022-11-16 12:33:16,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 145 transitions, 979 flow [2022-11-16 12:33:16,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 145 transitions, 826 flow, removed 60 selfloop flow, removed 11 redundant places. [2022-11-16 12:33:16,604 INFO L231 Difference]: Finished difference. Result has 139 places, 109 transitions, 423 flow [2022-11-16 12:33:16,605 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=423, PETRI_PLACES=139, PETRI_TRANSITIONS=109} [2022-11-16 12:33:16,605 INFO L288 CegarLoopForPetriNet]: 120 programPoint places, 19 predicate places. [2022-11-16 12:33:16,605 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 109 transitions, 423 flow [2022-11-16 12:33:16,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 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-16 12:33:16,606 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:33:16,606 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:33:16,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:33:16,607 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:33:16,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:16,607 INFO L85 PathProgramCache]: Analyzing trace with hash -178204217, now seen corresponding path program 1 times [2022-11-16 12:33:16,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:16,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532789172] [2022-11-16 12:33:16,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:16,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:33:16,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:33:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:33:16,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:33:16,858 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:33:16,860 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-16 12:33:16,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-16 12:33:16,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-16 12:33:16,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-16 12:33:16,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-16 12:33:16,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-16 12:33:16,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:33:16,863 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:33:16,870 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:33:16,870 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:33:17,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:33:17 BasicIcfg [2022-11-16 12:33:17,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:33:17,016 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:33:17,016 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:33:17,016 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:33:17,016 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:50" (3/4) ... [2022-11-16 12:33:17,018 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 12:33:17,152 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:33:17,153 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:33:17,153 INFO L158 Benchmark]: Toolchain (without parser) took 29002.69ms. Allocated memory was 104.9MB in the beginning and 461.4MB in the end (delta: 356.5MB). Free memory was 73.3MB in the beginning and 376.4MB in the end (delta: -303.1MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2022-11-16 12:33:17,154 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 104.9MB. Free memory is still 54.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:33:17,154 INFO L158 Benchmark]: CACSL2BoogieTranslator took 717.32ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 73.0MB in the beginning and 89.5MB in the end (delta: -16.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:33:17,155 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.72ms. Allocated memory is still 130.0MB. Free memory was 89.5MB in the beginning and 87.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:33:17,157 INFO L158 Benchmark]: Boogie Preprocessor took 57.71ms. Allocated memory is still 130.0MB. Free memory was 87.0MB in the beginning and 84.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:33:17,157 INFO L158 Benchmark]: RCFGBuilder took 1120.41ms. Allocated memory is still 130.0MB. Free memory was 84.7MB in the beginning and 76.5MB in the end (delta: 8.3MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2022-11-16 12:33:17,158 INFO L158 Benchmark]: TraceAbstraction took 26880.18ms. Allocated memory was 130.0MB in the beginning and 461.4MB in the end (delta: 331.4MB). Free memory was 75.5MB in the beginning and 400.5MB in the end (delta: -325.0MB). Peak memory consumption was 253.5MB. Max. memory is 16.1GB. [2022-11-16 12:33:17,158 INFO L158 Benchmark]: Witness Printer took 137.32ms. Allocated memory is still 461.4MB. Free memory was 400.5MB in the beginning and 376.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-16 12:33:17,161 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.26ms. Allocated memory is still 104.9MB. Free memory is still 54.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 717.32ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 73.0MB in the beginning and 89.5MB in the end (delta: -16.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.72ms. Allocated memory is still 130.0MB. Free memory was 89.5MB in the beginning and 87.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.71ms. Allocated memory is still 130.0MB. Free memory was 87.0MB in the beginning and 84.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1120.41ms. Allocated memory is still 130.0MB. Free memory was 84.7MB in the beginning and 76.5MB in the end (delta: 8.3MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * TraceAbstraction took 26880.18ms. Allocated memory was 130.0MB in the beginning and 461.4MB in the end (delta: 331.4MB). Free memory was 75.5MB in the beginning and 400.5MB in the end (delta: -325.0MB). Peak memory consumption was 253.5MB. Max. memory is 16.1GB. * Witness Printer took 137.32ms. Allocated memory is still 461.4MB. Free memory was 400.5MB in the beginning and 376.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_p2_EBX=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0] [L734] 0 int y$w_buff0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$w_buff0=0] [L736] 0 int y$w_buff1; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L727] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L723] 0 int y$mem_tmp; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L724] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L725] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L722] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_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] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_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] [L728] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L731] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L846] 0 pthread_t t1849; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1849={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] [L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1849, ((void *)0), P0, ((void *)0))=-2, t1849={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] [L848] 0 pthread_t t1850; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1849={5:0}, t1850={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] [L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1850, ((void *)0), P1, ((void *)0))=-1, t1849={5:0}, t1850={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] [L850] 0 pthread_t t1851; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={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] [L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1851, ((void *)0), P2, ((void *)0))=0, t1849={5:0}, t1850={6:0}, t1851={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] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L778] 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) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 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 [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] 3 y$mem_tmp = y [L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = y [L804] 3 y = y$flush_delayed ? y$mem_tmp : y [L805] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, 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] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 y$flush_delayed = weak$$choice2 [L811] 3 y$mem_tmp = y [L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EBX = y [L820] 3 y = y$flush_delayed ? y$mem_tmp : y [L821] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, 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] [L824] 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) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, 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] [L758] 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) [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 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 [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, 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] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, 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] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, 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] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, 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] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=3, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, 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] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, 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] [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 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 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=3, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, 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] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 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) [L869] 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)) [L870] 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)) [L871] 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)) [L872] 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)) [L873] 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)) [L874] 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)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, 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] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, 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] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, 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: 847]: 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: 851]: 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: 849]: 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, 142 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: 26.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1025 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1025 mSDsluCounter, 1063 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 861 mSDsCounter, 208 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2667 IncrementalHoareTripleChecker+Invalid, 2875 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 208 mSolverCounterUnsat, 202 mSDtfsCounter, 2667 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=794occurred in iteration=10, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 1281 NumberOfCodeBlocks, 1281 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1177 ConstructedInterpolants, 0 QuantifiedInterpolants, 7911 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-16 12:33:17,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81f7aff0-98e9-482e-80c8-715c3499d00e/bin/uautomizer-tPACEb0tL8/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