./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:29:12,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:29:12,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:29:12,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:29:12,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:29:12,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:29:12,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:29:12,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:29:12,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:29:12,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:29:12,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:29:12,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:29:12,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:29:12,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:29:12,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:29:12,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:29:12,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:29:12,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:29:12,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:29:12,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:29:12,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:29:12,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:29:12,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:29:12,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:29:12,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:29:12,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:29:12,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:29:12,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:29:12,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:29:12,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:29:12,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:29:12,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:29:12,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:29:12,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:29:12,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:29:12,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:29:12,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:29:12,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:29:12,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:29:12,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:29:12,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:29:12,878 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:29:12,906 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:29:12,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:29:12,907 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:29:12,907 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:29:12,908 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:29:12,909 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:29:12,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:29:12,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:29:12,910 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:29:12,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:29:12,911 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:29:12,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:29:12,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:29:12,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:29:12,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:29:12,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:29:12,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:29:12,912 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:29:12,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:29:12,913 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:29:12,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:29:12,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:29:12,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:29:12,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:29:12,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:29:12,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:29:12,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:29:12,915 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:29:12,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:29:12,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:29:12,916 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:29:12,916 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:29:12,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:29:12,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d082f4414248fc35e1fa616a9787901263e0e45c6e6a28545f00aa25d14032e [2022-11-16 12:29:13,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:29:13,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:29:13,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:29:13,288 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:29:13,289 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:29:13,291 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2022-11-16 12:29:13,391 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8/data/2f1b7bb7d/dbea31e4ef034e37ac8b47a7fda6df94/FLAGc45d374ad [2022-11-16 12:29:14,090 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:29:14,091 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/sv-benchmarks/c/pthread-wmm/rfi008.opt.i [2022-11-16 12:29:14,109 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8/data/2f1b7bb7d/dbea31e4ef034e37ac8b47a7fda6df94/FLAGc45d374ad [2022-11-16 12:29:14,368 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8/data/2f1b7bb7d/dbea31e4ef034e37ac8b47a7fda6df94 [2022-11-16 12:29:14,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:29:14,373 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:29:14,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:29:14,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:29:14,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:29:14,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:29:14" (1/1) ... [2022-11-16 12:29:14,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a992a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:14, skipping insertion in model container [2022-11-16 12:29:14,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:29:14" (1/1) ... [2022-11-16 12:29:14,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:29:14,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:29:14,771 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/sv-benchmarks/c/pthread-wmm/rfi008.opt.i[987,1000] [2022-11-16 12:29:15,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:29:15,123 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:29:15,138 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/sv-benchmarks/c/pthread-wmm/rfi008.opt.i[987,1000] [2022-11-16 12:29:15,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:29:15,226 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:29:15,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:15 WrapperNode [2022-11-16 12:29:15,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:29:15,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:29:15,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:29:15,229 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:29:15,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:15" (1/1) ... [2022-11-16 12:29:15,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:15" (1/1) ... [2022-11-16 12:29:15,287 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-11-16 12:29:15,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:29:15,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:29:15,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:29:15,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:29:15,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:15" (1/1) ... [2022-11-16 12:29:15,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:15" (1/1) ... [2022-11-16 12:29:15,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:15" (1/1) ... [2022-11-16 12:29:15,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:15" (1/1) ... [2022-11-16 12:29:15,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:15" (1/1) ... [2022-11-16 12:29:15,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:15" (1/1) ... [2022-11-16 12:29:15,343 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:15" (1/1) ... [2022-11-16 12:29:15,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:15" (1/1) ... [2022-11-16 12:29:15,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:29:15,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:29:15,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:29:15,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:29:15,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:15" (1/1) ... [2022-11-16 12:29:15,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:29:15,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:29:15,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:29:15,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:29:15,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:29:15,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:29:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:29:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:29:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:29:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 12:29:15,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 12:29:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 12:29:15,465 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 12:29:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:29:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:29:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:29:15,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:29:15,469 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:29:15,747 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:29:15,765 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:29:16,156 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:29:16,506 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:29:16,530 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:29:16,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:29:16 BoogieIcfgContainer [2022-11-16 12:29:16,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:29:16,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:29:16,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:29:16,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:29:16,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:29:14" (1/3) ... [2022-11-16 12:29:16,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4f6c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:29:16, skipping insertion in model container [2022-11-16 12:29:16,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:29:15" (2/3) ... [2022-11-16 12:29:16,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4f6c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:29:16, skipping insertion in model container [2022-11-16 12:29:16,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:29:16" (3/3) ... [2022-11-16 12:29:16,555 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008.opt.i [2022-11-16 12:29:16,564 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:29:16,575 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:29:16,576 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 12:29:16,576 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:29:16,630 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:29:16,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow [2022-11-16 12:29:16,723 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2022-11-16 12:29:16,723 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:29:16,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-11-16 12:29:16,728 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 98 transitions, 206 flow [2022-11-16 12:29:16,733 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 96 transitions, 198 flow [2022-11-16 12:29:16,744 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:29:16,751 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;@287c99a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:29:16,752 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-16 12:29:16,770 INFO L130 PetriNetUnfolder]: 0/58 cut-off events. [2022-11-16 12:29:16,770 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:29:16,770 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:29:16,771 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:16,771 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:29:16,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:16,777 INFO L85 PathProgramCache]: Analyzing trace with hash 827173621, now seen corresponding path program 1 times [2022-11-16 12:29:16,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:29:16,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967719954] [2022-11-16 12:29:16,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:16,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:29:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:29:17,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:29:17,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967719954] [2022-11-16 12:29:17,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967719954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:17,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:17,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:29:17,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670101040] [2022-11-16 12:29:17,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:17,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:29:17,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:29:17,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:29:17,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:29:17,689 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 98 [2022-11-16 12:29:17,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:17,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:29:17,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 98 [2022-11-16 12:29:17,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:29:17,828 INFO L130 PetriNetUnfolder]: 14/169 cut-off events. [2022-11-16 12:29:17,828 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 12:29:17,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 169 events. 14/169 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 409 event pairs, 6 based on Foata normal form. 6/164 useless extension candidates. Maximal degree in co-relation 162. Up to 25 conditions per place. [2022-11-16 12:29:17,831 INFO L137 encePairwiseOnDemand]: 93/98 looper letters, 8 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2022-11-16 12:29:17,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 94 transitions, 214 flow [2022-11-16 12:29:17,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:29:17,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:29:17,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2022-11-16 12:29:17,845 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9285714285714286 [2022-11-16 12:29:17,846 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2022-11-16 12:29:17,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2022-11-16 12:29:17,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:29:17,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2022-11-16 12:29:17,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:17,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:17,860 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:17,862 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 198 flow. Second operand 3 states and 273 transitions. [2022-11-16 12:29:17,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 94 transitions, 214 flow [2022-11-16 12:29:17,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 94 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:29:17,868 INFO L231 Difference]: Finished difference. Result has 99 places, 92 transitions, 192 flow [2022-11-16 12:29:17,871 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2022-11-16 12:29:17,874 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, -2 predicate places. [2022-11-16 12:29:17,875 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 192 flow [2022-11-16 12:29:17,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:17,875 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:29:17,876 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:17,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:29:17,876 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:29:17,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:17,877 INFO L85 PathProgramCache]: Analyzing trace with hash -771111953, now seen corresponding path program 1 times [2022-11-16 12:29:17,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:29:17,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521490028] [2022-11-16 12:29:17,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:17,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:29:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:29:18,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:29:18,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521490028] [2022-11-16 12:29:18,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521490028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:18,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:18,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:29:18,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301337844] [2022-11-16 12:29:18,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:18,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:29:18,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:29:18,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:29:18,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:29:18,604 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 98 [2022-11-16 12:29:18,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 192 flow. Second operand has 7 states, 7 states have (on average 75.85714285714286) internal successors, (531), 7 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:18,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:29:18,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 98 [2022-11-16 12:29:18,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:29:19,358 INFO L130 PetriNetUnfolder]: 210/742 cut-off events. [2022-11-16 12:29:19,359 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-16 12:29:19,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 742 events. 210/742 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4342 event pairs, 34 based on Foata normal form. 0/717 useless extension candidates. Maximal degree in co-relation 1116. Up to 189 conditions per place. [2022-11-16 12:29:19,370 INFO L137 encePairwiseOnDemand]: 92/98 looper letters, 23 selfloop transitions, 2 changer transitions 49/137 dead transitions. [2022-11-16 12:29:19,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 137 transitions, 428 flow [2022-11-16 12:29:19,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:29:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:29:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 733 transitions. [2022-11-16 12:29:19,382 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8310657596371882 [2022-11-16 12:29:19,382 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 733 transitions. [2022-11-16 12:29:19,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 733 transitions. [2022-11-16 12:29:19,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:29:19,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 733 transitions. [2022-11-16 12:29:19,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 81.44444444444444) internal successors, (733), 9 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:19,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:19,394 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:19,395 INFO L175 Difference]: Start difference. First operand has 99 places, 92 transitions, 192 flow. Second operand 9 states and 733 transitions. [2022-11-16 12:29:19,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 137 transitions, 428 flow [2022-11-16 12:29:19,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 137 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:29:19,401 INFO L231 Difference]: Finished difference. Result has 112 places, 82 transitions, 188 flow [2022-11-16 12:29:19,401 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=112, PETRI_TRANSITIONS=82} [2022-11-16 12:29:19,402 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 11 predicate places. [2022-11-16 12:29:19,402 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 82 transitions, 188 flow [2022-11-16 12:29:19,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.85714285714286) internal successors, (531), 7 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:19,403 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:29:19,404 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:19,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:29:19,404 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:29:19,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:19,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1844854938, now seen corresponding path program 1 times [2022-11-16 12:29:19,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:29:19,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828536433] [2022-11-16 12:29:19,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:19,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:29:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:29:19,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:29:19,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828536433] [2022-11-16 12:29:19,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828536433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:19,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:19,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:29:19,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723823137] [2022-11-16 12:29:19,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:19,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:29:19,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:29:19,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:29:19,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:29:19,761 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 98 [2022-11-16 12:29:19,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 82 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 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-16 12:29:19,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:29:19,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 98 [2022-11-16 12:29:19,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:29:20,147 INFO L130 PetriNetUnfolder]: 70/273 cut-off events. [2022-11-16 12:29:20,148 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-11-16 12:29:20,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 273 events. 70/273 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 989 event pairs, 16 based on Foata normal form. 8/273 useless extension candidates. Maximal degree in co-relation 460. Up to 57 conditions per place. [2022-11-16 12:29:20,150 INFO L137 encePairwiseOnDemand]: 92/98 looper letters, 14 selfloop transitions, 2 changer transitions 22/106 dead transitions. [2022-11-16 12:29:20,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 106 transitions, 330 flow [2022-11-16 12:29:20,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:29:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:29:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 751 transitions. [2022-11-16 12:29:20,155 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8514739229024944 [2022-11-16 12:29:20,155 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 751 transitions. [2022-11-16 12:29:20,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 751 transitions. [2022-11-16 12:29:20,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:29:20,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 751 transitions. [2022-11-16 12:29:20,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.44444444444444) internal successors, (751), 9 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:20,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:20,164 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:20,164 INFO L175 Difference]: Start difference. First operand has 112 places, 82 transitions, 188 flow. Second operand 9 states and 751 transitions. [2022-11-16 12:29:20,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 106 transitions, 330 flow [2022-11-16 12:29:20,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 106 transitions, 298 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-11-16 12:29:20,174 INFO L231 Difference]: Finished difference. Result has 103 places, 82 transitions, 192 flow [2022-11-16 12:29:20,175 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=192, PETRI_PLACES=103, PETRI_TRANSITIONS=82} [2022-11-16 12:29:20,177 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 2 predicate places. [2022-11-16 12:29:20,178 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 82 transitions, 192 flow [2022-11-16 12:29:20,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 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-16 12:29:20,179 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:29:20,179 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:20,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:29:20,180 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:29:20,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:20,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1760572284, now seen corresponding path program 1 times [2022-11-16 12:29:20,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:29:20,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001442336] [2022-11-16 12:29:20,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:20,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:29:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:20,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:29:20,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:29:20,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001442336] [2022-11-16 12:29:20,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001442336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:20,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:20,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:29:20,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280534912] [2022-11-16 12:29:20,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:20,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:29:20,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:29:20,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:29:20,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:29:20,621 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2022-11-16 12:29:20,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 82 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:20,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:29:20,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2022-11-16 12:29:20,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:29:20,960 INFO L130 PetriNetUnfolder]: 155/446 cut-off events. [2022-11-16 12:29:20,960 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-16 12:29:20,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 446 events. 155/446 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2101 event pairs, 14 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 825. Up to 79 conditions per place. [2022-11-16 12:29:20,963 INFO L137 encePairwiseOnDemand]: 89/98 looper letters, 24 selfloop transitions, 5 changer transitions 40/134 dead transitions. [2022-11-16 12:29:20,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 134 transitions, 457 flow [2022-11-16 12:29:20,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:29:20,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 12:29:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 841 transitions. [2022-11-16 12:29:20,966 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8581632653061224 [2022-11-16 12:29:20,967 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 841 transitions. [2022-11-16 12:29:20,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 841 transitions. [2022-11-16 12:29:20,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:29:20,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 841 transitions. [2022-11-16 12:29:20,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 84.1) internal successors, (841), 10 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:20,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:20,972 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:20,973 INFO L175 Difference]: Start difference. First operand has 103 places, 82 transitions, 192 flow. Second operand 10 states and 841 transitions. [2022-11-16 12:29:20,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 134 transitions, 457 flow [2022-11-16 12:29:20,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 134 transitions, 427 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-16 12:29:20,977 INFO L231 Difference]: Finished difference. Result has 104 places, 83 transitions, 218 flow [2022-11-16 12:29:20,977 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=218, PETRI_PLACES=104, PETRI_TRANSITIONS=83} [2022-11-16 12:29:20,978 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 3 predicate places. [2022-11-16 12:29:20,978 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 83 transitions, 218 flow [2022-11-16 12:29:20,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:20,979 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:29:20,979 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:20,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:29:20,980 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:29:20,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:20,980 INFO L85 PathProgramCache]: Analyzing trace with hash -345555173, now seen corresponding path program 1 times [2022-11-16 12:29:20,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:29:20,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592509598] [2022-11-16 12:29:20,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:20,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:29:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:29:21,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:29:21,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592509598] [2022-11-16 12:29:21,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592509598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:21,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:21,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:29:21,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542025106] [2022-11-16 12:29:21,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:21,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:29:21,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:29:21,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:29:21,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:29:21,331 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2022-11-16 12:29:21,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 83 transitions, 218 flow. Second operand has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:21,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:29:21,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2022-11-16 12:29:21,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:29:21,615 INFO L130 PetriNetUnfolder]: 33/179 cut-off events. [2022-11-16 12:29:21,616 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2022-11-16 12:29:21,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 179 events. 33/179 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 493 event pairs, 4 based on Foata normal form. 7/185 useless extension candidates. Maximal degree in co-relation 362. Up to 26 conditions per place. [2022-11-16 12:29:21,618 INFO L137 encePairwiseOnDemand]: 90/98 looper letters, 16 selfloop transitions, 7 changer transitions 19/107 dead transitions. [2022-11-16 12:29:21,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 107 transitions, 398 flow [2022-11-16 12:29:21,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:29:21,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 12:29:21,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 814 transitions. [2022-11-16 12:29:21,622 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8306122448979592 [2022-11-16 12:29:21,622 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 814 transitions. [2022-11-16 12:29:21,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 814 transitions. [2022-11-16 12:29:21,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:29:21,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 814 transitions. [2022-11-16 12:29:21,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 81.4) internal successors, (814), 10 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:21,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:21,630 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:21,630 INFO L175 Difference]: Start difference. First operand has 104 places, 83 transitions, 218 flow. Second operand 10 states and 814 transitions. [2022-11-16 12:29:21,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 107 transitions, 398 flow [2022-11-16 12:29:21,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 107 transitions, 352 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-11-16 12:29:21,635 INFO L231 Difference]: Finished difference. Result has 106 places, 83 transitions, 226 flow [2022-11-16 12:29:21,635 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=226, PETRI_PLACES=106, PETRI_TRANSITIONS=83} [2022-11-16 12:29:21,636 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 5 predicate places. [2022-11-16 12:29:21,637 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 83 transitions, 226 flow [2022-11-16 12:29:21,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.0) internal successors, (553), 7 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:21,637 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:29:21,638 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:21,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:29:21,638 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:29:21,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:21,639 INFO L85 PathProgramCache]: Analyzing trace with hash -896602417, now seen corresponding path program 1 times [2022-11-16 12:29:21,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:29:21,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313413069] [2022-11-16 12:29:21,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:21,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:29:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:29:22,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:29:22,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313413069] [2022-11-16 12:29:22,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313413069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:22,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:22,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:29:22,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738610286] [2022-11-16 12:29:22,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:22,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:29:22,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:29:22,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:29:22,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:29:22,072 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 98 [2022-11-16 12:29:22,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 83 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:22,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:29:22,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 98 [2022-11-16 12:29:22,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:29:22,345 INFO L130 PetriNetUnfolder]: 18/163 cut-off events. [2022-11-16 12:29:22,345 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-11-16 12:29:22,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 163 events. 18/163 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 361 event pairs, 0 based on Foata normal form. 1/162 useless extension candidates. Maximal degree in co-relation 272. Up to 40 conditions per place. [2022-11-16 12:29:22,346 INFO L137 encePairwiseOnDemand]: 88/98 looper letters, 23 selfloop transitions, 6 changer transitions 5/96 dead transitions. [2022-11-16 12:29:22,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 96 transitions, 322 flow [2022-11-16 12:29:22,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:29:22,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 12:29:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 611 transitions. [2022-11-16 12:29:22,349 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7793367346938775 [2022-11-16 12:29:22,349 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 611 transitions. [2022-11-16 12:29:22,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 611 transitions. [2022-11-16 12:29:22,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:29:22,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 611 transitions. [2022-11-16 12:29:22,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:22,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:22,354 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:22,354 INFO L175 Difference]: Start difference. First operand has 106 places, 83 transitions, 226 flow. Second operand 8 states and 611 transitions. [2022-11-16 12:29:22,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 96 transitions, 322 flow [2022-11-16 12:29:22,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 276 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-11-16 12:29:22,358 INFO L231 Difference]: Finished difference. Result has 101 places, 86 transitions, 219 flow [2022-11-16 12:29:22,358 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=219, PETRI_PLACES=101, PETRI_TRANSITIONS=86} [2022-11-16 12:29:22,359 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 0 predicate places. [2022-11-16 12:29:22,359 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 86 transitions, 219 flow [2022-11-16 12:29:22,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:22,360 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:29:22,360 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:22,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:29:22,361 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:29:22,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:22,361 INFO L85 PathProgramCache]: Analyzing trace with hash -617931681, now seen corresponding path program 2 times [2022-11-16 12:29:22,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:29:22,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588380883] [2022-11-16 12:29:22,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:22,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:29:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:24,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:29:24,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:29:24,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588380883] [2022-11-16 12:29:24,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588380883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:24,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:24,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 12:29:24,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970864331] [2022-11-16 12:29:24,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:24,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:29:24,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:29:24,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:29:24,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:29:24,553 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 98 [2022-11-16 12:29:24,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 86 transitions, 219 flow. Second operand has 12 states, 12 states have (on average 72.83333333333333) internal successors, (874), 12 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:24,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:29:24,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 98 [2022-11-16 12:29:24,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:29:24,840 INFO L130 PetriNetUnfolder]: 9/155 cut-off events. [2022-11-16 12:29:24,840 INFO L131 PetriNetUnfolder]: For 15/18 co-relation queries the response was YES. [2022-11-16 12:29:24,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 155 events. 9/155 cut-off events. For 15/18 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 336 event pairs, 1 based on Foata normal form. 1/154 useless extension candidates. Maximal degree in co-relation 247. Up to 14 conditions per place. [2022-11-16 12:29:24,841 INFO L137 encePairwiseOnDemand]: 86/98 looper letters, 16 selfloop transitions, 7 changer transitions 9/95 dead transitions. [2022-11-16 12:29:24,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 95 transitions, 317 flow [2022-11-16 12:29:24,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:29:24,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 12:29:24,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 954 transitions. [2022-11-16 12:29:24,845 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7488226059654631 [2022-11-16 12:29:24,846 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 954 transitions. [2022-11-16 12:29:24,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 954 transitions. [2022-11-16 12:29:24,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:29:24,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 954 transitions. [2022-11-16 12:29:24,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 73.38461538461539) internal successors, (954), 13 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:24,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 98.0) internal successors, (1372), 14 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:24,854 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 98.0) internal successors, (1372), 14 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:24,854 INFO L175 Difference]: Start difference. First operand has 101 places, 86 transitions, 219 flow. Second operand 13 states and 954 transitions. [2022-11-16 12:29:24,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 95 transitions, 317 flow [2022-11-16 12:29:24,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 95 transitions, 302 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-11-16 12:29:24,857 INFO L231 Difference]: Finished difference. Result has 110 places, 86 transitions, 236 flow [2022-11-16 12:29:24,858 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=236, PETRI_PLACES=110, PETRI_TRANSITIONS=86} [2022-11-16 12:29:24,858 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 9 predicate places. [2022-11-16 12:29:24,859 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 86 transitions, 236 flow [2022-11-16 12:29:24,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 72.83333333333333) internal successors, (874), 12 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:24,860 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:29:24,860 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:24,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:29:24,860 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:29:24,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:24,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1872548653, now seen corresponding path program 3 times [2022-11-16 12:29:24,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:29:24,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658050444] [2022-11-16 12:29:24,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:24,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:29:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:25,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:29:25,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:29:25,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658050444] [2022-11-16 12:29:25,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658050444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:29:25,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:29:25,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:29:25,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105554083] [2022-11-16 12:29:25,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:29:25,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:29:25,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:29:25,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:29:25,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:29:25,194 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 98 [2022-11-16 12:29:25,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 86 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:25,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:29:25,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 98 [2022-11-16 12:29:25,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:29:25,420 INFO L130 PetriNetUnfolder]: 16/182 cut-off events. [2022-11-16 12:29:25,420 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-11-16 12:29:25,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 182 events. 16/182 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 493 event pairs, 1 based on Foata normal form. 1/181 useless extension candidates. Maximal degree in co-relation 342. Up to 35 conditions per place. [2022-11-16 12:29:25,421 INFO L137 encePairwiseOnDemand]: 92/98 looper letters, 17 selfloop transitions, 1 changer transitions 14/97 dead transitions. [2022-11-16 12:29:25,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 97 transitions, 349 flow [2022-11-16 12:29:25,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:29:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 12:29:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 557 transitions. [2022-11-16 12:29:25,428 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8119533527696793 [2022-11-16 12:29:25,428 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 557 transitions. [2022-11-16 12:29:25,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 557 transitions. [2022-11-16 12:29:25,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:29:25,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 557 transitions. [2022-11-16 12:29:25,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 79.57142857142857) internal successors, (557), 7 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:25,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:25,433 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:25,433 INFO L175 Difference]: Start difference. First operand has 110 places, 86 transitions, 236 flow. Second operand 7 states and 557 transitions. [2022-11-16 12:29:25,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 97 transitions, 349 flow [2022-11-16 12:29:25,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 97 transitions, 311 flow, removed 7 selfloop flow, removed 11 redundant places. [2022-11-16 12:29:25,437 INFO L231 Difference]: Finished difference. Result has 104 places, 83 transitions, 204 flow [2022-11-16 12:29:25,437 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=204, PETRI_PLACES=104, PETRI_TRANSITIONS=83} [2022-11-16 12:29:25,440 INFO L288 CegarLoopForPetriNet]: 101 programPoint places, 3 predicate places. [2022-11-16 12:29:25,441 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 83 transitions, 204 flow [2022-11-16 12:29:25,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:29:25,442 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:29:25,442 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:29:25,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:29:25,442 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-16 12:29:25,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:25,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1815168775, now seen corresponding path program 4 times [2022-11-16 12:29:25,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:29:25,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000219598] [2022-11-16 12:29:25,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:25,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:29:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:29:25,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:29:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:29:25,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:29:25,675 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:29:25,677 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-16 12:29:25,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-16 12:29:25,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-16 12:29:25,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-16 12:29:25,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-16 12:29:25,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:29:25,681 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-11-16 12:29:25,701 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:29:25,701 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:29:25,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:29:25 BasicIcfg [2022-11-16 12:29:25,846 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:29:25,847 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:29:25,847 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:29:25,847 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:29:25,848 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:29:16" (3/4) ... [2022-11-16 12:29:25,850 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 12:29:25,944 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:29:25,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:29:25,945 INFO L158 Benchmark]: Toolchain (without parser) took 11571.68ms. Allocated memory was 136.3MB in the beginning and 209.7MB in the end (delta: 73.4MB). Free memory was 103.1MB in the beginning and 82.0MB in the end (delta: 21.1MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. [2022-11-16 12:29:25,945 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 90.2MB. Free memory was 44.2MB in the beginning and 44.1MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:29:25,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 852.54ms. Allocated memory is still 136.3MB. Free memory was 102.8MB in the beginning and 99.9MB in the end (delta: 2.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:29:25,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.02ms. Allocated memory is still 136.3MB. Free memory was 99.9MB in the beginning and 97.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 12:29:25,946 INFO L158 Benchmark]: Boogie Preprocessor took 60.46ms. Allocated memory is still 136.3MB. Free memory was 97.4MB in the beginning and 95.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:29:25,946 INFO L158 Benchmark]: RCFGBuilder took 1183.83ms. Allocated memory is still 136.3MB. Free memory was 95.3MB in the beginning and 60.6MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-16 12:29:25,947 INFO L158 Benchmark]: TraceAbstraction took 9310.99ms. Allocated memory was 136.3MB in the beginning and 209.7MB in the end (delta: 73.4MB). Free memory was 60.0MB in the beginning and 99.8MB in the end (delta: -39.8MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2022-11-16 12:29:25,947 INFO L158 Benchmark]: Witness Printer took 97.26ms. Allocated memory is still 209.7MB. Free memory was 99.8MB in the beginning and 82.0MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-16 12:29:25,949 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.38ms. Allocated memory is still 90.2MB. Free memory was 44.2MB in the beginning and 44.1MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 852.54ms. Allocated memory is still 136.3MB. Free memory was 102.8MB in the beginning and 99.9MB in the end (delta: 2.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.02ms. Allocated memory is still 136.3MB. Free memory was 99.9MB in the beginning and 97.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.46ms. Allocated memory is still 136.3MB. Free memory was 97.4MB in the beginning and 95.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1183.83ms. Allocated memory is still 136.3MB. Free memory was 95.3MB in the beginning and 60.6MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9310.99ms. Allocated memory was 136.3MB in the beginning and 209.7MB in the end (delta: 73.4MB). Free memory was 60.0MB in the beginning and 99.8MB in the end (delta: -39.8MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * Witness Printer took 97.26ms. Allocated memory is still 209.7MB. Free memory was 99.8MB in the beginning and 82.0MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L738] 0 _Bool weak$$choice0; VAL [weak$$choice0=0] [L739] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0] [L734] 0 int y$w_buff0; VAL [weak$$choice0=0, weak$$choice2=0, y$w_buff0=0] [L736] 0 int y$w_buff1; VAL [weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L728] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L725] 0 int y$mem_tmp; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L726] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L727] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L724] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L713] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L731] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 pthread_t t1723; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1723={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1723, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1723, ((void *)0), P0, ((void *)0))=-1, t1723={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 pthread_t t1724; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1723={5:0}, t1724={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t1724, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1724, ((void *)0), P1, ((void *)0))=0, t1723={5:0}, t1724={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 y$flush_delayed = weak$$choice2 [L788] 2 y$mem_tmp = y [L789] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L790] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L791] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L792] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L793] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L795] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = y [L797] 2 y = y$flush_delayed ? y$mem_tmp : y [L798] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L801] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L804] 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) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 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 [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1723={5:0}, t1724={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 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) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 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 [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1723={5:0}, t1724={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1723={5:0}, t1724={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 829]: 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: 827]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 117 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 272 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 272 mSDsluCounter, 313 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 244 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 703 IncrementalHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 69 mSDtfsCounter, 703 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=7, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 640 NumberOfCodeBlocks, 640 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 555 ConstructedInterpolants, 0 QuantifiedInterpolants, 2431 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 12:29:25,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_962784bc-a3f4-4c26-aef5-4575fcbd0272/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE