./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix028_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 03:44:54,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:44:54,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:44:54,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:44:54,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:44:54,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:44:54,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:44:54,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:44:54,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:44:54,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:44:54,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:44:54,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:44:54,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:44:54,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:44:54,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:44:54,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:44:54,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:44:54,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:44:54,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:44:54,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:44:54,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:44:54,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:44:54,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:44:54,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:44:54,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:44:54,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:44:54,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:44:54,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:44:54,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:44:54,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:44:54,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:44:54,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:44:54,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:44:54,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:44:54,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:44:54,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:44:55,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:44:55,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:44:55,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:44:55,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:44:55,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:44:55,003 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 03:44:55,028 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:44:55,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:44:55,029 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:44:55,029 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:44:55,030 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:44:55,030 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:44:55,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:44:55,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:44:55,031 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:44:55,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:44:55,032 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:44:55,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:44:55,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:44:55,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:44:55,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:44:55,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:44:55,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:44:55,033 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:44:55,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:44:55,034 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:44:55,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:44:55,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:44:55,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:44:55,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:44:55,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:44:55,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:44:55,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:44:55,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:44:55,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:44:55,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:44:55,036 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:44:55,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:44:55,036 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:44:55,037 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:44:55,037 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/bin/uautomizer-QkZJyEgLgS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a [2022-11-23 03:44:55,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:44:55,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:44:55,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:44:55,336 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:44:55,337 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:44:55,338 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix028_tso.i [2022-11-23 03:44:58,580 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:44:58,833 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:44:58,837 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/sv-benchmarks/c/pthread-wmm/mix028_tso.i [2022-11-23 03:44:58,852 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/bin/uautomizer-QkZJyEgLgS/data/bd80bc193/06b8d1190d3d4d15bc1b239e41373c75/FLAG502a987e9 [2022-11-23 03:44:58,867 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/bin/uautomizer-QkZJyEgLgS/data/bd80bc193/06b8d1190d3d4d15bc1b239e41373c75 [2022-11-23 03:44:58,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:44:58,872 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:44:58,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:44:58,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:44:58,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:44:58,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:44:58" (1/1) ... [2022-11-23 03:44:58,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b3dcbe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:58, skipping insertion in model container [2022-11-23 03:44:58,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:44:58" (1/1) ... [2022-11-23 03:44:58,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:44:58,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:44:59,102 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/sv-benchmarks/c/pthread-wmm/mix028_tso.i[944,957] [2022-11-23 03:44:59,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:44:59,401 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:44:59,419 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/sv-benchmarks/c/pthread-wmm/mix028_tso.i[944,957] [2022-11-23 03:44:59,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:44:59,569 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:44:59,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:59 WrapperNode [2022-11-23 03:44:59,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:44:59,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:44:59,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:44:59,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:44:59,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:59" (1/1) ... [2022-11-23 03:44:59,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:59" (1/1) ... [2022-11-23 03:44:59,662 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2022-11-23 03:44:59,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:44:59,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:44:59,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:44:59,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:44:59,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:59" (1/1) ... [2022-11-23 03:44:59,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:59" (1/1) ... [2022-11-23 03:44:59,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:59" (1/1) ... [2022-11-23 03:44:59,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:59" (1/1) ... [2022-11-23 03:44:59,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:59" (1/1) ... [2022-11-23 03:44:59,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:59" (1/1) ... [2022-11-23 03:44:59,722 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:59" (1/1) ... [2022-11-23 03:44:59,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:59" (1/1) ... [2022-11-23 03:44:59,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:44:59,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:44:59,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:44:59,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:44:59,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:59" (1/1) ... [2022-11-23 03:44:59,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:44:59,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:44:59,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:44:59,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:44:59,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 03:44:59,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 03:44:59,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:44:59,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:44:59,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:44:59,826 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 03:44:59,826 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 03:44:59,826 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 03:44:59,826 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 03:44:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 03:44:59,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 03:44:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:44:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 03:44:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:44:59,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:44:59,829 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 03:45:00,038 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:45:00,040 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:45:00,626 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:45:00,872 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:45:00,873 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 03:45:00,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:45:00 BoogieIcfgContainer [2022-11-23 03:45:00,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:45:00,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:45:00,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:45:00,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:45:00,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:44:58" (1/3) ... [2022-11-23 03:45:00,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4345c30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:45:00, skipping insertion in model container [2022-11-23 03:45:00,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:44:59" (2/3) ... [2022-11-23 03:45:00,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4345c30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:45:00, skipping insertion in model container [2022-11-23 03:45:00,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:45:00" (3/3) ... [2022-11-23 03:45:00,887 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_tso.i [2022-11-23 03:45:00,895 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 03:45:00,904 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:45:00,904 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 03:45:00,904 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 03:45:00,959 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 03:45:00,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-11-23 03:45:01,046 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-23 03:45:01,046 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:45:01,051 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-23 03:45:01,052 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-11-23 03:45:01,056 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-11-23 03:45:01,060 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 03:45:01,076 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2022-11-23 03:45:01,079 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2022-11-23 03:45:01,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2022-11-23 03:45:01,110 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-23 03:45:01,110 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:45:01,112 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-23 03:45:01,114 INFO L119 LiptonReduction]: Number of co-enabled transitions 2036 [2022-11-23 03:45:08,040 INFO L134 LiptonReduction]: Checked pairs total: 5516 [2022-11-23 03:45:08,040 INFO L136 LiptonReduction]: Total number of compositions: 102 [2022-11-23 03:45:08,059 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:45:08,066 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;@683a4d27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:45:08,067 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-23 03:45:08,073 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-11-23 03:45:08,074 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:45:08,074 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:45:08,075 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:45:08,076 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:45:08,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:08,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1529434653, now seen corresponding path program 1 times [2022-11-23 03:45:08,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:08,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5152678] [2022-11-23 03:45:08,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:08,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:45:08,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:08,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5152678] [2022-11-23 03:45:08,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5152678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:08,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:08,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:45:08,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754037922] [2022-11-23 03:45:08,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:08,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:45:08,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:08,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:45:08,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:45:08,747 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 217 [2022-11-23 03:45:08,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:08,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:45:08,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 217 [2022-11-23 03:45:08,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:45:09,213 INFO L130 PetriNetUnfolder]: 644/1043 cut-off events. [2022-11-23 03:45:09,213 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-23 03:45:09,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2055 conditions, 1043 events. 644/1043 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4996 event pairs, 112 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 2044. Up to 773 conditions per place. [2022-11-23 03:45:09,225 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 24 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2022-11-23 03:45:09,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 127 flow [2022-11-23 03:45:09,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:45:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:45:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-11-23 03:45:09,258 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5130568356374808 [2022-11-23 03:45:09,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2022-11-23 03:45:09,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2022-11-23 03:45:09,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:45:09,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2022-11-23 03:45:09,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:09,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:09,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:09,290 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 334 transitions. [2022-11-23 03:45:09,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 127 flow [2022-11-23 03:45:09,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 03:45:09,296 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2022-11-23 03:45:09,299 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-11-23 03:45:09,303 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2022-11-23 03:45:09,304 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2022-11-23 03:45:09,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:09,305 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:45:09,306 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:45:09,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:45:09,307 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:45:09,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:09,309 INFO L85 PathProgramCache]: Analyzing trace with hash 907970727, now seen corresponding path program 1 times [2022-11-23 03:45:09,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:09,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700373761] [2022-11-23 03:45:09,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:09,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:45:10,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:10,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700373761] [2022-11-23 03:45:10,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700373761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:10,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:10,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:45:10,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035616912] [2022-11-23 03:45:10,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:10,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:45:10,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:10,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:45:10,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:45:10,415 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 217 [2022-11-23 03:45:10,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:10,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:45:10,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 217 [2022-11-23 03:45:10,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:45:10,794 INFO L130 PetriNetUnfolder]: 967/1494 cut-off events. [2022-11-23 03:45:10,794 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-11-23 03:45:10,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3076 conditions, 1494 events. 967/1494 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6585 event pairs, 263 based on Foata normal form. 64/1553 useless extension candidates. Maximal degree in co-relation 3066. Up to 913 conditions per place. [2022-11-23 03:45:10,809 INFO L137 encePairwiseOnDemand]: 208/217 looper letters, 29 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2022-11-23 03:45:10,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 160 flow [2022-11-23 03:45:10,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:45:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:45:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 407 transitions. [2022-11-23 03:45:10,853 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46889400921658986 [2022-11-23 03:45:10,853 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 407 transitions. [2022-11-23 03:45:10,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 407 transitions. [2022-11-23 03:45:10,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:45:10,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 407 transitions. [2022-11-23 03:45:10,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:10,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:10,862 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:10,862 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 4 states and 407 transitions. [2022-11-23 03:45:10,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 160 flow [2022-11-23 03:45:10,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:45:10,867 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 108 flow [2022-11-23 03:45:10,868 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-11-23 03:45:10,869 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2022-11-23 03:45:10,869 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 108 flow [2022-11-23 03:45:10,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:10,870 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:45:10,871 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:45:10,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:45:10,872 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:45:10,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:10,875 INFO L85 PathProgramCache]: Analyzing trace with hash 679283508, now seen corresponding path program 1 times [2022-11-23 03:45:10,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:10,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085044692] [2022-11-23 03:45:10,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:10,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:45:11,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:11,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085044692] [2022-11-23 03:45:11,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085044692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:11,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:11,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:45:11,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266807587] [2022-11-23 03:45:11,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:11,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:45:11,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:11,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:45:11,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:45:11,207 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 217 [2022-11-23 03:45:11,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:11,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:45:11,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 217 [2022-11-23 03:45:11,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:45:11,588 INFO L130 PetriNetUnfolder]: 871/1422 cut-off events. [2022-11-23 03:45:11,588 INFO L131 PetriNetUnfolder]: For 786/786 co-relation queries the response was YES. [2022-11-23 03:45:11,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3806 conditions, 1422 events. 871/1422 cut-off events. For 786/786 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6853 event pairs, 292 based on Foata normal form. 8/1417 useless extension candidates. Maximal degree in co-relation 3793. Up to 1227 conditions per place. [2022-11-23 03:45:11,601 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 34 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2022-11-23 03:45:11,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 232 flow [2022-11-23 03:45:11,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:45:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:45:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-11-23 03:45:11,604 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5069124423963134 [2022-11-23 03:45:11,604 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2022-11-23 03:45:11,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2022-11-23 03:45:11,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:45:11,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2022-11-23 03:45:11,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:11,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:11,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:11,610 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 108 flow. Second operand 3 states and 330 transitions. [2022-11-23 03:45:11,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 41 transitions, 232 flow [2022-11-23 03:45:11,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:45:11,615 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 140 flow [2022-11-23 03:45:11,615 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2022-11-23 03:45:11,617 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2022-11-23 03:45:11,617 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 140 flow [2022-11-23 03:45:11,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:11,617 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:45:11,618 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:45:11,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:45:11,618 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:45:11,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:11,619 INFO L85 PathProgramCache]: Analyzing trace with hash -417048928, now seen corresponding path program 1 times [2022-11-23 03:45:11,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:11,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300022215] [2022-11-23 03:45:11,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:11,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:45:12,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:12,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300022215] [2022-11-23 03:45:12,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300022215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:12,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:12,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:45:12,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804392821] [2022-11-23 03:45:12,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:12,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:45:12,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:12,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:45:12,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:45:12,053 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 217 [2022-11-23 03:45:12,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:12,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:45:12,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 217 [2022-11-23 03:45:12,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:45:12,361 INFO L130 PetriNetUnfolder]: 634/1078 cut-off events. [2022-11-23 03:45:12,364 INFO L131 PetriNetUnfolder]: For 879/934 co-relation queries the response was YES. [2022-11-23 03:45:12,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3058 conditions, 1078 events. 634/1078 cut-off events. For 879/934 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5485 event pairs, 121 based on Foata normal form. 164/1222 useless extension candidates. Maximal degree in co-relation 3043. Up to 613 conditions per place. [2022-11-23 03:45:12,372 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 46 selfloop transitions, 7 changer transitions 14/74 dead transitions. [2022-11-23 03:45:12,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 74 transitions, 450 flow [2022-11-23 03:45:12,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:45:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:45:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2022-11-23 03:45:12,376 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48110599078341015 [2022-11-23 03:45:12,376 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2022-11-23 03:45:12,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2022-11-23 03:45:12,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:45:12,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2022-11-23 03:45:12,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:12,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:12,386 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:12,386 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 140 flow. Second operand 5 states and 522 transitions. [2022-11-23 03:45:12,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 74 transitions, 450 flow [2022-11-23 03:45:12,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 74 transitions, 443 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:45:12,393 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 194 flow [2022-11-23 03:45:12,394 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2022-11-23 03:45:12,396 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2022-11-23 03:45:12,396 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 194 flow [2022-11-23 03:45:12,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:12,396 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:45:12,397 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:45:12,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 03:45:12,398 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:45:12,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:12,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1135877614, now seen corresponding path program 1 times [2022-11-23 03:45:12,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:12,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701592664] [2022-11-23 03:45:12,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:12,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:45:12,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:12,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701592664] [2022-11-23 03:45:12,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701592664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:12,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:12,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:45:12,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407480177] [2022-11-23 03:45:12,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:12,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:45:12,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:12,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:45:12,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:45:12,638 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 217 [2022-11-23 03:45:12,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:12,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:45:12,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 217 [2022-11-23 03:45:12,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:45:12,952 INFO L130 PetriNetUnfolder]: 801/1403 cut-off events. [2022-11-23 03:45:12,952 INFO L131 PetriNetUnfolder]: For 1962/1975 co-relation queries the response was YES. [2022-11-23 03:45:12,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5074 conditions, 1403 events. 801/1403 cut-off events. For 1962/1975 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7577 event pairs, 372 based on Foata normal form. 23/1413 useless extension candidates. Maximal degree in co-relation 5055. Up to 707 conditions per place. [2022-11-23 03:45:12,962 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 39 selfloop transitions, 5 changer transitions 8/55 dead transitions. [2022-11-23 03:45:12,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 388 flow [2022-11-23 03:45:12,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:45:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:45:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2022-11-23 03:45:12,964 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5084485407066052 [2022-11-23 03:45:12,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2022-11-23 03:45:12,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2022-11-23 03:45:12,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:45:12,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2022-11-23 03:45:12,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:12,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:12,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:12,968 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 194 flow. Second operand 3 states and 331 transitions. [2022-11-23 03:45:12,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 388 flow [2022-11-23 03:45:12,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:45:12,975 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 189 flow [2022-11-23 03:45:12,975 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-11-23 03:45:12,977 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2022-11-23 03:45:12,978 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 189 flow [2022-11-23 03:45:12,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:12,979 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:45:12,979 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:45:12,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:45:12,980 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:45:12,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:12,980 INFO L85 PathProgramCache]: Analyzing trace with hash -862660820, now seen corresponding path program 1 times [2022-11-23 03:45:12,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:12,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152481144] [2022-11-23 03:45:12,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:12,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:45:13,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:13,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152481144] [2022-11-23 03:45:13,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152481144] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:13,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:13,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:45:13,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243117637] [2022-11-23 03:45:13,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:13,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:45:13,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:13,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:45:13,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:45:13,249 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 217 [2022-11-23 03:45:13,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:13,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:45:13,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 217 [2022-11-23 03:45:13,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:45:13,570 INFO L130 PetriNetUnfolder]: 439/806 cut-off events. [2022-11-23 03:45:13,570 INFO L131 PetriNetUnfolder]: For 1545/1646 co-relation queries the response was YES. [2022-11-23 03:45:13,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2849 conditions, 806 events. 439/806 cut-off events. For 1545/1646 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4185 event pairs, 66 based on Foata normal form. 163/959 useless extension candidates. Maximal degree in co-relation 2829. Up to 314 conditions per place. [2022-11-23 03:45:13,576 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 46 selfloop transitions, 9 changer transitions 36/97 dead transitions. [2022-11-23 03:45:13,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 97 transitions, 700 flow [2022-11-23 03:45:13,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:45:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:45:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 728 transitions. [2022-11-23 03:45:13,580 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4792626728110599 [2022-11-23 03:45:13,580 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 728 transitions. [2022-11-23 03:45:13,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 728 transitions. [2022-11-23 03:45:13,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:45:13,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 728 transitions. [2022-11-23 03:45:13,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:13,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:13,587 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:13,587 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 189 flow. Second operand 7 states and 728 transitions. [2022-11-23 03:45:13,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 97 transitions, 700 flow [2022-11-23 03:45:13,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 97 transitions, 669 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-11-23 03:45:13,593 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 242 flow [2022-11-23 03:45:13,593 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=242, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2022-11-23 03:45:13,594 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2022-11-23 03:45:13,594 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 242 flow [2022-11-23 03:45:13,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:13,595 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:45:13,595 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:45:13,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 03:45:13,596 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:45:13,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:13,596 INFO L85 PathProgramCache]: Analyzing trace with hash 936942735, now seen corresponding path program 1 times [2022-11-23 03:45:13,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:13,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605489298] [2022-11-23 03:45:13,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:13,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:45:13,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:13,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605489298] [2022-11-23 03:45:13,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605489298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:13,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:13,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:45:13,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073162419] [2022-11-23 03:45:13,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:13,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:45:13,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:13,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:45:13,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:45:13,932 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 217 [2022-11-23 03:45:13,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:13,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:45:13,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 217 [2022-11-23 03:45:13,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:45:14,237 INFO L130 PetriNetUnfolder]: 345/649 cut-off events. [2022-11-23 03:45:14,237 INFO L131 PetriNetUnfolder]: For 1684/1822 co-relation queries the response was YES. [2022-11-23 03:45:14,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2482 conditions, 649 events. 345/649 cut-off events. For 1684/1822 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3345 event pairs, 57 based on Foata normal form. 128/768 useless extension candidates. Maximal degree in co-relation 2459. Up to 241 conditions per place. [2022-11-23 03:45:14,241 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 39 selfloop transitions, 12 changer transitions 33/89 dead transitions. [2022-11-23 03:45:14,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 665 flow [2022-11-23 03:45:14,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:45:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 03:45:14,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 914 transitions. [2022-11-23 03:45:14,245 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4679979518689196 [2022-11-23 03:45:14,246 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 914 transitions. [2022-11-23 03:45:14,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 914 transitions. [2022-11-23 03:45:14,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:45:14,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 914 transitions. [2022-11-23 03:45:14,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.55555555555556) internal successors, (914), 9 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:14,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:14,253 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 217.0) internal successors, (2170), 10 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:14,254 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 242 flow. Second operand 9 states and 914 transitions. [2022-11-23 03:45:14,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 89 transitions, 665 flow [2022-11-23 03:45:14,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 89 transitions, 625 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-11-23 03:45:14,265 INFO L231 Difference]: Finished difference. Result has 56 places, 33 transitions, 217 flow [2022-11-23 03:45:14,265 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=217, PETRI_PLACES=56, PETRI_TRANSITIONS=33} [2022-11-23 03:45:14,266 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2022-11-23 03:45:14,267 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 33 transitions, 217 flow [2022-11-23 03:45:14,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:14,267 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:45:14,267 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] [2022-11-23 03:45:14,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 03:45:14,272 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:45:14,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:14,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1951312341, now seen corresponding path program 1 times [2022-11-23 03:45:14,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:14,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496220292] [2022-11-23 03:45:14,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:14,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:45:15,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:15,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496220292] [2022-11-23 03:45:15,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496220292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:15,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:15,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:45:15,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117684396] [2022-11-23 03:45:15,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:15,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:45:15,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:15,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:45:15,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:45:15,171 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 217 [2022-11-23 03:45:15,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 33 transitions, 217 flow. Second operand has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:15,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:45:15,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 217 [2022-11-23 03:45:15,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:45:15,576 INFO L130 PetriNetUnfolder]: 243/477 cut-off events. [2022-11-23 03:45:15,577 INFO L131 PetriNetUnfolder]: For 1157/1157 co-relation queries the response was YES. [2022-11-23 03:45:15,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1930 conditions, 477 events. 243/477 cut-off events. For 1157/1157 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2111 event pairs, 20 based on Foata normal form. 1/478 useless extension candidates. Maximal degree in co-relation 1906. Up to 241 conditions per place. [2022-11-23 03:45:15,580 INFO L137 encePairwiseOnDemand]: 208/217 looper letters, 28 selfloop transitions, 6 changer transitions 42/77 dead transitions. [2022-11-23 03:45:15,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 77 transitions, 663 flow [2022-11-23 03:45:15,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:45:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 03:45:15,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 593 transitions. [2022-11-23 03:45:15,583 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4554531490015361 [2022-11-23 03:45:15,584 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 593 transitions. [2022-11-23 03:45:15,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 593 transitions. [2022-11-23 03:45:15,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:45:15,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 593 transitions. [2022-11-23 03:45:15,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:15,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:15,589 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:15,589 INFO L175 Difference]: Start difference. First operand has 56 places, 33 transitions, 217 flow. Second operand 6 states and 593 transitions. [2022-11-23 03:45:15,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 77 transitions, 663 flow [2022-11-23 03:45:15,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 77 transitions, 543 flow, removed 29 selfloop flow, removed 8 redundant places. [2022-11-23 03:45:15,597 INFO L231 Difference]: Finished difference. Result has 54 places, 29 transitions, 162 flow [2022-11-23 03:45:15,597 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=54, PETRI_TRANSITIONS=29} [2022-11-23 03:45:15,600 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places. [2022-11-23 03:45:15,600 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 29 transitions, 162 flow [2022-11-23 03:45:15,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:15,600 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:45:15,601 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] [2022-11-23 03:45:15,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 03:45:15,601 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:45:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:15,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2037679603, now seen corresponding path program 2 times [2022-11-23 03:45:15,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:15,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038831959] [2022-11-23 03:45:15,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:15,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:45:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:45:16,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:45:16,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038831959] [2022-11-23 03:45:16,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038831959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:45:16,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:45:16,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:45:16,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366545561] [2022-11-23 03:45:16,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:45:16,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:45:16,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:45:16,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:45:16,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:45:16,978 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 217 [2022-11-23 03:45:16,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 29 transitions, 162 flow. Second operand has 7 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:16,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:45:16,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 217 [2022-11-23 03:45:16,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:45:17,127 INFO L130 PetriNetUnfolder]: 50/126 cut-off events. [2022-11-23 03:45:17,130 INFO L131 PetriNetUnfolder]: For 254/255 co-relation queries the response was YES. [2022-11-23 03:45:17,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 126 events. 50/126 cut-off events. For 254/255 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 361 event pairs, 12 based on Foata normal form. 2/128 useless extension candidates. Maximal degree in co-relation 476. Up to 70 conditions per place. [2022-11-23 03:45:17,132 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 25 selfloop transitions, 5 changer transitions 11/43 dead transitions. [2022-11-23 03:45:17,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 321 flow [2022-11-23 03:45:17,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:45:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:45:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2022-11-23 03:45:17,135 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4774193548387097 [2022-11-23 03:45:17,135 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2022-11-23 03:45:17,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2022-11-23 03:45:17,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:45:17,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2022-11-23 03:45:17,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:17,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:17,142 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:17,142 INFO L175 Difference]: Start difference. First operand has 54 places, 29 transitions, 162 flow. Second operand 5 states and 518 transitions. [2022-11-23 03:45:17,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 321 flow [2022-11-23 03:45:17,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 287 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-11-23 03:45:17,145 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 138 flow [2022-11-23 03:45:17,145 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2022-11-23 03:45:17,147 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2022-11-23 03:45:17,147 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 138 flow [2022-11-23 03:45:17,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:45:17,150 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:45:17,150 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] [2022-11-23 03:45:17,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 03:45:17,151 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:45:17,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:45:17,152 INFO L85 PathProgramCache]: Analyzing trace with hash -73458901, now seen corresponding path program 3 times [2022-11-23 03:45:17,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:45:17,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435674060] [2022-11-23 03:45:17,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:45:17,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:45:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:45:17,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:45:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:45:17,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:45:17,332 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 03:45:17,333 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-23 03:45:17,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-23 03:45:17,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-23 03:45:17,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-23 03:45:17,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-23 03:45:17,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-23 03:45:17,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 03:45:17,337 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:45:17,343 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 03:45:17,343 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 03:45:17,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:45:17 BasicIcfg [2022-11-23 03:45:17,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 03:45:17,431 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 03:45:17,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 03:45:17,431 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 03:45:17,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:45:00" (3/4) ... [2022-11-23 03:45:17,434 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 03:45:17,573 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 03:45:17,573 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 03:45:17,574 INFO L158 Benchmark]: Toolchain (without parser) took 18702.19ms. Allocated memory was 182.5MB in the beginning and 343.9MB in the end (delta: 161.5MB). Free memory was 136.5MB in the beginning and 124.9MB in the end (delta: 11.6MB). Peak memory consumption was 174.6MB. Max. memory is 16.1GB. [2022-11-23 03:45:17,574 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 138.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:45:17,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 697.34ms. Allocated memory is still 182.5MB. Free memory was 136.0MB in the beginning and 111.8MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-23 03:45:17,574 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.80ms. Allocated memory is still 182.5MB. Free memory was 111.8MB in the beginning and 108.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:45:17,575 INFO L158 Benchmark]: Boogie Preprocessor took 62.23ms. Allocated memory is still 182.5MB. Free memory was 108.8MB in the beginning and 107.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:45:17,575 INFO L158 Benchmark]: RCFGBuilder took 1148.42ms. Allocated memory is still 182.5MB. Free memory was 106.7MB in the beginning and 121.6MB in the end (delta: -14.9MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2022-11-23 03:45:17,575 INFO L158 Benchmark]: TraceAbstraction took 16551.93ms. Allocated memory was 182.5MB in the beginning and 343.9MB in the end (delta: 161.5MB). Free memory was 121.6MB in the beginning and 136.4MB in the end (delta: -14.8MB). Peak memory consumption was 146.7MB. Max. memory is 16.1GB. [2022-11-23 03:45:17,576 INFO L158 Benchmark]: Witness Printer took 142.33ms. Allocated memory is still 343.9MB. Free memory was 136.4MB in the beginning and 124.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 03:45:17,577 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.27ms. Allocated memory is still 138.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 697.34ms. Allocated memory is still 182.5MB. Free memory was 136.0MB in the beginning and 111.8MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.80ms. Allocated memory is still 182.5MB. Free memory was 111.8MB in the beginning and 108.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.23ms. Allocated memory is still 182.5MB. Free memory was 108.8MB in the beginning and 107.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1148.42ms. Allocated memory is still 182.5MB. Free memory was 106.7MB in the beginning and 121.6MB in the end (delta: -14.9MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16551.93ms. Allocated memory was 182.5MB in the beginning and 343.9MB in the end (delta: 161.5MB). Free memory was 121.6MB in the beginning and 136.4MB in the end (delta: -14.8MB). Peak memory consumption was 146.7MB. Max. memory is 16.1GB. * Witness Printer took 142.33ms. Allocated memory is still 343.9MB. Free memory was 136.4MB in the beginning and 124.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 120 PlacesBefore, 33 PlacesAfterwards, 112 TransitionsBefore, 24 TransitionsAfterwards, 2036 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 102 TotalNumberOfCompositions, 5516 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3013, independent: 2830, independent conditional: 0, independent unconditional: 2830, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1599, independent: 1526, independent conditional: 0, independent unconditional: 1526, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1599, independent: 1501, independent conditional: 0, independent unconditional: 1501, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 98, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 851, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 797, dependent conditional: 0, dependent unconditional: 797, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3013, independent: 1304, independent conditional: 0, independent unconditional: 1304, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 1599, unknown conditional: 0, unknown unconditional: 1599] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 136, Positive conditional cache size: 0, Positive unconditional cache size: 136, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t763; [L832] FCALL, FORK 0 pthread_create(&t763, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t763, ((void *)0), P0, ((void *)0))=-2, t763={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, z=0] [L833] 0 pthread_t t764; [L834] FCALL, FORK 0 pthread_create(&t764, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t764, ((void *)0), P1, ((void *)0))=-1, t763={5:0}, t764={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, z=0] [L835] 0 pthread_t t765; [L836] FCALL, FORK 0 pthread_create(&t765, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t765, ((void *)0), P2, ((void *)0))=0, t763={5:0}, t764={6:0}, t765={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, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 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) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 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)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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=1, 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, z=0] [L806] 3 __unbuffered_p2_EBX = z VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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=1, 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, z=0] [L743] 1 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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=1, 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, z=1] [L746] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L758] 2 x = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, 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=1, 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, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L761] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, 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=1, 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, z=1] [L764] 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) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 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 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, 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=1, 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, z=1] [L809] 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) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 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 [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, 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=1, 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, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 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) [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 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 [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice0=3, weak$$choice2=1, x=2, y=2, 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=1, 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, z=1] [L849] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L850] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L851] 0 y$flush_delayed = weak$$choice2 [L852] 0 y$mem_tmp = y [L853] 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) [L854] 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)) [L855] 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)) [L856] 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)) [L857] 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)) [L858] 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)) [L859] 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)) [L860] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L861] 0 y = y$flush_delayed ? y$mem_tmp : y [L862] 0 y$flush_delayed = (_Bool)0 [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=2, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] - 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: 836]: 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: 834]: 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: 832]: 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: 16.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 376 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 765 IncrementalHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 36 mSDtfsCounter, 765 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=242occurred in iteration=6, InterpolantAutomatonStates: 45, 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.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 846 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-23 03:45:17,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37a98e75-02bb-40cb-8581-07e6bf660b8a/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE