./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 03:36:52,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:36:52,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:36:52,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:36:52,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:36:52,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:36:52,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:36:52,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:36:52,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:36:52,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:36:52,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:36:52,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:36:52,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:36:52,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:36:52,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:36:52,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:36:52,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:36:52,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:36:52,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:36:52,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:36:52,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:36:52,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:36:52,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:36:52,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:36:52,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:36:52,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:36:52,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:36:52,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:36:52,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:36:52,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:36:52,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:36:52,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:36:52,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:36:52,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:36:52,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:36:52,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:36:52,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:36:52,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:36:52,764 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:36:52,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:36:52,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:36:52,766 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 03:36:52,810 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:36:52,810 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:36:52,811 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:36:52,811 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:36:52,812 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:36:52,812 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:36:52,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:36:52,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:36:52,813 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:36:52,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:36:52,814 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:36:52,815 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 03:36:52,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:36:52,815 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:36:52,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:36:52,815 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 03:36:52,816 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 03:36:52,816 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 03:36:52,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:36:52,816 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 03:36:52,816 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:36:52,817 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:36:52,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:36:52,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:36:52,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:36:52,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:36:52,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:36:52,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:36:52,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:36:52,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:36:52,819 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:36:52,819 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:36:52,819 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:36:52,819 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 [2022-11-23 03:36:53,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:36:53,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:36:53,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:36:53,129 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:36:53,129 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:36:53,130 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2022-11-23 03:36:56,059 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:36:56,429 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:36:56,434 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2022-11-23 03:36:56,457 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/data/58f78cf95/00406ab14c3e44ecae5eeaf0c7494296/FLAG2c8a9d7ca [2022-11-23 03:36:56,479 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/data/58f78cf95/00406ab14c3e44ecae5eeaf0c7494296 [2022-11-23 03:36:56,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:36:56,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:36:56,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:36:56,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:36:56,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:36:56,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:36:56" (1/1) ... [2022-11-23 03:36:56,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24de299f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:56, skipping insertion in model container [2022-11-23 03:36:56,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:36:56" (1/1) ... [2022-11-23 03:36:56,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:36:56,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:36:56,714 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i[956,969] [2022-11-23 03:36:57,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:36:57,019 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:36:57,031 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i[956,969] [2022-11-23 03:36:57,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:36:57,115 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:36:57,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57 WrapperNode [2022-11-23 03:36:57,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:36:57,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:36:57,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:36:57,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:36:57,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2022-11-23 03:36:57,162 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2022-11-23 03:36:57,201 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-23 03:36:57,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:36:57,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:36:57,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:36:57,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:36:57,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2022-11-23 03:36:57,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2022-11-23 03:36:57,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2022-11-23 03:36:57,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2022-11-23 03:36:57,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2022-11-23 03:36:57,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2022-11-23 03:36:57,229 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2022-11-23 03:36:57,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2022-11-23 03:36:57,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:36:57,235 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:36:57,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:36:57,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:36:57,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (1/1) ... [2022-11-23 03:36:57,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:36:57,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:36:57,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:36:57,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:36:57,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 03:36:57,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 03:36:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:36:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:36:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:36:57,323 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 03:36:57,323 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 03:36:57,325 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 03:36:57,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 03:36:57,326 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 03:36:57,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 03:36:57,326 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 03:36:57,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 03:36:57,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:36:57,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 03:36:57,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:36:57,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:36:57,329 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 03:36:57,537 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:36:57,551 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:36:57,939 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:36:58,136 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:36:58,136 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 03:36:58,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:58 BoogieIcfgContainer [2022-11-23 03:36:58,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:36:58,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:36:58,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:36:58,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:36:58,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:36:56" (1/3) ... [2022-11-23 03:36:58,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5572f800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:36:58, skipping insertion in model container [2022-11-23 03:36:58,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:57" (2/3) ... [2022-11-23 03:36:58,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5572f800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:36:58, skipping insertion in model container [2022-11-23 03:36:58,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:58" (3/3) ... [2022-11-23 03:36:58,154 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt_rmo.opt.i [2022-11-23 03:36:58,169 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:36:58,169 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-23 03:36:58,169 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 03:36:58,227 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 03:36:58,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 316 flow [2022-11-23 03:36:58,326 INFO L130 PetriNetUnfolder]: 2/144 cut-off events. [2022-11-23 03:36:58,327 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:36:58,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 2/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-11-23 03:36:58,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 148 transitions, 316 flow [2022-11-23 03:36:58,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 144 transitions, 300 flow [2022-11-23 03:36:58,342 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 03:36:58,363 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 144 transitions, 300 flow [2022-11-23 03:36:58,366 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 144 transitions, 300 flow [2022-11-23 03:36:58,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 300 flow [2022-11-23 03:36:58,409 INFO L130 PetriNetUnfolder]: 2/144 cut-off events. [2022-11-23 03:36:58,410 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:36:58,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 2/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-11-23 03:36:58,414 INFO L119 LiptonReduction]: Number of co-enabled transitions 3396 [2022-11-23 03:37:04,791 INFO L134 LiptonReduction]: Checked pairs total: 8792 [2022-11-23 03:37:04,792 INFO L136 LiptonReduction]: Total number of compositions: 137 [2022-11-23 03:37:04,818 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:37:04,832 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@5816c342, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:37:04,832 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-23 03:37:04,836 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-23 03:37:04,836 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:37:04,836 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:04,837 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-23 03:37:04,838 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:04,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:04,846 INFO L85 PathProgramCache]: Analyzing trace with hash 599, now seen corresponding path program 1 times [2022-11-23 03:37:04,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:37:04,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917419411] [2022-11-23 03:37:04,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:04,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:37:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:05,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:37:05,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917419411] [2022-11-23 03:37:05,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917419411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:05,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:05,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 03:37:05,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706987536] [2022-11-23 03:37:05,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:05,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 03:37:05,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:37:05,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 03:37:05,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 03:37:05,047 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 285 [2022-11-23 03:37:05,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:05,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:05,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 285 [2022-11-23 03:37:05,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:06,331 INFO L130 PetriNetUnfolder]: 5049/7097 cut-off events. [2022-11-23 03:37:06,331 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-11-23 03:37:06,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14135 conditions, 7097 events. 5049/7097 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 37250 event pairs, 5049 based on Foata normal form. 0/6112 useless extension candidates. Maximal degree in co-relation 14123. Up to 6881 conditions per place. [2022-11-23 03:37:06,391 INFO L137 encePairwiseOnDemand]: 276/285 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2022-11-23 03:37:06,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2022-11-23 03:37:06,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 03:37:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 03:37:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 305 transitions. [2022-11-23 03:37:06,413 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5350877192982456 [2022-11-23 03:37:06,413 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 305 transitions. [2022-11-23 03:37:06,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 305 transitions. [2022-11-23 03:37:06,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:06,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 305 transitions. [2022-11-23 03:37:06,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:06,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:06,436 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:06,437 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 305 transitions. [2022-11-23 03:37:06,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2022-11-23 03:37:06,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-23 03:37:06,447 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2022-11-23 03:37:06,450 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-11-23 03:37:06,454 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2022-11-23 03:37:06,454 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2022-11-23 03:37:06,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:06,455 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:06,455 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:37:06,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:37:06,457 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:06,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:06,460 INFO L85 PathProgramCache]: Analyzing trace with hash 845616970, now seen corresponding path program 1 times [2022-11-23 03:37:06,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:37:06,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747056291] [2022-11-23 03:37:06,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:06,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:37:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:06,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:37:06,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747056291] [2022-11-23 03:37:06,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747056291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:06,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:06,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:37:06,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082789667] [2022-11-23 03:37:06,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:06,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:37:06,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:37:06,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:37:06,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:37:06,895 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 285 [2022-11-23 03:37:06,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:06,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:06,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 285 [2022-11-23 03:37:06,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:07,764 INFO L130 PetriNetUnfolder]: 3975/5687 cut-off events. [2022-11-23 03:37:07,764 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:37:07,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11264 conditions, 5687 events. 3975/5687 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 29763 event pairs, 1089 based on Foata normal form. 0/5266 useless extension candidates. Maximal degree in co-relation 11261. Up to 4303 conditions per place. [2022-11-23 03:37:07,802 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 37 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2022-11-23 03:37:07,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 182 flow [2022-11-23 03:37:07,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:37:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:37:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2022-11-23 03:37:07,806 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.519298245614035 [2022-11-23 03:37:07,806 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2022-11-23 03:37:07,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2022-11-23 03:37:07,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:07,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2022-11-23 03:37:07,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:07,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:07,813 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:07,814 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 444 transitions. [2022-11-23 03:37:07,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 182 flow [2022-11-23 03:37:07,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 03:37:07,816 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2022-11-23 03:37:07,816 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-11-23 03:37:07,817 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2022-11-23 03:37:07,817 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2022-11-23 03:37:07,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:07,819 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:07,819 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:37:07,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:37:07,819 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:07,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:07,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1882264747, now seen corresponding path program 1 times [2022-11-23 03:37:07,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:37:07,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685335271] [2022-11-23 03:37:07,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:07,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:37:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:08,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:37:08,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685335271] [2022-11-23 03:37:08,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685335271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:08,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:08,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:37:08,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760798460] [2022-11-23 03:37:08,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:08,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:37:08,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:37:08,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:37:08,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:37:09,046 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 285 [2022-11-23 03:37:09,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:09,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:09,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 285 [2022-11-23 03:37:09,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:09,817 INFO L130 PetriNetUnfolder]: 2855/4147 cut-off events. [2022-11-23 03:37:09,818 INFO L131 PetriNetUnfolder]: For 252/252 co-relation queries the response was YES. [2022-11-23 03:37:09,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8486 conditions, 4147 events. 2855/4147 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 21253 event pairs, 576 based on Foata normal form. 0/4051 useless extension candidates. Maximal degree in co-relation 8482. Up to 3768 conditions per place. [2022-11-23 03:37:09,851 INFO L137 encePairwiseOnDemand]: 280/285 looper letters, 34 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2022-11-23 03:37:09,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 174 flow [2022-11-23 03:37:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:37:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 03:37:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions. [2022-11-23 03:37:09,854 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4298245614035088 [2022-11-23 03:37:09,855 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 735 transitions. [2022-11-23 03:37:09,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions. [2022-11-23 03:37:09,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:09,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions. [2022-11-23 03:37:09,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:09,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:09,862 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:09,862 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 6 states and 735 transitions. [2022-11-23 03:37:09,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 174 flow [2022-11-23 03:37:09,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:37:09,865 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 70 flow [2022-11-23 03:37:09,866 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-11-23 03:37:09,867 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2022-11-23 03:37:09,867 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 70 flow [2022-11-23 03:37:09,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:09,868 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:09,868 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:37:09,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:37:09,869 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:09,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1882264790, now seen corresponding path program 1 times [2022-11-23 03:37:09,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:37:09,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444502800] [2022-11-23 03:37:09,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:09,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:37:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:10,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:37:10,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444502800] [2022-11-23 03:37:10,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444502800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:10,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:10,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:37:10,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923354043] [2022-11-23 03:37:10,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:10,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:37:10,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:37:10,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:37:10,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:37:10,091 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 285 [2022-11-23 03:37:10,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:10,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:10,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 285 [2022-11-23 03:37:10,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:12,277 INFO L130 PetriNetUnfolder]: 12867/17636 cut-off events. [2022-11-23 03:37:12,281 INFO L131 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2022-11-23 03:37:12,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35687 conditions, 17636 events. 12867/17636 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 91661 event pairs, 3975 based on Foata normal form. 756/18392 useless extension candidates. Maximal degree in co-relation 35683. Up to 10449 conditions per place. [2022-11-23 03:37:12,382 INFO L137 encePairwiseOnDemand]: 276/285 looper letters, 44 selfloop transitions, 7 changer transitions 31/82 dead transitions. [2022-11-23 03:37:12,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 82 transitions, 356 flow [2022-11-23 03:37:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:37:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:37:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 704 transitions. [2022-11-23 03:37:12,385 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49403508771929827 [2022-11-23 03:37:12,385 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 704 transitions. [2022-11-23 03:37:12,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 704 transitions. [2022-11-23 03:37:12,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:12,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 704 transitions. [2022-11-23 03:37:12,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:12,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:12,394 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:12,394 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 70 flow. Second operand 5 states and 704 transitions. [2022-11-23 03:37:12,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 82 transitions, 356 flow [2022-11-23 03:37:12,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 82 transitions, 344 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-23 03:37:12,398 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 133 flow [2022-11-23 03:37:12,398 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-11-23 03:37:12,400 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2022-11-23 03:37:12,400 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 133 flow [2022-11-23 03:37:12,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:12,401 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:12,401 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:37:12,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 03:37:12,402 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:12,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:12,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1779320040, now seen corresponding path program 1 times [2022-11-23 03:37:12,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:37:12,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096399663] [2022-11-23 03:37:12,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:12,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:37:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:12,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:37:12,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096399663] [2022-11-23 03:37:12,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096399663] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:12,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:12,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:37:12,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076149539] [2022-11-23 03:37:12,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:12,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:37:12,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:37:12,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:37:12,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:37:12,730 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 285 [2022-11-23 03:37:12,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:12,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:12,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 285 [2022-11-23 03:37:12,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:14,746 INFO L130 PetriNetUnfolder]: 11315/15616 cut-off events. [2022-11-23 03:37:14,747 INFO L131 PetriNetUnfolder]: For 9904/9904 co-relation queries the response was YES. [2022-11-23 03:37:14,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41847 conditions, 15616 events. 11315/15616 cut-off events. For 9904/9904 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 79471 event pairs, 2447 based on Foata normal form. 736/16352 useless extension candidates. Maximal degree in co-relation 41840. Up to 6945 conditions per place. [2022-11-23 03:37:14,857 INFO L137 encePairwiseOnDemand]: 277/285 looper letters, 51 selfloop transitions, 7 changer transitions 41/99 dead transitions. [2022-11-23 03:37:14,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 99 transitions, 553 flow [2022-11-23 03:37:14,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:37:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:37:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 961 transitions. [2022-11-23 03:37:14,861 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4817042606516291 [2022-11-23 03:37:14,861 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 961 transitions. [2022-11-23 03:37:14,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 961 transitions. [2022-11-23 03:37:14,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:14,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 961 transitions. [2022-11-23 03:37:14,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.28571428571428) internal successors, (961), 7 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:14,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:14,871 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:14,871 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 133 flow. Second operand 7 states and 961 transitions. [2022-11-23 03:37:14,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 99 transitions, 553 flow [2022-11-23 03:37:14,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 99 transitions, 511 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-23 03:37:14,959 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 177 flow [2022-11-23 03:37:14,960 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=177, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2022-11-23 03:37:14,963 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2022-11-23 03:37:14,963 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 177 flow [2022-11-23 03:37:14,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:14,963 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:14,964 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:37:14,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:37:14,964 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:14,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:14,965 INFO L85 PathProgramCache]: Analyzing trace with hash -714161038, now seen corresponding path program 1 times [2022-11-23 03:37:14,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:37:14,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456512256] [2022-11-23 03:37:14,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:14,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:37:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:15,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:37:15,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456512256] [2022-11-23 03:37:15,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456512256] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:15,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:15,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:37:15,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115866815] [2022-11-23 03:37:15,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:15,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:37:15,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:37:15,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:37:15,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:37:15,198 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 285 [2022-11-23 03:37:15,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:15,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:15,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 285 [2022-11-23 03:37:15,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:16,011 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([422] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][70], [P0Thread1of1ForFork3InUse, 162#true, Black: 189#(= ~__unbuffered_p3_EAX~0 0), Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 193#(and (= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 122#L756true, 63#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 191#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 187#true, 174#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), 203#true, 5#L867-1true, Black: 179#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 138#L784true, Black: 181#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 67#P2EXITtrue, P3Thread1of1ForFork2InUse, Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse]) [2022-11-23 03:37:16,011 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-23 03:37:16,012 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-23 03:37:16,012 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-23 03:37:16,012 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-23 03:37:16,088 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([422] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][70], [P0Thread1of1ForFork3InUse, 162#true, Black: 189#(= ~__unbuffered_p3_EAX~0 0), Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 193#(and (= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 122#L756true, 107#P1EXITtrue, 63#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 191#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 187#true, 174#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), 203#true, 5#L867-1true, Black: 179#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 181#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 67#P2EXITtrue, P3Thread1of1ForFork2InUse, Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse]) [2022-11-23 03:37:16,088 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-23 03:37:16,088 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 03:37:16,088 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 03:37:16,088 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 03:37:16,089 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([422] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][70], [P0Thread1of1ForFork3InUse, 162#true, Black: 189#(= ~__unbuffered_p3_EAX~0 0), Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 193#(and (= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 122#L756true, 63#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 191#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 84#L874true, 187#true, 174#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), 203#true, Black: 179#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 138#L784true, Black: 181#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 67#P2EXITtrue, P3Thread1of1ForFork2InUse, Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse]) [2022-11-23 03:37:16,090 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-23 03:37:16,090 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 03:37:16,090 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 03:37:16,090 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 03:37:16,091 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([500] L874-->L878-1: Formula: (and (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_18) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p0_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_34 0) (= v_~z~0_32 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~z~0=v_~z~0_32, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_20, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z~0=v_~z~0_32, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][75], [P0Thread1of1ForFork3InUse, 162#true, Black: 189#(= ~__unbuffered_p3_EAX~0 0), Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 193#(and (= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 122#L756true, 80#L878-1true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 191#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 187#true, 174#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), 203#true, Black: 179#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 138#L784true, Black: 181#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 67#P2EXITtrue, 135#L832true, P3Thread1of1ForFork2InUse, Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse]) [2022-11-23 03:37:16,091 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-23 03:37:16,091 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 03:37:16,091 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 03:37:16,091 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 03:37:16,145 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([422] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][70], [P0Thread1of1ForFork3InUse, 162#true, Black: 189#(= ~__unbuffered_p3_EAX~0 0), Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 193#(and (= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 122#L756true, 107#P1EXITtrue, 63#L839true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 191#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 84#L874true, 187#true, 174#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), 203#true, Black: 179#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 181#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 67#P2EXITtrue, P3Thread1of1ForFork2InUse, Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse]) [2022-11-23 03:37:16,145 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-23 03:37:16,146 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 03:37:16,146 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 03:37:16,146 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 03:37:16,146 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([500] L874-->L878-1: Formula: (and (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_18) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p0_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_34 0) (= v_~z~0_32 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~z~0=v_~z~0_32, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_20, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z~0=v_~z~0_32, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][75], [P0Thread1of1ForFork3InUse, 162#true, Black: 189#(= ~__unbuffered_p3_EAX~0 0), Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 193#(and (= ~__unbuffered_p3_EAX~0 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 122#L756true, 107#P1EXITtrue, 80#L878-1true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 191#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 187#true, 174#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), 203#true, Black: 179#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 181#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 67#P2EXITtrue, 135#L832true, P3Thread1of1ForFork2InUse, Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse]) [2022-11-23 03:37:16,146 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-23 03:37:16,147 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 03:37:16,147 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 03:37:16,147 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 03:37:16,208 INFO L130 PetriNetUnfolder]: 5728/8530 cut-off events. [2022-11-23 03:37:16,208 INFO L131 PetriNetUnfolder]: For 7072/7401 co-relation queries the response was YES. [2022-11-23 03:37:16,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22165 conditions, 8530 events. 5728/8530 cut-off events. For 7072/7401 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 50516 event pairs, 1159 based on Foata normal form. 651/8919 useless extension candidates. Maximal degree in co-relation 22153. Up to 5804 conditions per place. [2022-11-23 03:37:16,280 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 65 selfloop transitions, 10 changer transitions 0/85 dead transitions. [2022-11-23 03:37:16,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 498 flow [2022-11-23 03:37:16,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:37:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:37:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 710 transitions. [2022-11-23 03:37:16,284 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4982456140350877 [2022-11-23 03:37:16,284 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 710 transitions. [2022-11-23 03:37:16,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 710 transitions. [2022-11-23 03:37:16,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:16,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 710 transitions. [2022-11-23 03:37:16,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:16,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:16,291 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:16,291 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 177 flow. Second operand 5 states and 710 transitions. [2022-11-23 03:37:16,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 498 flow [2022-11-23 03:37:16,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 487 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-11-23 03:37:16,338 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 241 flow [2022-11-23 03:37:16,338 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2022-11-23 03:37:16,341 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2022-11-23 03:37:16,342 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 241 flow [2022-11-23 03:37:16,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:16,342 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:16,343 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:37:16,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 03:37:16,343 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:16,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:16,344 INFO L85 PathProgramCache]: Analyzing trace with hash 526155021, now seen corresponding path program 1 times [2022-11-23 03:37:16,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:37:16,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91023090] [2022-11-23 03:37:16,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:16,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:37:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:16,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:37:16,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91023090] [2022-11-23 03:37:16,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91023090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:16,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:16,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:37:16,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704462609] [2022-11-23 03:37:16,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:16,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:37:16,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:37:16,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:37:16,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:37:16,578 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 285 [2022-11-23 03:37:16,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:16,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:16,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 285 [2022-11-23 03:37:16,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:17,406 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([422] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][75], [P0Thread1of1ForFork3InUse, 162#true, Black: 189#(= ~__unbuffered_p3_EAX~0 0), Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 122#L756true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 63#L839true, Black: 191#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 187#true, 174#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), 203#true, 5#L867-1true, Black: 208#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 205#(= ~__unbuffered_cnt~0 0), Black: 206#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 67#P2EXITtrue, 221#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 138#L784true, Black: 181#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P3Thread1of1ForFork2InUse, Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse]) [2022-11-23 03:37:17,406 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-23 03:37:17,407 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-23 03:37:17,407 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-23 03:37:17,407 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-23 03:37:17,452 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([422] L832-->L839: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_82 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_99 (ite .cse2 0 v_~y$w_buff0_used~0_100)) (= (ite .cse1 0 v_~y$r_buff0_thd4~0_26) v_~y$r_buff0_thd4~0_25) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_82 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= (ite .cse2 v_~y$w_buff0~0_46 (ite .cse0 v_~y$w_buff1~0_45 v_~y~0_63)) v_~y~0_62)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][103], [P0Thread1of1ForFork3InUse, 162#true, Black: 189#(= ~__unbuffered_p3_EAX~0 0), Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 122#L756true, Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 107#P1EXITtrue, 63#L839true, Black: 191#(or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 187#true, 174#(and (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t696~0#1.base| 0) |ULTIMATE.start_main_~#t693~0#1.base| 0) |ULTIMATE.start_main_~#t695~0#1.base| 0) |ULTIMATE.start_main_~#t694~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t695~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|)) (not (= |ULTIMATE.start_main_~#t695~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t694~0#1.base| |ULTIMATE.start_main_~#t693~0#1.base|)) (not (= |ULTIMATE.start_main_~#t696~0#1.base| |ULTIMATE.start_main_~#t694~0#1.base|))), 203#true, 217#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 5#L867-1true, Black: 208#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 205#(= ~__unbuffered_cnt~0 0), Black: 206#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 67#P2EXITtrue, Black: 181#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P3Thread1of1ForFork2InUse, Black: 178#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse]) [2022-11-23 03:37:17,452 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-23 03:37:17,453 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 03:37:17,453 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 03:37:17,453 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 03:37:17,543 INFO L130 PetriNetUnfolder]: 4171/6489 cut-off events. [2022-11-23 03:37:17,543 INFO L131 PetriNetUnfolder]: For 6290/6479 co-relation queries the response was YES. [2022-11-23 03:37:17,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20968 conditions, 6489 events. 4171/6489 cut-off events. For 6290/6479 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 39675 event pairs, 456 based on Foata normal form. 425/6744 useless extension candidates. Maximal degree in co-relation 20954. Up to 2227 conditions per place. [2022-11-23 03:37:17,597 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 88 selfloop transitions, 19 changer transitions 1/118 dead transitions. [2022-11-23 03:37:17,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 118 transitions, 775 flow [2022-11-23 03:37:17,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:37:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:37:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 995 transitions. [2022-11-23 03:37:17,618 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49874686716791977 [2022-11-23 03:37:17,619 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 995 transitions. [2022-11-23 03:37:17,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 995 transitions. [2022-11-23 03:37:17,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:17,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 995 transitions. [2022-11-23 03:37:17,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.14285714285714) internal successors, (995), 7 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:17,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:17,632 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:17,632 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 241 flow. Second operand 7 states and 995 transitions. [2022-11-23 03:37:17,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 118 transitions, 775 flow [2022-11-23 03:37:17,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 118 transitions, 754 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-11-23 03:37:17,666 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 364 flow [2022-11-23 03:37:17,666 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=364, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2022-11-23 03:37:17,669 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2022-11-23 03:37:17,669 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 364 flow [2022-11-23 03:37:17,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:17,670 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:17,670 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:37:17,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 03:37:17,670 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:17,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:17,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1827673543, now seen corresponding path program 1 times [2022-11-23 03:37:17,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:37:17,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735769052] [2022-11-23 03:37:17,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:17,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:37:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:17,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:17,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:37:17,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735769052] [2022-11-23 03:37:17,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735769052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:17,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:17,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:37:17,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733089456] [2022-11-23 03:37:17,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:17,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:37:17,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:37:17,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:37:17,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:37:17,997 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 285 [2022-11-23 03:37:17,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:17,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:17,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 285 [2022-11-23 03:37:17,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:19,760 INFO L130 PetriNetUnfolder]: 8260/12344 cut-off events. [2022-11-23 03:37:19,761 INFO L131 PetriNetUnfolder]: For 34962/34962 co-relation queries the response was YES. [2022-11-23 03:37:19,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51130 conditions, 12344 events. 8260/12344 cut-off events. For 34962/34962 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 73327 event pairs, 967 based on Foata normal form. 67/12411 useless extension candidates. Maximal degree in co-relation 51115. Up to 4633 conditions per place. [2022-11-23 03:37:19,831 INFO L137 encePairwiseOnDemand]: 275/285 looper letters, 114 selfloop transitions, 19 changer transitions 82/215 dead transitions. [2022-11-23 03:37:19,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 215 transitions, 1904 flow [2022-11-23 03:37:19,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:37:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:37:19,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 975 transitions. [2022-11-23 03:37:19,836 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48872180451127817 [2022-11-23 03:37:19,836 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 975 transitions. [2022-11-23 03:37:19,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 975 transitions. [2022-11-23 03:37:19,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:19,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 975 transitions. [2022-11-23 03:37:19,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.28571428571428) internal successors, (975), 7 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:19,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:19,845 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:19,845 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 364 flow. Second operand 7 states and 975 transitions. [2022-11-23 03:37:19,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 215 transitions, 1904 flow [2022-11-23 03:37:20,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 215 transitions, 1684 flow, removed 77 selfloop flow, removed 3 redundant places. [2022-11-23 03:37:20,501 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 360 flow [2022-11-23 03:37:20,501 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=360, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2022-11-23 03:37:20,502 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2022-11-23 03:37:20,502 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 360 flow [2022-11-23 03:37:20,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:20,503 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:20,503 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:37:20,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 03:37:20,504 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:20,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:20,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1521436751, now seen corresponding path program 2 times [2022-11-23 03:37:20,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:37:20,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188453440] [2022-11-23 03:37:20,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:20,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:37:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:20,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:37:20,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188453440] [2022-11-23 03:37:20,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188453440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:20,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:20,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:37:20,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737972090] [2022-11-23 03:37:20,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:20,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:37:20,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:37:20,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:37:20,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:37:20,817 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 285 [2022-11-23 03:37:20,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 360 flow. Second operand has 6 states, 6 states have (on average 132.0) internal successors, (792), 6 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:20,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:20,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 285 [2022-11-23 03:37:20,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:21,464 INFO L130 PetriNetUnfolder]: 2232/3712 cut-off events. [2022-11-23 03:37:21,464 INFO L131 PetriNetUnfolder]: For 7699/7803 co-relation queries the response was YES. [2022-11-23 03:37:21,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13254 conditions, 3712 events. 2232/3712 cut-off events. For 7699/7803 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 22001 event pairs, 321 based on Foata normal form. 267/3895 useless extension candidates. Maximal degree in co-relation 13236. Up to 1106 conditions per place. [2022-11-23 03:37:21,484 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 84 selfloop transitions, 18 changer transitions 16/134 dead transitions. [2022-11-23 03:37:21,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 134 transitions, 1039 flow [2022-11-23 03:37:21,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:37:21,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:37:21,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 996 transitions. [2022-11-23 03:37:21,488 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4992481203007519 [2022-11-23 03:37:21,488 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 996 transitions. [2022-11-23 03:37:21,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 996 transitions. [2022-11-23 03:37:21,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:21,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 996 transitions. [2022-11-23 03:37:21,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.28571428571428) internal successors, (996), 7 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:21,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:21,496 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:21,496 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 360 flow. Second operand 7 states and 996 transitions. [2022-11-23 03:37:21,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 134 transitions, 1039 flow [2022-11-23 03:37:21,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 134 transitions, 999 flow, removed 20 selfloop flow, removed 4 redundant places. [2022-11-23 03:37:21,525 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 472 flow [2022-11-23 03:37:21,525 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=472, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2022-11-23 03:37:21,526 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2022-11-23 03:37:21,526 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 472 flow [2022-11-23 03:37:21,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.0) internal successors, (792), 6 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:21,527 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:21,527 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] [2022-11-23 03:37:21,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 03:37:21,528 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1967278982, now seen corresponding path program 1 times [2022-11-23 03:37:21,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:37:21,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982651991] [2022-11-23 03:37:21,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:21,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:37:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:21,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-23 03:37:21,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:37:21,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982651991] [2022-11-23 03:37:21,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982651991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:21,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:21,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:37:21,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460791646] [2022-11-23 03:37:21,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:21,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:37:21,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:37:21,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:37:21,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:37:21,807 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 285 [2022-11-23 03:37:21,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 472 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:21,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:21,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 285 [2022-11-23 03:37:21,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:22,666 INFO L130 PetriNetUnfolder]: 3541/5575 cut-off events. [2022-11-23 03:37:22,666 INFO L131 PetriNetUnfolder]: For 17104/17104 co-relation queries the response was YES. [2022-11-23 03:37:22,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23549 conditions, 5575 events. 3541/5575 cut-off events. For 17104/17104 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 31229 event pairs, 474 based on Foata normal form. 19/5594 useless extension candidates. Maximal degree in co-relation 23531. Up to 2874 conditions per place. [2022-11-23 03:37:22,694 INFO L137 encePairwiseOnDemand]: 275/285 looper letters, 111 selfloop transitions, 30 changer transitions 41/182 dead transitions. [2022-11-23 03:37:22,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 182 transitions, 1728 flow [2022-11-23 03:37:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:37:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:37:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 961 transitions. [2022-11-23 03:37:22,700 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4817042606516291 [2022-11-23 03:37:22,700 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 961 transitions. [2022-11-23 03:37:22,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 961 transitions. [2022-11-23 03:37:22,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:22,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 961 transitions. [2022-11-23 03:37:22,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.28571428571428) internal successors, (961), 7 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:22,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:22,708 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:22,708 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 472 flow. Second operand 7 states and 961 transitions. [2022-11-23 03:37:22,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 182 transitions, 1728 flow [2022-11-23 03:37:22,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 182 transitions, 1501 flow, removed 92 selfloop flow, removed 2 redundant places. [2022-11-23 03:37:22,864 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 652 flow [2022-11-23 03:37:22,865 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=652, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2022-11-23 03:37:22,866 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2022-11-23 03:37:22,866 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 652 flow [2022-11-23 03:37:22,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:22,866 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:22,867 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] [2022-11-23 03:37:22,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 03:37:22,867 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:22,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:22,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1023215914, now seen corresponding path program 2 times [2022-11-23 03:37:22,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:37:22,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222873731] [2022-11-23 03:37:22,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:22,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:37:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:23,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:23,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:37:23,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222873731] [2022-11-23 03:37:23,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222873731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:23,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:23,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:37:23,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859818301] [2022-11-23 03:37:23,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:23,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:37:23,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:37:23,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:37:23,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:37:23,113 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 285 [2022-11-23 03:37:23,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 652 flow. Second operand has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:23,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:23,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 285 [2022-11-23 03:37:23,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:23,931 INFO L130 PetriNetUnfolder]: 2943/4904 cut-off events. [2022-11-23 03:37:23,931 INFO L131 PetriNetUnfolder]: For 15543/15773 co-relation queries the response was YES. [2022-11-23 03:37:23,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20036 conditions, 4904 events. 2943/4904 cut-off events. For 15543/15773 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 29724 event pairs, 695 based on Foata normal form. 32/4825 useless extension candidates. Maximal degree in co-relation 20012. Up to 2366 conditions per place. [2022-11-23 03:37:23,958 INFO L137 encePairwiseOnDemand]: 281/285 looper letters, 75 selfloop transitions, 3 changer transitions 39/135 dead transitions. [2022-11-23 03:37:23,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 135 transitions, 1258 flow [2022-11-23 03:37:23,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:37:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:37:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 717 transitions. [2022-11-23 03:37:23,962 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5031578947368421 [2022-11-23 03:37:23,962 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 717 transitions. [2022-11-23 03:37:23,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 717 transitions. [2022-11-23 03:37:23,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:23,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 717 transitions. [2022-11-23 03:37:23,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:23,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:23,968 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:23,968 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 652 flow. Second operand 5 states and 717 transitions. [2022-11-23 03:37:23,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 135 transitions, 1258 flow [2022-11-23 03:37:24,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 135 transitions, 1224 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-11-23 03:37:24,096 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 579 flow [2022-11-23 03:37:24,096 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=579, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2022-11-23 03:37:24,097 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2022-11-23 03:37:24,097 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 579 flow [2022-11-23 03:37:24,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:24,098 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:24,098 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] [2022-11-23 03:37:24,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 03:37:24,098 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:24,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:24,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1927621674, now seen corresponding path program 3 times [2022-11-23 03:37:24,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:37:24,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711621895] [2022-11-23 03:37:24,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:24,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:37:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:24,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:37:24,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711621895] [2022-11-23 03:37:24,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711621895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:24,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:24,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:37:24,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319826214] [2022-11-23 03:37:24,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:24,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:37:24,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:37:24,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:37:24,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:37:24,394 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 285 [2022-11-23 03:37:24,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 579 flow. Second operand has 7 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:24,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:24,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 285 [2022-11-23 03:37:24,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:25,034 INFO L130 PetriNetUnfolder]: 2096/3472 cut-off events. [2022-11-23 03:37:25,034 INFO L131 PetriNetUnfolder]: For 9146/9289 co-relation queries the response was YES. [2022-11-23 03:37:25,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13359 conditions, 3472 events. 2096/3472 cut-off events. For 9146/9289 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 20679 event pairs, 283 based on Foata normal form. 99/3471 useless extension candidates. Maximal degree in co-relation 13336. Up to 1290 conditions per place. [2022-11-23 03:37:25,046 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 48 selfloop transitions, 17 changer transitions 62/138 dead transitions. [2022-11-23 03:37:25,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 138 transitions, 1293 flow [2022-11-23 03:37:25,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 03:37:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 03:37:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1114 transitions. [2022-11-23 03:37:25,049 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4885964912280702 [2022-11-23 03:37:25,050 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1114 transitions. [2022-11-23 03:37:25,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1114 transitions. [2022-11-23 03:37:25,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:25,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1114 transitions. [2022-11-23 03:37:25,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 139.25) internal successors, (1114), 8 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:25,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 285.0) internal successors, (2565), 9 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:25,058 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 285.0) internal successors, (2565), 9 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:25,058 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 579 flow. Second operand 8 states and 1114 transitions. [2022-11-23 03:37:25,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 138 transitions, 1293 flow [2022-11-23 03:37:25,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 138 transitions, 1217 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-11-23 03:37:25,148 INFO L231 Difference]: Finished difference. Result has 77 places, 49 transitions, 379 flow [2022-11-23 03:37:25,148 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=379, PETRI_PLACES=77, PETRI_TRANSITIONS=49} [2022-11-23 03:37:25,149 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2022-11-23 03:37:25,149 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 49 transitions, 379 flow [2022-11-23 03:37:25,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:25,150 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:25,150 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:37:25,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 03:37:25,150 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:25,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:25,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1797203142, now seen corresponding path program 1 times [2022-11-23 03:37:25,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:37:25,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268215073] [2022-11-23 03:37:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:25,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:37:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:25,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:37:25,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268215073] [2022-11-23 03:37:25,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268215073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:25,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:25,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:37:25,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739876597] [2022-11-23 03:37:25,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:25,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:37:25,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:37:25,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:37:25,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:37:25,381 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 285 [2022-11-23 03:37:25,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 49 transitions, 379 flow. Second operand has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:25,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:25,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 285 [2022-11-23 03:37:25,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:25,679 INFO L130 PetriNetUnfolder]: 1119/1900 cut-off events. [2022-11-23 03:37:25,679 INFO L131 PetriNetUnfolder]: For 6165/6231 co-relation queries the response was YES. [2022-11-23 03:37:25,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7653 conditions, 1900 events. 1119/1900 cut-off events. For 6165/6231 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10183 event pairs, 528 based on Foata normal form. 1/1841 useless extension candidates. Maximal degree in co-relation 7631. Up to 1009 conditions per place. [2022-11-23 03:37:25,685 INFO L137 encePairwiseOnDemand]: 281/285 looper letters, 38 selfloop transitions, 2 changer transitions 35/78 dead transitions. [2022-11-23 03:37:25,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 78 transitions, 735 flow [2022-11-23 03:37:25,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:37:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:37:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 564 transitions. [2022-11-23 03:37:25,688 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2022-11-23 03:37:25,688 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 564 transitions. [2022-11-23 03:37:25,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 564 transitions. [2022-11-23 03:37:25,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:25,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 564 transitions. [2022-11-23 03:37:25,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:25,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:25,693 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:25,693 INFO L175 Difference]: Start difference. First operand has 77 places, 49 transitions, 379 flow. Second operand 4 states and 564 transitions. [2022-11-23 03:37:25,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 78 transitions, 735 flow [2022-11-23 03:37:25,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 78 transitions, 580 flow, removed 42 selfloop flow, removed 12 redundant places. [2022-11-23 03:37:25,725 INFO L231 Difference]: Finished difference. Result has 66 places, 39 transitions, 201 flow [2022-11-23 03:37:25,726 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=66, PETRI_TRANSITIONS=39} [2022-11-23 03:37:25,726 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2022-11-23 03:37:25,726 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 201 flow [2022-11-23 03:37:25,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:25,727 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:25,727 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] [2022-11-23 03:37:25,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 03:37:25,727 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:25,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:25,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1559801534, now seen corresponding path program 2 times [2022-11-23 03:37:25,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:37:25,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607599568] [2022-11-23 03:37:25,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:25,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:37:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:26,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:26,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:37:26,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607599568] [2022-11-23 03:37:26,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607599568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:26,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:26,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 03:37:26,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453344183] [2022-11-23 03:37:26,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:26,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 03:37:26,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:37:26,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 03:37:26,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:37:27,050 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 285 [2022-11-23 03:37:27,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 39 transitions, 201 flow. Second operand has 9 states, 9 states have (on average 122.0) internal successors, (1098), 9 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:27,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:27,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 285 [2022-11-23 03:37:27,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:27,510 INFO L130 PetriNetUnfolder]: 586/1005 cut-off events. [2022-11-23 03:37:27,510 INFO L131 PetriNetUnfolder]: For 1586/1586 co-relation queries the response was YES. [2022-11-23 03:37:27,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3458 conditions, 1005 events. 586/1005 cut-off events. For 1586/1586 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4637 event pairs, 152 based on Foata normal form. 1/1006 useless extension candidates. Maximal degree in co-relation 3442. Up to 437 conditions per place. [2022-11-23 03:37:27,514 INFO L137 encePairwiseOnDemand]: 275/285 looper letters, 42 selfloop transitions, 5 changer transitions 49/96 dead transitions. [2022-11-23 03:37:27,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 96 transitions, 693 flow [2022-11-23 03:37:27,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 03:37:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 03:37:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1017 transitions. [2022-11-23 03:37:27,518 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44605263157894737 [2022-11-23 03:37:27,518 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1017 transitions. [2022-11-23 03:37:27,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1017 transitions. [2022-11-23 03:37:27,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:27,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1017 transitions. [2022-11-23 03:37:27,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.125) internal successors, (1017), 8 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:27,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 285.0) internal successors, (2565), 9 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:27,525 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 285.0) internal successors, (2565), 9 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:27,525 INFO L175 Difference]: Start difference. First operand has 66 places, 39 transitions, 201 flow. Second operand 8 states and 1017 transitions. [2022-11-23 03:37:27,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 96 transitions, 693 flow [2022-11-23 03:37:27,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 96 transitions, 656 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-23 03:37:27,537 INFO L231 Difference]: Finished difference. Result has 66 places, 41 transitions, 218 flow [2022-11-23 03:37:27,537 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=218, PETRI_PLACES=66, PETRI_TRANSITIONS=41} [2022-11-23 03:37:27,538 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2022-11-23 03:37:27,538 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 41 transitions, 218 flow [2022-11-23 03:37:27,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 122.0) internal successors, (1098), 9 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:27,539 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:27,539 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] [2022-11-23 03:37:27,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 03:37:27,539 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:27,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:27,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1680053874, now seen corresponding path program 3 times [2022-11-23 03:37:27,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:37:27,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563232068] [2022-11-23 03:37:27,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:27,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:37:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:37:27,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:37:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:37:27,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 03:37:27,761 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 03:37:27,762 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-23 03:37:27,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-23 03:37:27,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-23 03:37:27,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-23 03:37:27,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-23 03:37:27,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-23 03:37:27,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-23 03:37:27,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-23 03:37:27,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-23 03:37:27,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-23 03:37:27,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-23 03:37:27,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-23 03:37:27,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-23 03:37:27,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-23 03:37:27,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-23 03:37:27,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-23 03:37:27,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 03:37:27,775 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:37:27,782 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 03:37:27,782 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 03:37:27,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:37:27 BasicIcfg [2022-11-23 03:37:27,911 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 03:37:27,911 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 03:37:27,911 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 03:37:27,912 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 03:37:27,912 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:58" (3/4) ... [2022-11-23 03:37:27,915 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 03:37:27,915 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 03:37:27,916 INFO L158 Benchmark]: Toolchain (without parser) took 31428.83ms. Allocated memory was 176.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 144.7MB in the beginning and 704.5MB in the end (delta: -559.8MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-23 03:37:27,916 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 125.8MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:37:27,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 625.03ms. Allocated memory is still 176.2MB. Free memory was 144.7MB in the beginning and 121.1MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 03:37:27,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.23ms. Allocated memory is still 176.2MB. Free memory was 121.1MB in the beginning and 118.7MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 03:37:27,917 INFO L158 Benchmark]: Boogie Preprocessor took 31.77ms. Allocated memory is still 176.2MB. Free memory was 118.7MB in the beginning and 116.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:37:27,918 INFO L158 Benchmark]: RCFGBuilder took 908.41ms. Allocated memory is still 176.2MB. Free memory was 116.6MB in the beginning and 134.3MB in the end (delta: -17.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-23 03:37:27,918 INFO L158 Benchmark]: TraceAbstraction took 29764.90ms. Allocated memory was 176.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 134.3MB in the beginning and 704.5MB in the end (delta: -570.2MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-23 03:37:27,918 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 1.8GB. Free memory is still 704.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:37:27,922 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 125.8MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 625.03ms. Allocated memory is still 176.2MB. Free memory was 144.7MB in the beginning and 121.1MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.23ms. Allocated memory is still 176.2MB. Free memory was 121.1MB in the beginning and 118.7MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.77ms. Allocated memory is still 176.2MB. Free memory was 118.7MB in the beginning and 116.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 908.41ms. Allocated memory is still 176.2MB. Free memory was 116.6MB in the beginning and 134.3MB in the end (delta: -17.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 29764.90ms. Allocated memory was 176.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 134.3MB in the beginning and 704.5MB in the end (delta: -570.2MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 1.8GB. Free memory is still 704.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4s, 155 PlacesBefore, 51 PlacesAfterwards, 144 TransitionsBefore, 39 TransitionsAfterwards, 3396 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 137 TotalNumberOfCompositions, 8792 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4873, independent: 4673, independent conditional: 0, independent unconditional: 4673, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2477, independent: 2425, independent conditional: 0, independent unconditional: 2425, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2477, independent: 2403, independent conditional: 0, independent unconditional: 2403, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 385, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 348, dependent conditional: 0, dependent unconditional: 348, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4873, independent: 2248, independent conditional: 0, independent unconditional: 2248, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 2477, unknown conditional: 0, unknown unconditional: 2477] , Statistics on independence cache: Total cache size (in pairs): 331, Positive cache size: 307, Positive conditional cache size: 0, Positive unconditional cache size: 307, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t693; [L857] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t693, ((void *)0), P0, ((void *)0))=-4, t693={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L858] 0 pthread_t t694; [L859] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t694, ((void *)0), P1, ((void *)0))=-3, t693={5:0}, t694={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t695; [L861] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t695, ((void *)0), P2, ((void *)0))=-2, t693={5:0}, t694={6:0}, t695={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L862] 0 pthread_t t696; [L863] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t696, ((void *)0), P3, ((void *)0))=-1, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L805] 3 y$r_buff0_thd3 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L808] 3 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L825] 4 z = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L831] 4 __unbuffered_p3_EBX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L752] 1 a = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L755] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L767] 2 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 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) [L775] 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)) [L776] 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)) [L777] 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)) [L778] 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)) [L779] 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)) [L780] 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)) [L781] 2 __unbuffered_p1_EAX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L834] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L835] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L836] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L837] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L838] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L870] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L871] 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 [L872] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L876] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 859]: 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: 861]: 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: 857]: 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 9 procedures, 183 locations, 16 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: 29.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1059 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 902 mSDsluCounter, 512 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 431 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2391 IncrementalHoareTripleChecker+Invalid, 2506 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 81 mSDtfsCounter, 2391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=652occurred in iteration=10, InterpolantAutomatonStates: 81, 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.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 1872 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-23 03:37:27,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 03:37:30,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:37:30,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:37:30,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:37:30,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:37:30,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:37:30,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:37:30,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:37:30,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:37:30,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:37:30,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:37:30,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:37:30,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:37:30,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:37:30,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:37:30,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:37:30,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:37:30,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:37:30,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:37:30,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:37:30,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:37:30,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:37:30,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:37:30,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:37:30,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:37:30,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:37:30,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:37:30,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:37:30,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:37:30,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:37:30,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:37:30,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:37:30,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:37:30,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:37:30,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:37:30,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:37:30,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:37:30,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:37:30,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:37:30,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:37:30,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:37:30,417 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-23 03:37:30,441 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:37:30,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:37:30,442 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:37:30,443 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:37:30,444 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:37:30,444 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:37:30,445 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:37:30,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:37:30,446 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:37:30,446 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:37:30,446 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:37:30,447 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 03:37:30,447 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:37:30,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:37:30,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:37:30,448 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 03:37:30,449 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 03:37:30,449 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 03:37:30,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:37:30,450 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 03:37:30,450 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 03:37:30,450 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 03:37:30,451 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:37:30,451 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:37:30,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:37:30,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:37:30,452 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:37:30,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:37:30,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:37:30,453 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:37:30,453 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-23 03:37:30,453 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 03:37:30,454 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:37:30,454 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:37:30,454 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:37:30,455 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-23 03:37:30,455 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 [2022-11-23 03:37:30,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:37:30,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:37:30,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:37:30,886 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:37:30,887 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:37:30,889 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2022-11-23 03:37:34,066 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:37:34,362 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:37:34,363 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2022-11-23 03:37:34,380 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/data/3299e635a/ea67ba4c44d0468e9ad990f435f8d932/FLAG2ec7665c3 [2022-11-23 03:37:34,399 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/data/3299e635a/ea67ba4c44d0468e9ad990f435f8d932 [2022-11-23 03:37:34,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:37:34,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:37:34,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:37:34,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:37:34,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:37:34,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:37:34" (1/1) ... [2022-11-23 03:37:34,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e2b2eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:34, skipping insertion in model container [2022-11-23 03:37:34,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:37:34" (1/1) ... [2022-11-23 03:37:34,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:37:34,483 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:37:34,640 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i[956,969] [2022-11-23 03:37:34,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:37:34,928 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:37:34,943 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i[956,969] [2022-11-23 03:37:35,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:37:35,049 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:37:35,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:35 WrapperNode [2022-11-23 03:37:35,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:37:35,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:37:35,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:37:35,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:37:35,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:35" (1/1) ... [2022-11-23 03:37:35,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:35" (1/1) ... [2022-11-23 03:37:35,111 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-11-23 03:37:35,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:37:35,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:37:35,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:37:35,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:37:35,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:35" (1/1) ... [2022-11-23 03:37:35,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:35" (1/1) ... [2022-11-23 03:37:35,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:35" (1/1) ... [2022-11-23 03:37:35,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:35" (1/1) ... [2022-11-23 03:37:35,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:35" (1/1) ... [2022-11-23 03:37:35,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:35" (1/1) ... [2022-11-23 03:37:35,159 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:35" (1/1) ... [2022-11-23 03:37:35,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:35" (1/1) ... [2022-11-23 03:37:35,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:37:35,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:37:35,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:37:35,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:37:35,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:35" (1/1) ... [2022-11-23 03:37:35,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:37:35,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:37:35,227 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:37:35,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:37:35,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 03:37:35,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:37:35,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:37:35,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:37:35,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 03:37:35,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 03:37:35,273 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 03:37:35,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 03:37:35,273 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 03:37:35,273 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 03:37:35,273 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 03:37:35,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 03:37:35,274 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 03:37:35,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 03:37:35,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 03:37:35,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:37:35,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:37:35,276 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 03:37:35,501 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:37:35,503 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:37:35,991 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:37:36,103 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:37:36,103 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 03:37:36,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:37:36 BoogieIcfgContainer [2022-11-23 03:37:36,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:37:36,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:37:36,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:37:36,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:37:36,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:37:34" (1/3) ... [2022-11-23 03:37:36,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63101a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:37:36, skipping insertion in model container [2022-11-23 03:37:36,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:37:35" (2/3) ... [2022-11-23 03:37:36,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63101a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:37:36, skipping insertion in model container [2022-11-23 03:37:36,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:37:36" (3/3) ... [2022-11-23 03:37:36,115 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt_rmo.opt.i [2022-11-23 03:37:36,133 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:37:36,134 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-23 03:37:36,134 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 03:37:36,204 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 03:37:36,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-11-23 03:37:36,365 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-11-23 03:37:36,365 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:37:36,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-11-23 03:37:36,374 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 149 transitions, 318 flow [2022-11-23 03:37:36,379 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 145 transitions, 302 flow [2022-11-23 03:37:36,383 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 03:37:36,399 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 145 transitions, 302 flow [2022-11-23 03:37:36,402 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 145 transitions, 302 flow [2022-11-23 03:37:36,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 302 flow [2022-11-23 03:37:36,434 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-11-23 03:37:36,434 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:37:36,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-11-23 03:37:36,438 INFO L119 LiptonReduction]: Number of co-enabled transitions 3396 [2022-11-23 03:37:46,384 INFO L134 LiptonReduction]: Checked pairs total: 8986 [2022-11-23 03:37:46,384 INFO L136 LiptonReduction]: Total number of compositions: 141 [2022-11-23 03:37:46,418 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:37:46,428 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@ac3f1c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:37:46,428 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-23 03:37:46,430 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-23 03:37:46,431 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:37:46,431 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:46,432 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-23 03:37:46,433 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:46,440 INFO L85 PathProgramCache]: Analyzing trace with hash 604, now seen corresponding path program 1 times [2022-11-23 03:37:46,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:37:46,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571310817] [2022-11-23 03:37:46,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:46,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:46,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:37:46,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:37:46,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-23 03:37:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:46,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 03:37:46,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:37:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:46,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:37:46,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:37:46,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571310817] [2022-11-23 03:37:46,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571310817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:46,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:46,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 03:37:46,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953797388] [2022-11-23 03:37:46,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:46,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 03:37:46,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:37:46,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 03:37:46,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 03:37:46,642 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 290 [2022-11-23 03:37:46,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 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-23 03:37:46,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:46,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 290 [2022-11-23 03:37:46,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:47,913 INFO L130 PetriNetUnfolder]: 5049/7097 cut-off events. [2022-11-23 03:37:47,913 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-11-23 03:37:47,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14135 conditions, 7097 events. 5049/7097 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 37276 event pairs, 5049 based on Foata normal form. 0/6064 useless extension candidates. Maximal degree in co-relation 14123. Up to 6881 conditions per place. [2022-11-23 03:37:47,972 INFO L137 encePairwiseOnDemand]: 281/290 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2022-11-23 03:37:47,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2022-11-23 03:37:47,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 03:37:47,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 03:37:47,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 307 transitions. [2022-11-23 03:37:47,994 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5293103448275862 [2022-11-23 03:37:47,996 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 307 transitions. [2022-11-23 03:37:47,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 307 transitions. [2022-11-23 03:37:48,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:48,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 307 transitions. [2022-11-23 03:37:48,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:48,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:48,019 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:48,021 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 307 transitions. [2022-11-23 03:37:48,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2022-11-23 03:37:48,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-23 03:37:48,053 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2022-11-23 03:37:48,056 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-11-23 03:37:48,062 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2022-11-23 03:37:48,063 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2022-11-23 03:37:48,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 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-23 03:37:48,064 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:48,064 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:37:48,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-23 03:37:48,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:48,274 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:48,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:48,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1046398016, now seen corresponding path program 1 times [2022-11-23 03:37:48,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:37:48,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288853111] [2022-11-23 03:37:48,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:48,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:48,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:37:48,282 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:37:48,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-23 03:37:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:48,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 03:37:48,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:37:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:48,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:37:48,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:37:48,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288853111] [2022-11-23 03:37:48,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288853111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:48,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:48,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 03:37:48,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119950098] [2022-11-23 03:37:48,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:48,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:37:48,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:37:48,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:37:48,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:37:48,467 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 290 [2022-11-23 03:37:48,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:48,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:48,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 290 [2022-11-23 03:37:48,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:49,417 INFO L130 PetriNetUnfolder]: 3975/5855 cut-off events. [2022-11-23 03:37:49,418 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 03:37:49,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11432 conditions, 5855 events. 3975/5855 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 33411 event pairs, 753 based on Foata normal form. 0/5422 useless extension candidates. Maximal degree in co-relation 11429. Up to 4303 conditions per place. [2022-11-23 03:37:49,470 INFO L137 encePairwiseOnDemand]: 287/290 looper letters, 37 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2022-11-23 03:37:49,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 182 flow [2022-11-23 03:37:49,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:37:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:37:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2022-11-23 03:37:49,475 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5137931034482759 [2022-11-23 03:37:49,475 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2022-11-23 03:37:49,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2022-11-23 03:37:49,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:49,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2022-11-23 03:37:49,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:49,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:49,484 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:49,484 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 447 transitions. [2022-11-23 03:37:49,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 182 flow [2022-11-23 03:37:49,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 03:37:49,487 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2022-11-23 03:37:49,488 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-11-23 03:37:49,490 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2022-11-23 03:37:49,490 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2022-11-23 03:37:49,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:49,491 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:49,491 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:37:49,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-23 03:37:49,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:49,704 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:49,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:49,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1310811110, now seen corresponding path program 1 times [2022-11-23 03:37:49,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:37:49,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174131283] [2022-11-23 03:37:49,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:49,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:49,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:37:49,709 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:37:49,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-23 03:37:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:49,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 03:37:49,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:37:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:49,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:37:49,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:37:49,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174131283] [2022-11-23 03:37:49,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174131283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:49,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:49,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:37:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477762086] [2022-11-23 03:37:49,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:49,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:37:49,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:37:49,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:37:49,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:37:49,981 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2022-11-23 03:37:49,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 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-23 03:37:49,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:49,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2022-11-23 03:37:49,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:50,819 INFO L130 PetriNetUnfolder]: 2757/4007 cut-off events. [2022-11-23 03:37:50,819 INFO L131 PetriNetUnfolder]: For 264/264 co-relation queries the response was YES. [2022-11-23 03:37:50,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8368 conditions, 4007 events. 2757/4007 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 20744 event pairs, 542 based on Foata normal form. 192/4037 useless extension candidates. Maximal degree in co-relation 8364. Up to 3074 conditions per place. [2022-11-23 03:37:50,846 INFO L137 encePairwiseOnDemand]: 283/290 looper letters, 36 selfloop transitions, 5 changer transitions 23/68 dead transitions. [2022-11-23 03:37:50,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 288 flow [2022-11-23 03:37:50,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:37:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 03:37:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 716 transitions. [2022-11-23 03:37:50,849 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49379310344827587 [2022-11-23 03:37:50,849 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 716 transitions. [2022-11-23 03:37:50,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 716 transitions. [2022-11-23 03:37:50,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:50,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 716 transitions. [2022-11-23 03:37:50,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:50,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:50,857 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:50,857 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 716 transitions. [2022-11-23 03:37:50,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 288 flow [2022-11-23 03:37:50,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 03:37:50,862 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 109 flow [2022-11-23 03:37:50,862 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-11-23 03:37:50,863 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2022-11-23 03:37:50,864 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 109 flow [2022-11-23 03:37:50,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 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-23 03:37:50,864 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:50,864 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:37:50,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-23 03:37:51,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:51,076 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:51,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:51,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1767179087, now seen corresponding path program 1 times [2022-11-23 03:37:51,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:37:51,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395441352] [2022-11-23 03:37:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:51,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:51,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:37:51,079 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:37:51,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-23 03:37:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:51,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 03:37:51,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:37:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:51,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:37:51,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:37:51,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395441352] [2022-11-23 03:37:51,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395441352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:51,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:51,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 03:37:51,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915484291] [2022-11-23 03:37:51,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:51,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 03:37:51,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:37:51,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 03:37:51,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 03:37:51,313 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2022-11-23 03:37:51,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:51,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:51,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2022-11-23 03:37:51,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:51,861 INFO L130 PetriNetUnfolder]: 1407/2198 cut-off events. [2022-11-23 03:37:51,862 INFO L131 PetriNetUnfolder]: For 884/884 co-relation queries the response was YES. [2022-11-23 03:37:51,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5967 conditions, 2198 events. 1407/2198 cut-off events. For 884/884 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11072 event pairs, 231 based on Foata normal form. 138/2265 useless extension candidates. Maximal degree in co-relation 5960. Up to 1054 conditions per place. [2022-11-23 03:37:51,874 INFO L137 encePairwiseOnDemand]: 283/290 looper letters, 47 selfloop transitions, 9 changer transitions 23/83 dead transitions. [2022-11-23 03:37:51,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 429 flow [2022-11-23 03:37:51,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:37:51,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-23 03:37:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 861 transitions. [2022-11-23 03:37:51,878 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49482758620689654 [2022-11-23 03:37:51,878 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 861 transitions. [2022-11-23 03:37:51,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 861 transitions. [2022-11-23 03:37:51,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:51,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 861 transitions. [2022-11-23 03:37:51,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:51,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:51,886 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:51,886 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 109 flow. Second operand 6 states and 861 transitions. [2022-11-23 03:37:51,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 429 flow [2022-11-23 03:37:51,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 83 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-23 03:37:51,894 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 174 flow [2022-11-23 03:37:51,895 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2022-11-23 03:37:51,895 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2022-11-23 03:37:51,896 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 174 flow [2022-11-23 03:37:51,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:51,896 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:51,896 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:37:51,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-23 03:37:52,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:52,108 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:52,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:52,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1220619799, now seen corresponding path program 1 times [2022-11-23 03:37:52,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:37:52,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679847910] [2022-11-23 03:37:52,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:52,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:52,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:37:52,111 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:37:52,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-23 03:37:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:52,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 03:37:52,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:37:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:52,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:37:52,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:37:52,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679847910] [2022-11-23 03:37:52,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679847910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:52,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:52,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:37:52,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111148169] [2022-11-23 03:37:52,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:52,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:37:52,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:37:52,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:37:52,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:37:52,352 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2022-11-23 03:37:52,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:52,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:52,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2022-11-23 03:37:52,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:52,872 INFO L130 PetriNetUnfolder]: 759/1244 cut-off events. [2022-11-23 03:37:52,872 INFO L131 PetriNetUnfolder]: For 1297/1297 co-relation queries the response was YES. [2022-11-23 03:37:52,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3902 conditions, 1244 events. 759/1244 cut-off events. For 1297/1297 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5716 event pairs, 169 based on Foata normal form. 57/1275 useless extension candidates. Maximal degree in co-relation 3893. Up to 419 conditions per place. [2022-11-23 03:37:52,881 INFO L137 encePairwiseOnDemand]: 283/290 looper letters, 56 selfloop transitions, 13 changer transitions 23/96 dead transitions. [2022-11-23 03:37:52,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 590 flow [2022-11-23 03:37:52,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:37:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:37:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1004 transitions. [2022-11-23 03:37:52,885 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4945812807881773 [2022-11-23 03:37:52,885 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1004 transitions. [2022-11-23 03:37:52,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1004 transitions. [2022-11-23 03:37:52,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:52,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1004 transitions. [2022-11-23 03:37:52,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.42857142857142) internal successors, (1004), 7 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:52,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:52,894 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:52,894 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 174 flow. Second operand 7 states and 1004 transitions. [2022-11-23 03:37:52,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 590 flow [2022-11-23 03:37:52,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 96 transitions, 528 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-11-23 03:37:52,912 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 224 flow [2022-11-23 03:37:52,912 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2022-11-23 03:37:52,913 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2022-11-23 03:37:52,913 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 224 flow [2022-11-23 03:37:52,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:52,914 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:52,914 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:37:52,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-23 03:37:53,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:53,127 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:53,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:53,127 INFO L85 PathProgramCache]: Analyzing trace with hash 673380387, now seen corresponding path program 1 times [2022-11-23 03:37:53,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:37:53,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819410752] [2022-11-23 03:37:53,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:53,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:53,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:37:53,129 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:37:53,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-23 03:37:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:53,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 03:37:53,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:37:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:53,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:37:53,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:37:53,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819410752] [2022-11-23 03:37:53,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1819410752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:53,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:53,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:37:53,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13866436] [2022-11-23 03:37:53,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:53,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:37:53,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:37:53,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:37:53,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:37:53,395 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2022-11-23 03:37:53,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 132.71428571428572) internal successors, (929), 7 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:53,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:53,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2022-11-23 03:37:53,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:54,001 INFO L130 PetriNetUnfolder]: 625/1010 cut-off events. [2022-11-23 03:37:54,001 INFO L131 PetriNetUnfolder]: For 1004/1004 co-relation queries the response was YES. [2022-11-23 03:37:54,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3042 conditions, 1010 events. 625/1010 cut-off events. For 1004/1004 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4427 event pairs, 164 based on Foata normal form. 12/1007 useless extension candidates. Maximal degree in co-relation 3032. Up to 400 conditions per place. [2022-11-23 03:37:54,009 INFO L137 encePairwiseOnDemand]: 283/290 looper letters, 52 selfloop transitions, 17 changer transitions 12/85 dead transitions. [2022-11-23 03:37:54,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 534 flow [2022-11-23 03:37:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 03:37:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 03:37:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1123 transitions. [2022-11-23 03:37:54,014 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.484051724137931 [2022-11-23 03:37:54,014 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1123 transitions. [2022-11-23 03:37:54,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1123 transitions. [2022-11-23 03:37:54,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:54,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1123 transitions. [2022-11-23 03:37:54,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 140.375) internal successors, (1123), 8 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:54,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 290.0) internal successors, (2610), 9 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:54,024 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 290.0) internal successors, (2610), 9 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:54,024 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 224 flow. Second operand 8 states and 1123 transitions. [2022-11-23 03:37:54,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 534 flow [2022-11-23 03:37:54,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 472 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-11-23 03:37:54,038 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 218 flow [2022-11-23 03:37:54,039 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2022-11-23 03:37:54,039 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2022-11-23 03:37:54,040 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 218 flow [2022-11-23 03:37:54,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 132.71428571428572) internal successors, (929), 7 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:54,040 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:54,041 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] [2022-11-23 03:37:54,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-23 03:37:54,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:54,253 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:54,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:54,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1997603903, now seen corresponding path program 1 times [2022-11-23 03:37:54,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:37:54,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593468521] [2022-11-23 03:37:54,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:37:54,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:54,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:37:54,256 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:37:54,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-23 03:37:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:37:54,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 03:37:54,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:37:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:54,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:37:54,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:37:54,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593468521] [2022-11-23 03:37:54,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593468521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:54,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:54,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:37:54,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996842331] [2022-11-23 03:37:54,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:54,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:37:54,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:37:54,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:37:54,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:37:54,495 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 290 [2022-11-23 03:37:54,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:54,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:54,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 290 [2022-11-23 03:37:54,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:54,923 INFO L130 PetriNetUnfolder]: 879/1480 cut-off events. [2022-11-23 03:37:54,924 INFO L131 PetriNetUnfolder]: For 2029/2029 co-relation queries the response was YES. [2022-11-23 03:37:54,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4357 conditions, 1480 events. 879/1480 cut-off events. For 2029/2029 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7554 event pairs, 145 based on Foata normal form. 0/1475 useless extension candidates. Maximal degree in co-relation 4346. Up to 777 conditions per place. [2022-11-23 03:37:54,936 INFO L137 encePairwiseOnDemand]: 287/290 looper letters, 82 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2022-11-23 03:37:54,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 87 transitions, 663 flow [2022-11-23 03:37:54,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:37:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:37:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-11-23 03:37:54,939 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5025862068965518 [2022-11-23 03:37:54,939 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 583 transitions. [2022-11-23 03:37:54,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 583 transitions. [2022-11-23 03:37:54,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:54,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 583 transitions. [2022-11-23 03:37:54,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:54,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:54,945 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:54,945 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 218 flow. Second operand 4 states and 583 transitions. [2022-11-23 03:37:54,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 87 transitions, 663 flow [2022-11-23 03:37:54,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 87 transitions, 522 flow, removed 38 selfloop flow, removed 7 redundant places. [2022-11-23 03:37:54,959 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 167 flow [2022-11-23 03:37:54,960 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2022-11-23 03:37:54,960 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2022-11-23 03:37:54,960 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 167 flow [2022-11-23 03:37:54,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:54,961 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:54,961 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] [2022-11-23 03:37:54,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-23 03:37:55,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:55,178 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:55,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:55,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1811024969, now seen corresponding path program 2 times [2022-11-23 03:37:55,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:37:55,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319633645] [2022-11-23 03:37:55,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 03:37:55,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:55,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:37:55,181 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:37:55,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-23 03:37:55,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 03:37:55,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:37:55,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 03:37:55,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:37:55,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:55,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:37:55,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:37:55,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319633645] [2022-11-23 03:37:55,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319633645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:55,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:55,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:37:55,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498419235] [2022-11-23 03:37:55,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:55,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:37:55,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:37:55,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:37:55,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:37:55,409 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 290 [2022-11-23 03:37:55,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:55,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:55,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 290 [2022-11-23 03:37:55,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:55,961 INFO L130 PetriNetUnfolder]: 1515/2361 cut-off events. [2022-11-23 03:37:55,961 INFO L131 PetriNetUnfolder]: For 1861/1861 co-relation queries the response was YES. [2022-11-23 03:37:55,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6735 conditions, 2361 events. 1515/2361 cut-off events. For 1861/1861 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12471 event pairs, 164 based on Foata normal form. 1/2328 useless extension candidates. Maximal degree in co-relation 6725. Up to 1266 conditions per place. [2022-11-23 03:37:55,980 INFO L137 encePairwiseOnDemand]: 287/290 looper letters, 83 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2022-11-23 03:37:55,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 89 transitions, 544 flow [2022-11-23 03:37:55,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:37:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:37:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 584 transitions. [2022-11-23 03:37:55,983 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2022-11-23 03:37:55,983 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 584 transitions. [2022-11-23 03:37:55,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 584 transitions. [2022-11-23 03:37:55,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:55,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 584 transitions. [2022-11-23 03:37:55,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:55,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:55,989 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:55,989 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 167 flow. Second operand 4 states and 584 transitions. [2022-11-23 03:37:55,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 89 transitions, 544 flow [2022-11-23 03:37:56,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 89 transitions, 542 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:37:56,016 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 179 flow [2022-11-23 03:37:56,017 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-11-23 03:37:56,017 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2022-11-23 03:37:56,018 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 179 flow [2022-11-23 03:37:56,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:56,018 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:56,018 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] [2022-11-23 03:37:56,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-23 03:37:56,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:56,231 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:56,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:56,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1985159741, now seen corresponding path program 3 times [2022-11-23 03:37:56,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:37:56,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363824193] [2022-11-23 03:37:56,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 03:37:56,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:56,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:37:56,234 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:37:56,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-23 03:37:56,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 03:37:56,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:37:56,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 03:37:56,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:37:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:56,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:37:56,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:37:56,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363824193] [2022-11-23 03:37:56,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363824193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:56,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:56,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 03:37:56,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345286498] [2022-11-23 03:37:56,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:56,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:37:56,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:37:56,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:37:56,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:37:56,755 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2022-11-23 03:37:56,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 179 flow. Second operand has 7 states, 7 states have (on average 133.14285714285714) internal successors, (932), 7 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:56,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:56,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2022-11-23 03:37:56,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:57,356 INFO L130 PetriNetUnfolder]: 1441/2409 cut-off events. [2022-11-23 03:37:57,356 INFO L131 PetriNetUnfolder]: For 2365/2365 co-relation queries the response was YES. [2022-11-23 03:37:57,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7265 conditions, 2409 events. 1441/2409 cut-off events. For 2365/2365 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 13443 event pairs, 190 based on Foata normal form. 1/2354 useless extension candidates. Maximal degree in co-relation 7253. Up to 872 conditions per place. [2022-11-23 03:37:57,372 INFO L137 encePairwiseOnDemand]: 284/290 looper letters, 87 selfloop transitions, 6 changer transitions 0/99 dead transitions. [2022-11-23 03:37:57,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 99 transitions, 633 flow [2022-11-23 03:37:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:37:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 03:37:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 968 transitions. [2022-11-23 03:37:57,376 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4768472906403941 [2022-11-23 03:37:57,376 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 968 transitions. [2022-11-23 03:37:57,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 968 transitions. [2022-11-23 03:37:57,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:57,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 968 transitions. [2022-11-23 03:37:57,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.28571428571428) internal successors, (968), 7 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:57,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:57,383 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:57,383 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 179 flow. Second operand 7 states and 968 transitions. [2022-11-23 03:37:57,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 99 transitions, 633 flow [2022-11-23 03:37:57,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 99 transitions, 630 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 03:37:57,409 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 202 flow [2022-11-23 03:37:57,409 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2022-11-23 03:37:57,410 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2022-11-23 03:37:57,410 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 202 flow [2022-11-23 03:37:57,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 133.14285714285714) internal successors, (932), 7 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:57,410 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:57,411 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] [2022-11-23 03:37:57,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-23 03:37:57,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:57,623 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:57,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:57,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1908268767, now seen corresponding path program 4 times [2022-11-23 03:37:57,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:37:57,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936574361] [2022-11-23 03:37:57,624 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 03:37:57,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:57,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:37:57,625 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:37:57,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-23 03:37:57,771 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 03:37:57,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 03:37:57,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 03:37:57,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:37:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:37:57,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:37:57,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 03:37:57,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936574361] [2022-11-23 03:37:57,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936574361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:37:57,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:37:57,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:37:57,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986970038] [2022-11-23 03:37:57,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:37:57,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:37:57,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 03:37:57,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:37:57,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:37:57,810 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 290 [2022-11-23 03:37:57,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:57,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:37:57,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 290 [2022-11-23 03:37:57,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:37:58,362 INFO L130 PetriNetUnfolder]: 2398/4028 cut-off events. [2022-11-23 03:37:58,362 INFO L131 PetriNetUnfolder]: For 4690/4690 co-relation queries the response was YES. [2022-11-23 03:37:58,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13128 conditions, 4028 events. 2398/4028 cut-off events. For 4690/4690 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 25298 event pairs, 773 based on Foata normal form. 1/3916 useless extension candidates. Maximal degree in co-relation 13114. Up to 2035 conditions per place. [2022-11-23 03:37:58,395 INFO L137 encePairwiseOnDemand]: 287/290 looper letters, 67 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2022-11-23 03:37:58,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 74 transitions, 484 flow [2022-11-23 03:37:58,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:37:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:37:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2022-11-23 03:37:58,397 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.506896551724138 [2022-11-23 03:37:58,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2022-11-23 03:37:58,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2022-11-23 03:37:58,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:37:58,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2022-11-23 03:37:58,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:58,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:58,402 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:58,402 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 202 flow. Second operand 3 states and 441 transitions. [2022-11-23 03:37:58,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 74 transitions, 484 flow [2022-11-23 03:37:58,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 476 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-23 03:37:58,476 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 208 flow [2022-11-23 03:37:58,477 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2022-11-23 03:37:58,477 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2022-11-23 03:37:58,477 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 208 flow [2022-11-23 03:37:58,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 03:37:58,478 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:37:58,478 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] [2022-11-23 03:37:58,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-23 03:37:58,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:58,690 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 03:37:58,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:37:58,690 INFO L85 PathProgramCache]: Analyzing trace with hash -153691627, now seen corresponding path program 5 times [2022-11-23 03:37:58,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 03:37:58,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44253111] [2022-11-23 03:37:58,691 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-23 03:37:58,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:58,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 03:37:58,692 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 03:37:58,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-23 03:37:58,840 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 03:37:58,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-23 03:37:58,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 03:37:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 03:37:58,991 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-23 03:37:58,992 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 03:37:58,993 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-23 03:37:58,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-23 03:37:58,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-23 03:37:58,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-23 03:37:58,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-23 03:37:58,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-23 03:37:58,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-23 03:37:58,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-23 03:37:58,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-23 03:37:58,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-23 03:37:58,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-23 03:37:58,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-23 03:37:58,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-23 03:37:58,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-23 03:37:58,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-23 03:37:58,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-23 03:37:59,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-23 03:37:59,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 03:37:59,211 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2022-11-23 03:37:59,217 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 03:37:59,217 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 03:37:59,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:37:59 BasicIcfg [2022-11-23 03:37:59,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 03:37:59,364 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 03:37:59,364 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 03:37:59,364 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 03:37:59,365 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:37:36" (3/4) ... [2022-11-23 03:37:59,368 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 03:37:59,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 03:37:59,369 INFO L158 Benchmark]: Toolchain (without parser) took 24965.57ms. Allocated memory was 67.1MB in the beginning and 755.0MB in the end (delta: 687.9MB). Free memory was 42.7MB in the beginning and 218.2MB in the end (delta: -175.4MB). Peak memory consumption was 511.7MB. Max. memory is 16.1GB. [2022-11-23 03:37:59,369 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 67.1MB. Free memory is still 45.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:37:59,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 643.32ms. Allocated memory was 67.1MB in the beginning and 100.7MB in the end (delta: 33.6MB). Free memory was 42.5MB in the beginning and 72.2MB in the end (delta: -29.7MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2022-11-23 03:37:59,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.36ms. Allocated memory is still 100.7MB. Free memory was 72.2MB in the beginning and 69.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:37:59,370 INFO L158 Benchmark]: Boogie Preprocessor took 73.24ms. Allocated memory is still 100.7MB. Free memory was 69.8MB in the beginning and 67.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 03:37:59,371 INFO L158 Benchmark]: RCFGBuilder took 919.72ms. Allocated memory is still 100.7MB. Free memory was 67.2MB in the beginning and 58.5MB in the end (delta: 8.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 03:37:59,371 INFO L158 Benchmark]: TraceAbstraction took 23256.08ms. Allocated memory was 100.7MB in the beginning and 755.0MB in the end (delta: 654.3MB). Free memory was 57.3MB in the beginning and 218.2MB in the end (delta: -160.9MB). Peak memory consumption was 492.5MB. Max. memory is 16.1GB. [2022-11-23 03:37:59,371 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 755.0MB. Free memory is still 218.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 03:37:59,373 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.28ms. Allocated memory is still 67.1MB. Free memory is still 45.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 643.32ms. Allocated memory was 67.1MB in the beginning and 100.7MB in the end (delta: 33.6MB). Free memory was 42.5MB in the beginning and 72.2MB in the end (delta: -29.7MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.36ms. Allocated memory is still 100.7MB. Free memory was 72.2MB in the beginning and 69.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.24ms. Allocated memory is still 100.7MB. Free memory was 69.8MB in the beginning and 67.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 919.72ms. Allocated memory is still 100.7MB. Free memory was 67.2MB in the beginning and 58.5MB in the end (delta: 8.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 23256.08ms. Allocated memory was 100.7MB in the beginning and 755.0MB in the end (delta: 654.3MB). Free memory was 57.3MB in the beginning and 218.2MB in the end (delta: -160.9MB). Peak memory consumption was 492.5MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 755.0MB. Free memory is still 218.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.0s, 156 PlacesBefore, 51 PlacesAfterwards, 145 TransitionsBefore, 39 TransitionsAfterwards, 3396 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 141 TotalNumberOfCompositions, 8986 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4816, independent: 4605, independent conditional: 0, independent unconditional: 4605, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2534, independent: 2474, independent conditional: 0, independent unconditional: 2474, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2534, independent: 2451, independent conditional: 0, independent unconditional: 2451, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 429, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 381, dependent conditional: 0, dependent unconditional: 381, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4816, independent: 2131, independent conditional: 0, independent unconditional: 2131, dependent: 151, dependent conditional: 0, dependent unconditional: 151, unknown: 2534, unknown conditional: 0, unknown unconditional: 2534] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 314, Positive conditional cache size: 0, Positive unconditional cache size: 314, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t693; [L857] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t693, ((void *)0), P0, ((void *)0))=-1, t693={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L858] 0 pthread_t t694; [L859] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t694, ((void *)0), P1, ((void *)0))=0, t693={11:0}, t694={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L860] 0 pthread_t t695; [L861] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t695, ((void *)0), P2, ((void *)0))=1, t693={11:0}, t694={15:0}, t695={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L805] 3 y$r_buff0_thd3 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L862] 0 pthread_t t696; [L863] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t696, ((void *)0), P3, ((void *)0))=2, t693={11:0}, t694={15:0}, t695={7:0}, t696={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L808] 3 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L825] 4 z = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L831] 4 __unbuffered_p3_EBX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L752] 1 a = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L755] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 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) [L775] 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)) [L776] 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)) [L777] 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)) [L778] 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)) [L779] 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)) [L780] 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)) [L781] 2 __unbuffered_p1_EAX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L834] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L835] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L836] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L837] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L838] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L870] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L871] 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 [L872] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693={11:0}, t694={15:0}, t695={7:0}, t696={-2147483637:0}, weak$$choice0=2, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L876] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=2, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 863]: 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: 859]: 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: 861]: 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 9 procedures, 184 locations, 16 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: 23.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 412 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 342 mSDsluCounter, 144 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1677 IncrementalHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 14 mSDtfsCounter, 1677 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=5, InterpolantAutomatonStates: 49, 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.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 651 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1470 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 could not prove your program: unable to determine feasibility of some traces [2022-11-23 03:37:59,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da54e0d-b1b8-4827-9535-f689cf7ee830/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample