./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b 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_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN --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 67d3e2c6779f32015be5c9fe966e6a739e1c762dcde7f287ad383839eb490e84 --- 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-6b4ec56 [2022-11-20 09:30:16,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:30:16,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:30:16,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:30:16,113 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:30:16,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:30:16,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:30:16,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:30:16,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:30:16,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:30:16,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:30:16,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:30:16,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:30:16,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:30:16,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:30:16,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:30:16,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:30:16,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:30:16,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:30:16,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:30:16,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:30:16,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:30:16,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:30:16,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:30:16,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:30:16,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:30:16,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:30:16,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:30:16,169 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:30:16,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:30:16,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:30:16,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:30:16,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:30:16,174 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:30:16,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:30:16,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:30:16,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:30:16,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:30:16,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:30:16,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:30:16,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:30:16,180 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 09:30:16,217 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:30:16,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:30:16,218 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:30:16,218 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:30:16,219 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:30:16,219 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:30:16,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:30:16,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:30:16,221 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:30:16,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:30:16,222 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:30:16,222 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:30:16,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:30:16,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:30:16,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:30:16,223 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 09:30:16,223 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 09:30:16,224 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 09:30:16,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:30:16,224 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 09:30:16,224 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:30:16,225 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:30:16,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:30:16,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:30:16,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:30:16,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:30:16,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:30:16,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:30:16,227 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:30:16,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:30:16,227 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN 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 -> 67d3e2c6779f32015be5c9fe966e6a739e1c762dcde7f287ad383839eb490e84 [2022-11-20 09:30:16,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:30:16,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:30:16,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:30:16,626 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:30:16,627 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:30:16,629 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i [2022-11-20 09:30:19,651 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:30:19,937 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:30:19,941 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i [2022-11-20 09:30:19,959 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/data/8685a9638/fa2401c0846044f6944bf80e60e5f973/FLAG9db5b84b8 [2022-11-20 09:30:19,982 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/data/8685a9638/fa2401c0846044f6944bf80e60e5f973 [2022-11-20 09:30:19,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:30:19,987 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:30:19,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:30:19,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:30:19,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:30:19,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:30:19" (1/1) ... [2022-11-20 09:30:19,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2302ac14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:19, skipping insertion in model container [2022-11-20 09:30:19,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:30:19" (1/1) ... [2022-11-20 09:30:20,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:30:20,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:30:20,232 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_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i[995,1008] [2022-11-20 09:30:20,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:30:20,606 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:30:20,621 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_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i[995,1008] [2022-11-20 09:30:20,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:30:20,767 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:30:20,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:20 WrapperNode [2022-11-20 09:30:20,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:30:20,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:30:20,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:30:20,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:30:20,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:20" (1/1) ... [2022-11-20 09:30:20,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:20" (1/1) ... [2022-11-20 09:30:20,840 INFO L138 Inliner]: procedures = 176, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2022-11-20 09:30:20,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:30:20,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:30:20,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:30:20,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:30:20,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:20" (1/1) ... [2022-11-20 09:30:20,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:20" (1/1) ... [2022-11-20 09:30:20,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:20" (1/1) ... [2022-11-20 09:30:20,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:20" (1/1) ... [2022-11-20 09:30:20,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:20" (1/1) ... [2022-11-20 09:30:20,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:20" (1/1) ... [2022-11-20 09:30:20,911 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:20" (1/1) ... [2022-11-20 09:30:20,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:20" (1/1) ... [2022-11-20 09:30:20,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:30:20,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:30:20,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:30:20,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:30:20,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:20" (1/1) ... [2022-11-20 09:30:20,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:30:20,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:30:20,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:30:20,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:30:21,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 09:30:21,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 09:30:21,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 09:30:21,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:30:21,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:30:21,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:30:21,024 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 09:30:21,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 09:30:21,024 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 09:30:21,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 09:30:21,024 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 09:30:21,025 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 09:30:21,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:30:21,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 09:30:21,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:30:21,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:30:21,027 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 09:30:21,248 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:30:21,250 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:30:21,949 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:30:22,997 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:30:22,997 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 09:30:23,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:30:23 BoogieIcfgContainer [2022-11-20 09:30:23,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:30:23,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:30:23,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:30:23,008 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:30:23,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:30:19" (1/3) ... [2022-11-20 09:30:23,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d2bb7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:30:23, skipping insertion in model container [2022-11-20 09:30:23,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:20" (2/3) ... [2022-11-20 09:30:23,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d2bb7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:30:23, skipping insertion in model container [2022-11-20 09:30:23,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:30:23" (3/3) ... [2022-11-20 09:30:23,014 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.oepc.i [2022-11-20 09:30:23,035 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:30:23,035 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2022-11-20 09:30:23,036 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:30:23,279 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 09:30:23,327 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 09:30:23,345 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 199 transitions, 413 flow [2022-11-20 09:30:23,351 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 199 transitions, 413 flow [2022-11-20 09:30:23,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 199 transitions, 413 flow [2022-11-20 09:30:23,475 INFO L130 PetriNetUnfolder]: 2/196 cut-off events. [2022-11-20 09:30:23,475 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:30:23,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 196 events. 2/196 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 376 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2022-11-20 09:30:23,488 INFO L119 LiptonReduction]: Number of co-enabled transitions 9828 [2022-11-20 09:31:05,377 INFO L134 LiptonReduction]: Checked pairs total: 38051 [2022-11-20 09:31:05,377 INFO L136 LiptonReduction]: Total number of compositions: 197 [2022-11-20 09:31:05,390 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 95 transitions, 205 flow [2022-11-20 09:31:10,291 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 137812 states, 90058 states have (on average 5.824968353727598) internal successors, (524585), 137811 states have internal predecessors, (524585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:10,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:31:10,383 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=FINITE_AUTOMATA, 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;@29514bac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:31:10,396 INFO L358 AbstractCegarLoop]: Starting to check reachability of 109 error locations. [2022-11-20 09:31:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 137812 states, 90058 states have (on average 5.824968353727598) internal successors, (524585), 137811 states have internal predecessors, (524585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:10,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 09:31:10,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:10,626 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 09:31:10,627 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:10,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:10,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1399, now seen corresponding path program 1 times [2022-11-20 09:31:10,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:10,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715046993] [2022-11-20 09:31:10,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:10,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:31:10,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:10,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715046993] [2022-11-20 09:31:10,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715046993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:10,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:10,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 09:31:10,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348348652] [2022-11-20 09:31:10,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:10,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:31:10,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:10,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:31:10,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:31:11,213 INFO L87 Difference]: Start difference. First operand has 137812 states, 90058 states have (on average 5.824968353727598) internal successors, (524585), 137811 states have internal predecessors, (524585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:11,953 INFO L93 Difference]: Finished difference Result 11426 states and 40738 transitions. [2022-11-20 09:31:11,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:31:11,968 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-20 09:31:11,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:12,100 INFO L225 Difference]: With dead ends: 11426 [2022-11-20 09:31:12,101 INFO L226 Difference]: Without dead ends: 11426 [2022-11-20 09:31:12,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:31:12,106 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:12,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:31:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11426 states. [2022-11-20 09:31:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11426 to 11426. [2022-11-20 09:31:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11426 states, 10041 states have (on average 4.0571656209540885) internal successors, (40738), 11425 states have internal predecessors, (40738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11426 states to 11426 states and 40738 transitions. [2022-11-20 09:31:12,748 INFO L78 Accepts]: Start accepts. Automaton has 11426 states and 40738 transitions. Word has length 1 [2022-11-20 09:31:12,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:12,748 INFO L495 AbstractCegarLoop]: Abstraction has 11426 states and 40738 transitions. [2022-11-20 09:31:12,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 11426 states and 40738 transitions. [2022-11-20 09:31:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 09:31:12,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:12,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 09:31:12,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:31:12,750 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:12,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:12,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1380910, now seen corresponding path program 1 times [2022-11-20 09:31:12,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:12,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216331974] [2022-11-20 09:31:12,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:12,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:13,089 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-20 09:31:13,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:13,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216331974] [2022-11-20 09:31:13,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216331974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:13,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:13,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:31:13,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274749542] [2022-11-20 09:31:13,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:13,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:31:13,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:13,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:31:13,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:13,099 INFO L87 Difference]: Start difference. First operand 11426 states and 40738 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:13,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:13,521 INFO L93 Difference]: Finished difference Result 7361 states and 23398 transitions. [2022-11-20 09:31:13,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:13,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 09:31:13,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:13,576 INFO L225 Difference]: With dead ends: 7361 [2022-11-20 09:31:13,576 INFO L226 Difference]: Without dead ends: 7349 [2022-11-20 09:31:13,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:13,578 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:13,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 4 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:31:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7349 states. [2022-11-20 09:31:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7349 to 6401. [2022-11-20 09:31:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6401 states, 6054 states have (on average 3.618103733069045) internal successors, (21904), 6400 states have internal predecessors, (21904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6401 states to 6401 states and 21904 transitions. [2022-11-20 09:31:14,055 INFO L78 Accepts]: Start accepts. Automaton has 6401 states and 21904 transitions. Word has length 3 [2022-11-20 09:31:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:14,055 INFO L495 AbstractCegarLoop]: Abstraction has 6401 states and 21904 transitions. [2022-11-20 09:31:14,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 6401 states and 21904 transitions. [2022-11-20 09:31:14,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 09:31:14,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:14,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 09:31:14,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:31:14,058 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:14,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:14,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1380911, now seen corresponding path program 1 times [2022-11-20 09:31:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:14,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949665395] [2022-11-20 09:31:14,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:14,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:14,237 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-20 09:31:14,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:14,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949665395] [2022-11-20 09:31:14,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949665395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:14,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:14,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:31:14,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693418322] [2022-11-20 09:31:14,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:14,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:31:14,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:14,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:31:14,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:14,240 INFO L87 Difference]: Start difference. First operand 6401 states and 21904 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:14,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:14,382 INFO L93 Difference]: Finished difference Result 2998 states and 9365 transitions. [2022-11-20 09:31:14,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:14,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 09:31:14,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:14,396 INFO L225 Difference]: With dead ends: 2998 [2022-11-20 09:31:14,396 INFO L226 Difference]: Without dead ends: 2924 [2022-11-20 09:31:14,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:14,397 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:14,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:31:14,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2022-11-20 09:31:14,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2924. [2022-11-20 09:31:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2924 states, 2842 states have (on average 3.20935960591133) internal successors, (9121), 2923 states have internal predecessors, (9121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 9121 transitions. [2022-11-20 09:31:14,483 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 9121 transitions. Word has length 3 [2022-11-20 09:31:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:14,484 INFO L495 AbstractCegarLoop]: Abstraction has 2924 states and 9121 transitions. [2022-11-20 09:31:14,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:14,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 9121 transitions. [2022-11-20 09:31:14,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:31:14,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:14,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:14,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:31:14,487 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:14,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:14,487 INFO L85 PathProgramCache]: Analyzing trace with hash 869064694, now seen corresponding path program 1 times [2022-11-20 09:31:14,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:14,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703477485] [2022-11-20 09:31:14,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:14,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:14,765 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-20 09:31:14,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:14,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703477485] [2022-11-20 09:31:14,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703477485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:14,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:14,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:31:14,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043392146] [2022-11-20 09:31:14,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:14,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:31:14,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:14,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:31:14,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:14,768 INFO L87 Difference]: Start difference. First operand 2924 states and 9121 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:14,937 INFO L93 Difference]: Finished difference Result 2874 states and 8941 transitions. [2022-11-20 09:31:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:14,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 09:31:14,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:14,950 INFO L225 Difference]: With dead ends: 2874 [2022-11-20 09:31:14,951 INFO L226 Difference]: Without dead ends: 2874 [2022-11-20 09:31:14,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:14,954 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:14,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:31:14,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2022-11-20 09:31:15,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 2874. [2022-11-20 09:31:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2874 states, 2792 states have (on average 3.2023638968481376) internal successors, (8941), 2873 states have internal predecessors, (8941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:15,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2874 states and 8941 transitions. [2022-11-20 09:31:15,038 INFO L78 Accepts]: Start accepts. Automaton has 2874 states and 8941 transitions. Word has length 11 [2022-11-20 09:31:15,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:15,040 INFO L495 AbstractCegarLoop]: Abstraction has 2874 states and 8941 transitions. [2022-11-20 09:31:15,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2874 states and 8941 transitions. [2022-11-20 09:31:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:31:15,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:15,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:15,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:31:15,045 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:15,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:15,045 INFO L85 PathProgramCache]: Analyzing trace with hash 869064943, now seen corresponding path program 1 times [2022-11-20 09:31:15,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:15,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735238726] [2022-11-20 09:31:15,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:15,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:15,158 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-20 09:31:15,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:15,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735238726] [2022-11-20 09:31:15,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735238726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:15,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:15,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:31:15,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111513278] [2022-11-20 09:31:15,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:15,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:31:15,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:15,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:31:15,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:15,165 INFO L87 Difference]: Start difference. First operand 2874 states and 8941 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:15,368 INFO L93 Difference]: Finished difference Result 2864 states and 8903 transitions. [2022-11-20 09:31:15,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:15,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 09:31:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:15,386 INFO L225 Difference]: With dead ends: 2864 [2022-11-20 09:31:15,386 INFO L226 Difference]: Without dead ends: 2864 [2022-11-20 09:31:15,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:15,388 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:15,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:31:15,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2022-11-20 09:31:15,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2864. [2022-11-20 09:31:15,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2864 states, 2782 states have (on average 3.200215672178289) internal successors, (8903), 2863 states have internal predecessors, (8903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:15,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 8903 transitions. [2022-11-20 09:31:15,471 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 8903 transitions. Word has length 11 [2022-11-20 09:31:15,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:15,471 INFO L495 AbstractCegarLoop]: Abstraction has 2864 states and 8903 transitions. [2022-11-20 09:31:15,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:15,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 8903 transitions. [2022-11-20 09:31:15,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 09:31:15,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:15,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:15,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:31:15,478 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:15,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:15,479 INFO L85 PathProgramCache]: Analyzing trace with hash -712774265, now seen corresponding path program 1 times [2022-11-20 09:31:15,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:15,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423326252] [2022-11-20 09:31:15,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:15,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:15,774 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-20 09:31:15,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:15,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423326252] [2022-11-20 09:31:15,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423326252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:15,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:15,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:31:15,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378125217] [2022-11-20 09:31:15,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:15,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:31:15,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:15,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:31:15,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:31:15,778 INFO L87 Difference]: Start difference. First operand 2864 states and 8903 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:15,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:15,990 INFO L93 Difference]: Finished difference Result 2789 states and 8658 transitions. [2022-11-20 09:31:15,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:15,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 09:31:15,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:16,004 INFO L225 Difference]: With dead ends: 2789 [2022-11-20 09:31:16,005 INFO L226 Difference]: Without dead ends: 2789 [2022-11-20 09:31:16,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:31:16,006 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:16,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 5 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:31:16,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2022-11-20 09:31:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 2789. [2022-11-20 09:31:16,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2708 states have (on average 3.1971935007385524) internal successors, (8658), 2788 states have internal predecessors, (8658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 8658 transitions. [2022-11-20 09:31:16,159 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 8658 transitions. Word has length 12 [2022-11-20 09:31:16,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:16,160 INFO L495 AbstractCegarLoop]: Abstraction has 2789 states and 8658 transitions. [2022-11-20 09:31:16,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 8658 transitions. [2022-11-20 09:31:16,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 09:31:16,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:16,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:16,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:31:16,163 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:16,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:16,163 INFO L85 PathProgramCache]: Analyzing trace with hash -712774264, now seen corresponding path program 1 times [2022-11-20 09:31:16,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:16,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989900532] [2022-11-20 09:31:16,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:16,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:16,850 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-20 09:31:16,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:16,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989900532] [2022-11-20 09:31:16,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989900532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:16,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:16,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:31:16,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439339554] [2022-11-20 09:31:16,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:16,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:31:16,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:16,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:31:16,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:31:16,856 INFO L87 Difference]: Start difference. First operand 2789 states and 8658 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:17,077 INFO L93 Difference]: Finished difference Result 2714 states and 8413 transitions. [2022-11-20 09:31:17,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:31:17,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 09:31:17,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:17,091 INFO L225 Difference]: With dead ends: 2714 [2022-11-20 09:31:17,091 INFO L226 Difference]: Without dead ends: 2714 [2022-11-20 09:31:17,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:31:17,092 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:17,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 3 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:31:17,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2022-11-20 09:31:17,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2714. [2022-11-20 09:31:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2714 states, 2634 states have (on average 3.194001518602885) internal successors, (8413), 2713 states have internal predecessors, (8413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 8413 transitions. [2022-11-20 09:31:17,225 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 8413 transitions. Word has length 12 [2022-11-20 09:31:17,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:17,225 INFO L495 AbstractCegarLoop]: Abstraction has 2714 states and 8413 transitions. [2022-11-20 09:31:17,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 8413 transitions. [2022-11-20 09:31:17,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 09:31:17,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:17,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:17,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:31:17,227 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:17,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:17,227 INFO L85 PathProgramCache]: Analyzing trace with hash 163431391, now seen corresponding path program 1 times [2022-11-20 09:31:17,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:17,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964822238] [2022-11-20 09:31:17,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:17,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:17,423 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-20 09:31:17,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:17,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964822238] [2022-11-20 09:31:17,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964822238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:17,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:17,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:31:17,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396697576] [2022-11-20 09:31:17,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:17,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:31:17,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:17,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:31:17,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:17,426 INFO L87 Difference]: Start difference. First operand 2714 states and 8413 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:17,568 INFO L93 Difference]: Finished difference Result 2696 states and 8350 transitions. [2022-11-20 09:31:17,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:17,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 09:31:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:17,580 INFO L225 Difference]: With dead ends: 2696 [2022-11-20 09:31:17,580 INFO L226 Difference]: Without dead ends: 2696 [2022-11-20 09:31:17,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:17,581 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 16 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:17,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 10 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:31:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2022-11-20 09:31:17,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2696. [2022-11-20 09:31:17,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2696 states, 2616 states have (on average 3.191896024464832) internal successors, (8350), 2695 states have internal predecessors, (8350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:17,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 8350 transitions. [2022-11-20 09:31:17,651 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 8350 transitions. Word has length 12 [2022-11-20 09:31:17,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:17,651 INFO L495 AbstractCegarLoop]: Abstraction has 2696 states and 8350 transitions. [2022-11-20 09:31:17,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 8350 transitions. [2022-11-20 09:31:17,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:31:17,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:17,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:17,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 09:31:17,653 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:17,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:17,654 INFO L85 PathProgramCache]: Analyzing trace with hash 768776099, now seen corresponding path program 1 times [2022-11-20 09:31:17,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:17,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842574572] [2022-11-20 09:31:17,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:17,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:18,535 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-20 09:31:18,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:18,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842574572] [2022-11-20 09:31:18,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842574572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:18,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:18,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:31:18,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257858133] [2022-11-20 09:31:18,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:18,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:31:18,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:18,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:31:18,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:31:18,538 INFO L87 Difference]: Start difference. First operand 2696 states and 8350 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:18,801 INFO L93 Difference]: Finished difference Result 2680 states and 8294 transitions. [2022-11-20 09:31:18,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:18,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 09:31:18,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:18,813 INFO L225 Difference]: With dead ends: 2680 [2022-11-20 09:31:18,813 INFO L226 Difference]: Without dead ends: 2680 [2022-11-20 09:31:18,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:31:18,814 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:18,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:31:18,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2022-11-20 09:31:18,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 2680. [2022-11-20 09:31:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2680 states, 2600 states have (on average 3.19) internal successors, (8294), 2679 states have internal predecessors, (8294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:18,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 8294 transitions. [2022-11-20 09:31:18,880 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 8294 transitions. Word has length 13 [2022-11-20 09:31:18,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:18,881 INFO L495 AbstractCegarLoop]: Abstraction has 2680 states and 8294 transitions. [2022-11-20 09:31:18,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:18,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 8294 transitions. [2022-11-20 09:31:18,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:31:18,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:18,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:18,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 09:31:18,882 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:18,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:18,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1947793099, now seen corresponding path program 1 times [2022-11-20 09:31:18,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:18,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642995742] [2022-11-20 09:31:18,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:18,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:19,057 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-20 09:31:19,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:19,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642995742] [2022-11-20 09:31:19,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642995742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:19,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:19,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:31:19,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603428142] [2022-11-20 09:31:19,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:19,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:31:19,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:19,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:31:19,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:31:19,060 INFO L87 Difference]: Start difference. First operand 2680 states and 8294 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:19,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:19,278 INFO L93 Difference]: Finished difference Result 2616 states and 7538 transitions. [2022-11-20 09:31:19,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:31:19,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 09:31:19,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:19,288 INFO L225 Difference]: With dead ends: 2616 [2022-11-20 09:31:19,289 INFO L226 Difference]: Without dead ends: 2616 [2022-11-20 09:31:19,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:31:19,290 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:19,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 8 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:31:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2022-11-20 09:31:19,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2218. [2022-11-20 09:31:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 2138 states have (on average 3.155753040224509) internal successors, (6747), 2217 states have internal predecessors, (6747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:19,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 6747 transitions. [2022-11-20 09:31:19,347 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 6747 transitions. Word has length 13 [2022-11-20 09:31:19,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:19,348 INFO L495 AbstractCegarLoop]: Abstraction has 2218 states and 6747 transitions. [2022-11-20 09:31:19,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:19,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 6747 transitions. [2022-11-20 09:31:19,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:31:19,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:19,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:19,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 09:31:19,350 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:19,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:19,350 INFO L85 PathProgramCache]: Analyzing trace with hash 650674453, now seen corresponding path program 1 times [2022-11-20 09:31:19,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:19,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003689895] [2022-11-20 09:31:19,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:19,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:19,466 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-20 09:31:19,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:19,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003689895] [2022-11-20 09:31:19,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003689895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:19,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:19,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:31:19,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910909639] [2022-11-20 09:31:19,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:19,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:31:19,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:19,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:31:19,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:19,469 INFO L87 Difference]: Start difference. First operand 2218 states and 6747 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:19,657 INFO L93 Difference]: Finished difference Result 2984 states and 8872 transitions. [2022-11-20 09:31:19,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:19,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 09:31:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:19,670 INFO L225 Difference]: With dead ends: 2984 [2022-11-20 09:31:19,670 INFO L226 Difference]: Without dead ends: 2984 [2022-11-20 09:31:19,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:19,671 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:19,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:31:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2022-11-20 09:31:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2354. [2022-11-20 09:31:19,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2354 states, 2274 states have (on average 3.1402814423922605) internal successors, (7141), 2353 states have internal predecessors, (7141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 7141 transitions. [2022-11-20 09:31:19,738 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 7141 transitions. Word has length 14 [2022-11-20 09:31:19,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:19,739 INFO L495 AbstractCegarLoop]: Abstraction has 2354 states and 7141 transitions. [2022-11-20 09:31:19,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:19,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 7141 transitions. [2022-11-20 09:31:19,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:31:19,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:19,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:19,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 09:31:19,741 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:19,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:19,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1039959284, now seen corresponding path program 1 times [2022-11-20 09:31:19,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:19,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25588383] [2022-11-20 09:31:19,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:19,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:21,663 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-20 09:31:21,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:21,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25588383] [2022-11-20 09:31:21,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25588383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:21,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:21,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:31:21,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288461311] [2022-11-20 09:31:21,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:21,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:31:21,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:21,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:31:21,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:31:21,666 INFO L87 Difference]: Start difference. First operand 2354 states and 7141 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:22,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:22,037 INFO L93 Difference]: Finished difference Result 3071 states and 9383 transitions. [2022-11-20 09:31:22,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:31:22,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 09:31:22,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:22,053 INFO L225 Difference]: With dead ends: 3071 [2022-11-20 09:31:22,054 INFO L226 Difference]: Without dead ends: 3071 [2022-11-20 09:31:22,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:31:22,055 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 92 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:22,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:31:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2022-11-20 09:31:22,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 2387. [2022-11-20 09:31:22,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2387 states, 2307 states have (on average 3.1439098396185523) internal successors, (7253), 2386 states have internal predecessors, (7253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:22,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2387 states and 7253 transitions. [2022-11-20 09:31:22,143 INFO L78 Accepts]: Start accepts. Automaton has 2387 states and 7253 transitions. Word has length 14 [2022-11-20 09:31:22,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:22,143 INFO L495 AbstractCegarLoop]: Abstraction has 2387 states and 7253 transitions. [2022-11-20 09:31:22,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 7253 transitions. [2022-11-20 09:31:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:31:22,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:22,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:22,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 09:31:22,146 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:22,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:22,147 INFO L85 PathProgramCache]: Analyzing trace with hash 252046759, now seen corresponding path program 1 times [2022-11-20 09:31:22,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:22,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635894736] [2022-11-20 09:31:22,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:22,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:22,908 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-20 09:31:22,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:22,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635894736] [2022-11-20 09:31:22,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635894736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:22,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:22,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:31:22,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127995827] [2022-11-20 09:31:22,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:22,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:31:22,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:22,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:31:22,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:31:22,912 INFO L87 Difference]: Start difference. First operand 2387 states and 7253 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:23,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:23,778 INFO L93 Difference]: Finished difference Result 1825 states and 5371 transitions. [2022-11-20 09:31:23,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:31:23,778 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 09:31:23,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:23,787 INFO L225 Difference]: With dead ends: 1825 [2022-11-20 09:31:23,787 INFO L226 Difference]: Without dead ends: 1765 [2022-11-20 09:31:23,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-20 09:31:23,788 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 90 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:23,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 30 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 09:31:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2022-11-20 09:31:23,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1765. [2022-11-20 09:31:23,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1765 states, 1725 states have (on average 2.965217391304348) internal successors, (5115), 1764 states have internal predecessors, (5115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 5115 transitions. [2022-11-20 09:31:23,847 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 5115 transitions. Word has length 14 [2022-11-20 09:31:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:23,848 INFO L495 AbstractCegarLoop]: Abstraction has 1765 states and 5115 transitions. [2022-11-20 09:31:23,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 5115 transitions. [2022-11-20 09:31:23,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:31:23,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:23,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:23,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 09:31:23,851 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:23,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:23,852 INFO L85 PathProgramCache]: Analyzing trace with hash 252046699, now seen corresponding path program 1 times [2022-11-20 09:31:23,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:23,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726901843] [2022-11-20 09:31:23,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:23,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:24,160 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-20 09:31:24,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:24,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726901843] [2022-11-20 09:31:24,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726901843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:24,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:24,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:31:24,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717178108] [2022-11-20 09:31:24,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:24,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:31:24,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:24,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:31:24,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:31:24,163 INFO L87 Difference]: Start difference. First operand 1765 states and 5115 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:24,483 INFO L93 Difference]: Finished difference Result 1485 states and 3947 transitions. [2022-11-20 09:31:24,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:31:24,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 09:31:24,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:24,490 INFO L225 Difference]: With dead ends: 1485 [2022-11-20 09:31:24,490 INFO L226 Difference]: Without dead ends: 1485 [2022-11-20 09:31:24,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:31:24,491 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 68 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:24,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 10 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:31:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2022-11-20 09:31:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1303. [2022-11-20 09:31:24,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1263 states have (on average 2.8376880443388757) internal successors, (3584), 1302 states have internal predecessors, (3584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 3584 transitions. [2022-11-20 09:31:24,534 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 3584 transitions. Word has length 14 [2022-11-20 09:31:24,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:24,535 INFO L495 AbstractCegarLoop]: Abstraction has 1303 states and 3584 transitions. [2022-11-20 09:31:24,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 3584 transitions. [2022-11-20 09:31:24,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:31:24,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:24,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:24,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 09:31:24,538 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:24,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:24,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2126251898, now seen corresponding path program 1 times [2022-11-20 09:31:24,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:24,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906352619] [2022-11-20 09:31:24,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:24,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:26,508 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-20 09:31:26,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:26,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906352619] [2022-11-20 09:31:26,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906352619] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:26,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:26,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:31:26,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369952704] [2022-11-20 09:31:26,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:26,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:31:26,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:26,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:31:26,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:31:26,510 INFO L87 Difference]: Start difference. First operand 1303 states and 3584 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:27,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:27,229 INFO L93 Difference]: Finished difference Result 1803 states and 4821 transitions. [2022-11-20 09:31:27,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 09:31:27,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 09:31:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:27,237 INFO L225 Difference]: With dead ends: 1803 [2022-11-20 09:31:27,237 INFO L226 Difference]: Without dead ends: 1753 [2022-11-20 09:31:27,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2022-11-20 09:31:27,238 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 129 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:27,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 15 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 09:31:27,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2022-11-20 09:31:27,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1313. [2022-11-20 09:31:27,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 1273 states have (on average 2.8271798900235665) internal successors, (3599), 1312 states have internal predecessors, (3599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 3599 transitions. [2022-11-20 09:31:27,283 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 3599 transitions. Word has length 15 [2022-11-20 09:31:27,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:27,283 INFO L495 AbstractCegarLoop]: Abstraction has 1313 states and 3599 transitions. [2022-11-20 09:31:27,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:27,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 3599 transitions. [2022-11-20 09:31:27,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:31:27,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:27,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:27,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 09:31:27,287 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:27,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:27,287 INFO L85 PathProgramCache]: Analyzing trace with hash -776482537, now seen corresponding path program 1 times [2022-11-20 09:31:27,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:27,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917811958] [2022-11-20 09:31:27,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:27,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:27,441 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-20 09:31:27,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:27,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917811958] [2022-11-20 09:31:27,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917811958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:27,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:27,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:31:27,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188471749] [2022-11-20 09:31:27,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:27,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:31:27,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:27,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:31:27,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:31:27,445 INFO L87 Difference]: Start difference. First operand 1313 states and 3599 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:27,560 INFO L93 Difference]: Finished difference Result 1095 states and 3215 transitions. [2022-11-20 09:31:27,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:31:27,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 09:31:27,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:27,562 INFO L225 Difference]: With dead ends: 1095 [2022-11-20 09:31:27,562 INFO L226 Difference]: Without dead ends: 305 [2022-11-20 09:31:27,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:31:27,564 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 44 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:27,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 2 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:31:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-11-20 09:31:27,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2022-11-20 09:31:27,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 2.5460526315789473) internal successors, (774), 304 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:27,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 774 transitions. [2022-11-20 09:31:27,573 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 774 transitions. Word has length 15 [2022-11-20 09:31:27,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:27,574 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 774 transitions. [2022-11-20 09:31:27,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:27,574 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 774 transitions. [2022-11-20 09:31:27,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:31:27,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:27,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:27,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 09:31:27,576 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:27,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:27,577 INFO L85 PathProgramCache]: Analyzing trace with hash 878904567, now seen corresponding path program 1 times [2022-11-20 09:31:27,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:27,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317910797] [2022-11-20 09:31:27,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:27,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:27,996 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-20 09:31:27,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:27,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317910797] [2022-11-20 09:31:27,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317910797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:27,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:27,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:31:27,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341034172] [2022-11-20 09:31:27,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:27,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:31:27,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:27,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:31:28,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:28,000 INFO L87 Difference]: Start difference. First operand 305 states and 774 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:28,092 INFO L93 Difference]: Finished difference Result 237 states and 532 transitions. [2022-11-20 09:31:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:31:28,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 09:31:28,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:28,095 INFO L225 Difference]: With dead ends: 237 [2022-11-20 09:31:28,095 INFO L226 Difference]: Without dead ends: 237 [2022-11-20 09:31:28,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:31:28,096 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:28,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:31:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-20 09:31:28,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2022-11-20 09:31:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 2.2542372881355934) internal successors, (532), 236 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 532 transitions. [2022-11-20 09:31:28,103 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 532 transitions. Word has length 16 [2022-11-20 09:31:28,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:28,104 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 532 transitions. [2022-11-20 09:31:28,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 532 transitions. [2022-11-20 09:31:28,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 09:31:28,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:28,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:28,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 09:31:28,106 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:28,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:28,107 INFO L85 PathProgramCache]: Analyzing trace with hash 401441288, now seen corresponding path program 1 times [2022-11-20 09:31:28,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:28,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980602834] [2022-11-20 09:31:28,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:28,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:28,563 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-20 09:31:28,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:28,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980602834] [2022-11-20 09:31:28,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980602834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:28,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:28,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:31:28,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750467985] [2022-11-20 09:31:28,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:28,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:31:28,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:28,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:31:28,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:31:28,566 INFO L87 Difference]: Start difference. First operand 237 states and 532 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:28,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:28,695 INFO L93 Difference]: Finished difference Result 169 states and 344 transitions. [2022-11-20 09:31:28,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:31:28,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 09:31:28,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:28,697 INFO L225 Difference]: With dead ends: 169 [2022-11-20 09:31:28,697 INFO L226 Difference]: Without dead ends: 169 [2022-11-20 09:31:28,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:31:28,698 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:28,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 7 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:31:28,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-20 09:31:28,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-11-20 09:31:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 2.0476190476190474) internal successors, (344), 168 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 344 transitions. [2022-11-20 09:31:28,703 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 344 transitions. Word has length 18 [2022-11-20 09:31:28,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:28,704 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 344 transitions. [2022-11-20 09:31:28,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:28,704 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 344 transitions. [2022-11-20 09:31:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 09:31:28,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:28,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:28,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 09:31:28,706 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:28,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:28,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1478608606, now seen corresponding path program 1 times [2022-11-20 09:31:28,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:28,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242507814] [2022-11-20 09:31:28,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:28,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:29,273 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-20 09:31:29,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:29,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242507814] [2022-11-20 09:31:29,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242507814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:29,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:29,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:31:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890423082] [2022-11-20 09:31:29,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:29,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:31:29,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:29,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:31:29,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:31:29,277 INFO L87 Difference]: Start difference. First operand 169 states and 344 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:29,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:29,404 INFO L93 Difference]: Finished difference Result 145 states and 298 transitions. [2022-11-20 09:31:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:31:29,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 09:31:29,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:29,405 INFO L225 Difference]: With dead ends: 145 [2022-11-20 09:31:29,405 INFO L226 Difference]: Without dead ends: 89 [2022-11-20 09:31:29,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:31:29,406 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 48 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:29,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:31:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-20 09:31:29,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-20 09:31:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.9772727272727273) internal successors, (174), 88 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 174 transitions. [2022-11-20 09:31:29,410 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 174 transitions. Word has length 20 [2022-11-20 09:31:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:29,410 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 174 transitions. [2022-11-20 09:31:29,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:31:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 174 transitions. [2022-11-20 09:31:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 09:31:29,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:29,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:29,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 09:31:29,412 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:31:29,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:29,413 INFO L85 PathProgramCache]: Analyzing trace with hash -848890657, now seen corresponding path program 1 times [2022-11-20 09:31:29,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:29,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605361690] [2022-11-20 09:31:29,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:29,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:31:29,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:31:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:31:29,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:31:29,967 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:31:29,968 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (108 of 109 remaining) [2022-11-20 09:31:29,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 109 remaining) [2022-11-20 09:31:29,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 109 remaining) [2022-11-20 09:31:29,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 109 remaining) [2022-11-20 09:31:29,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 109 remaining) [2022-11-20 09:31:29,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 109 remaining) [2022-11-20 09:31:29,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 109 remaining) [2022-11-20 09:31:29,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 109 remaining) [2022-11-20 09:31:29,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 109 remaining) [2022-11-20 09:31:29,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 109 remaining) [2022-11-20 09:31:29,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 109 remaining) [2022-11-20 09:31:29,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 109 remaining) [2022-11-20 09:31:29,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 109 remaining) [2022-11-20 09:31:29,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 109 remaining) [2022-11-20 09:31:29,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 109 remaining) [2022-11-20 09:31:29,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 109 remaining) [2022-11-20 09:31:29,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 109 remaining) [2022-11-20 09:31:29,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 109 remaining) [2022-11-20 09:31:29,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 109 remaining) [2022-11-20 09:31:29,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 109 remaining) [2022-11-20 09:31:29,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 109 remaining) [2022-11-20 09:31:29,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 109 remaining) [2022-11-20 09:31:29,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 109 remaining) [2022-11-20 09:31:29,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 109 remaining) [2022-11-20 09:31:29,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 109 remaining) [2022-11-20 09:31:29,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 109 remaining) [2022-11-20 09:31:29,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 109 remaining) [2022-11-20 09:31:29,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 109 remaining) [2022-11-20 09:31:29,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 109 remaining) [2022-11-20 09:31:29,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 109 remaining) [2022-11-20 09:31:29,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 109 remaining) [2022-11-20 09:31:29,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 109 remaining) [2022-11-20 09:31:29,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 109 remaining) [2022-11-20 09:31:29,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 109 remaining) [2022-11-20 09:31:29,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 109 remaining) [2022-11-20 09:31:29,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 109 remaining) [2022-11-20 09:31:29,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 109 remaining) [2022-11-20 09:31:29,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 109 remaining) [2022-11-20 09:31:29,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 109 remaining) [2022-11-20 09:31:29,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 109 remaining) [2022-11-20 09:31:29,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 109 remaining) [2022-11-20 09:31:29,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 109 remaining) [2022-11-20 09:31:29,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 109 remaining) [2022-11-20 09:31:29,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 109 remaining) [2022-11-20 09:31:29,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 109 remaining) [2022-11-20 09:31:29,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 109 remaining) [2022-11-20 09:31:29,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 109 remaining) [2022-11-20 09:31:29,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 109 remaining) [2022-11-20 09:31:29,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 109 remaining) [2022-11-20 09:31:29,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 109 remaining) [2022-11-20 09:31:29,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 109 remaining) [2022-11-20 09:31:29,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 109 remaining) [2022-11-20 09:31:29,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 109 remaining) [2022-11-20 09:31:29,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 109 remaining) [2022-11-20 09:31:29,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 109 remaining) [2022-11-20 09:31:29,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 109 remaining) [2022-11-20 09:31:29,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 109 remaining) [2022-11-20 09:31:29,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 109 remaining) [2022-11-20 09:31:29,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 109 remaining) [2022-11-20 09:31:29,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 109 remaining) [2022-11-20 09:31:29,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 109 remaining) [2022-11-20 09:31:29,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 109 remaining) [2022-11-20 09:31:29,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 109 remaining) [2022-11-20 09:31:29,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 109 remaining) [2022-11-20 09:31:29,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 109 remaining) [2022-11-20 09:31:29,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (43 of 109 remaining) [2022-11-20 09:31:29,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 109 remaining) [2022-11-20 09:31:29,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 109 remaining) [2022-11-20 09:31:29,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 109 remaining) [2022-11-20 09:31:29,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 109 remaining) [2022-11-20 09:31:29,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 109 remaining) [2022-11-20 09:31:29,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 109 remaining) [2022-11-20 09:31:29,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 109 remaining) [2022-11-20 09:31:29,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 109 remaining) [2022-11-20 09:31:29,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 109 remaining) [2022-11-20 09:31:29,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 109 remaining) [2022-11-20 09:31:29,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 109 remaining) [2022-11-20 09:31:29,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 109 remaining) [2022-11-20 09:31:29,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 109 remaining) [2022-11-20 09:31:29,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 109 remaining) [2022-11-20 09:31:29,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 109 remaining) [2022-11-20 09:31:29,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 109 remaining) [2022-11-20 09:31:29,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 109 remaining) [2022-11-20 09:31:29,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 109 remaining) [2022-11-20 09:31:29,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 109 remaining) [2022-11-20 09:31:29,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 109 remaining) [2022-11-20 09:31:29,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 109 remaining) [2022-11-20 09:31:29,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 109 remaining) [2022-11-20 09:31:29,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 109 remaining) [2022-11-20 09:31:29,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 109 remaining) [2022-11-20 09:31:29,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 109 remaining) [2022-11-20 09:31:29,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 109 remaining) [2022-11-20 09:31:29,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 109 remaining) [2022-11-20 09:31:29,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 109 remaining) [2022-11-20 09:31:29,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 109 remaining) [2022-11-20 09:31:29,993 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 109 remaining) [2022-11-20 09:31:29,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 109 remaining) [2022-11-20 09:31:29,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 109 remaining) [2022-11-20 09:31:29,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 109 remaining) [2022-11-20 09:31:29,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 109 remaining) [2022-11-20 09:31:29,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 109 remaining) [2022-11-20 09:31:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 109 remaining) [2022-11-20 09:31:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 109 remaining) [2022-11-20 09:31:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 109 remaining) [2022-11-20 09:31:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 109 remaining) [2022-11-20 09:31:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 109 remaining) [2022-11-20 09:31:29,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 109 remaining) [2022-11-20 09:31:29,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 109 remaining) [2022-11-20 09:31:29,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 109 remaining) [2022-11-20 09:31:29,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 09:31:30,000 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:30,011 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 09:31:30,011 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:31:30,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:31:30 BasicIcfg [2022-11-20 09:31:30,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:31:30,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:31:30,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:31:30,142 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:31:30,142 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:30:23" (3/4) ... [2022-11-20 09:31:30,145 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 09:31:30,145 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:31:30,150 INFO L158 Benchmark]: Toolchain (without parser) took 70159.32ms. Allocated memory was 130.0MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 85.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2022-11-20 09:31:30,150 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 107.0MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:31:30,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 781.24ms. Allocated memory is still 130.0MB. Free memory was 85.2MB in the beginning and 58.9MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-20 09:31:30,151 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.71ms. Allocated memory is still 130.0MB. Free memory was 58.9MB in the beginning and 56.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:31:30,152 INFO L158 Benchmark]: Boogie Preprocessor took 76.20ms. Allocated memory is still 130.0MB. Free memory was 56.3MB in the beginning and 53.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:31:30,152 INFO L158 Benchmark]: RCFGBuilder took 2083.80ms. Allocated memory was 130.0MB in the beginning and 165.7MB in the end (delta: 35.7MB). Free memory was 53.2MB in the beginning and 69.7MB in the end (delta: -16.5MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2022-11-20 09:31:30,153 INFO L158 Benchmark]: TraceAbstraction took 67136.20ms. Allocated memory was 165.7MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 68.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2022-11-20 09:31:30,153 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 4.1GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:31:30,158 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.37ms. Allocated memory is still 107.0MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 781.24ms. Allocated memory is still 130.0MB. Free memory was 85.2MB in the beginning and 58.9MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.71ms. Allocated memory is still 130.0MB. Free memory was 58.9MB in the beginning and 56.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.20ms. Allocated memory is still 130.0MB. Free memory was 56.3MB in the beginning and 53.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2083.80ms. Allocated memory was 130.0MB in the beginning and 165.7MB in the end (delta: 35.7MB). Free memory was 53.2MB in the beginning and 69.7MB in the end (delta: -16.5MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * TraceAbstraction took 67136.20ms. Allocated memory was 165.7MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 68.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 4.1GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.0s, 207 PlacesBefore, 104 PlacesAfterwards, 199 TransitionsBefore, 95 TransitionsAfterwards, 9828 CoEnabledTransitionPairs, 7 FixpointIterations, 70 TrivialSequentialCompositions, 121 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 197 TotalNumberOfCompositions, 38051 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12083, independent: 11596, independent conditional: 0, independent unconditional: 11596, dependent: 429, dependent conditional: 0, dependent unconditional: 429, unknown: 58, unknown conditional: 0, unknown unconditional: 58] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5582, independent: 5464, independent conditional: 0, independent unconditional: 5464, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5582, independent: 4565, independent conditional: 0, independent unconditional: 4565, dependent: 1017, dependent conditional: 0, dependent unconditional: 1017, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1017, independent: 899, independent conditional: 0, independent unconditional: 899, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6379, independent: 4810, independent conditional: 0, independent unconditional: 4810, dependent: 1167, dependent conditional: 0, dependent unconditional: 1167, unknown: 402, unknown conditional: 0, unknown unconditional: 402] ], Cache Queries: [ total: 12083, independent: 6132, independent conditional: 0, independent unconditional: 6132, dependent: 321, dependent conditional: 0, dependent unconditional: 321, unknown: 5630, unknown conditional: 0, unknown unconditional: 5630] , Statistics on independence cache: Total cache size (in pairs): 531, Positive cache size: 491, Positive conditional cache size: 0, Positive unconditional cache size: 491, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 8, Unknown conditional cache size: 0, Unknown unconditional cache size: 8 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L851] 0 pthread_t t1801; [L852] FCALL, FORK 0 pthread_create(&t1801, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1801, ((void *)0), P0, ((void *)0))=0, t1801={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] 0 pthread_t t1802; [L854] FCALL, FORK 0 pthread_create(&t1802, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1802, ((void *)0), P1, ((void *)0))=1, t1801={5:0}, t1802={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] EXPR 1 \read(y) [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L765] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L766] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L767] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L768] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L769] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L770] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L772] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L773] EXPR 1 \read(y) [L773] 1 __unbuffered_p0_EAX = y [L774] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L774] 1 y = y$flush_delayed ? y$mem_tmp : y [L775] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L855] 0 pthread_t t1803; [L790] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 \read(y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L798] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L799] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L800] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L856] FCALL, FORK 0 pthread_create(&t1803, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1803, ((void *)0), P2, ((void *)0))=2, t1801={5:0}, t1802={7:0}, t1803={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 y$flush_delayed = weak$$choice2 [L813] EXPR 3 \read(y) [L813] 3 y$mem_tmp = y [L814] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L814] EXPR 3 \read(y) [L814] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L814] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L816] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L817] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L818] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L820] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 \read(y) [L821] 3 __unbuffered_p2_EAX = y [L822] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L822] 3 y = y$flush_delayed ? y$mem_tmp : y [L823] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=1, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=1, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L829] EXPR 3 \read(y) [L829] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L829] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 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) [L830] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L831] 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 [L832] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L833] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=1, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 3 return 0; [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L862] EXPR 0 \read(y) [L862] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 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) [L863] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] 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 [L865] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L866] 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 [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1801={5:0}, t1802={7:0}, t1803={8:0}, weak$$choice0=3, weak$$choice1=1, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L869] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L870] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L871] 0 y$flush_delayed = weak$$choice2 [L872] EXPR 0 \read(y) [L872] 0 y$mem_tmp = y [L873] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L873] EXPR 0 \read(y) [L873] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L873] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L875] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L876] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L877] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L879] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 x == 2 && y == 2 [L882] EXPR 0 \read(y) [L882] EXPR 0 x == 2 && y == 2 [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L883] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=255, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: -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: -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: -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: -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: -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: -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: -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: 849]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 854]: 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: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 264 locations, 109 error locations. Started 1 CEGAR loops. OverallTime: 66.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 47.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 800 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 800 mSDsluCounter, 154 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1807 IncrementalHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 193 mSolverCounterUnsat, 71 mSDtfsCounter, 1807 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137812occurred in iteration=0, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 3282 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 1869 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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-20 09:31:30,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN --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 67d3e2c6779f32015be5c9fe966e6a739e1c762dcde7f287ad383839eb490e84 --- 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-6b4ec56 [2022-11-20 09:31:32,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:31:32,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:31:32,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:31:32,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:31:32,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:31:32,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:31:32,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:31:32,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:31:32,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:31:32,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:31:32,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:31:32,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:31:32,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:31:32,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:31:32,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:31:32,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:31:32,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:31:32,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:31:32,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:31:32,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:31:32,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:31:32,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:31:32,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:31:32,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:31:32,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:31:32,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:31:32,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:31:32,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:31:32,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:31:32,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:31:32,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:31:32,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:31:32,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:31:32,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:31:32,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:31:32,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:31:32,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:31:32,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:31:32,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:31:32,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:31:32,694 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-20 09:31:32,739 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:31:32,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:31:32,743 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:31:32,743 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:31:32,744 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:31:32,744 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:31:32,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:31:32,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:31:32,746 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:31:32,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:31:32,747 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:31:32,747 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:31:32,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:31:32,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:31:32,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:31:32,748 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 09:31:32,748 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 09:31:32,749 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 09:31:32,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:31:32,749 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 09:31:32,749 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 09:31:32,749 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 09:31:32,750 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:31:32,750 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:31:32,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:31:32,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:31:32,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:31:32,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:31:32,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:31:32,751 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:31:32,752 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 09:31:32,752 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 09:31:32,752 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 09:31:32,753 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN 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 -> 67d3e2c6779f32015be5c9fe966e6a739e1c762dcde7f287ad383839eb490e84 [2022-11-20 09:31:33,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:31:33,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:31:33,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:31:33,119 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:31:33,120 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:31:33,121 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i [2022-11-20 09:31:36,081 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:31:36,342 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:31:36,342 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i [2022-11-20 09:31:36,357 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/data/0787e04d3/37fe20a562e6416d89e8cd5651f6cda0/FLAGf3a45d529 [2022-11-20 09:31:36,388 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/data/0787e04d3/37fe20a562e6416d89e8cd5651f6cda0 [2022-11-20 09:31:36,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:31:36,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:31:36,394 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:31:36,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:31:36,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:31:36,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:31:36" (1/1) ... [2022-11-20 09:31:36,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55aa3ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:36, skipping insertion in model container [2022-11-20 09:31:36,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:31:36" (1/1) ... [2022-11-20 09:31:36,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:31:36,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:31:36,689 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_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i[995,1008] [2022-11-20 09:31:36,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:31:37,008 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:31:37,023 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_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i[995,1008] [2022-11-20 09:31:37,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:31:37,174 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:31:37,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:37 WrapperNode [2022-11-20 09:31:37,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:31:37,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:31:37,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:31:37,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:31:37,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:37" (1/1) ... [2022-11-20 09:31:37,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:37" (1/1) ... [2022-11-20 09:31:37,255 INFO L138 Inliner]: procedures = 180, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 171 [2022-11-20 09:31:37,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:31:37,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:31:37,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:31:37,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:31:37,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:37" (1/1) ... [2022-11-20 09:31:37,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:37" (1/1) ... [2022-11-20 09:31:37,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:37" (1/1) ... [2022-11-20 09:31:37,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:37" (1/1) ... [2022-11-20 09:31:37,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:37" (1/1) ... [2022-11-20 09:31:37,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:37" (1/1) ... [2022-11-20 09:31:37,307 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:37" (1/1) ... [2022-11-20 09:31:37,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:37" (1/1) ... [2022-11-20 09:31:37,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:31:37,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:31:37,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:31:37,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:31:37,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:37" (1/1) ... [2022-11-20 09:31:37,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:31:37,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:37,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:31:37,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:31:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-20 09:31:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 09:31:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:31:37,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:31:37,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:31:37,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 09:31:37,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 09:31:37,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-20 09:31:37,410 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 09:31:37,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 09:31:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 09:31:37,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 09:31:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 09:31:37,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 09:31:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 09:31:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:31:37,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:31:37,413 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 09:31:37,654 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:31:37,656 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:31:38,612 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:31:39,787 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:31:39,788 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 09:31:39,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:31:39 BoogieIcfgContainer [2022-11-20 09:31:39,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:31:39,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:31:39,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:31:39,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:31:39,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:31:36" (1/3) ... [2022-11-20 09:31:39,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0d7040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:31:39, skipping insertion in model container [2022-11-20 09:31:39,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:37" (2/3) ... [2022-11-20 09:31:39,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0d7040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:31:39, skipping insertion in model container [2022-11-20 09:31:39,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:31:39" (3/3) ... [2022-11-20 09:31:39,799 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.oepc.i [2022-11-20 09:31:39,819 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:31:39,819 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2022-11-20 09:31:39,819 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:31:40,088 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 09:31:40,138 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 09:31:40,157 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 208 places, 200 transitions, 415 flow [2022-11-20 09:31:40,159 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 208 places, 200 transitions, 415 flow [2022-11-20 09:31:40,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 200 transitions, 415 flow [2022-11-20 09:31:40,276 INFO L130 PetriNetUnfolder]: 2/197 cut-off events. [2022-11-20 09:31:40,276 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:31:40,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 197 events. 2/197 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 375 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2022-11-20 09:31:40,289 INFO L119 LiptonReduction]: Number of co-enabled transitions 9828 [2022-11-20 09:31:55,217 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 205 DAG size of output: 201 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 09:32:04,782 WARN L233 SmtUtils]: Spent 6.94s on a formula simplification. DAG size of input: 237 DAG size of output: 236 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 09:32:14,242 WARN L233 SmtUtils]: Spent 9.46s on a formula simplification. DAG size of input: 236 DAG size of output: 234 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 09:33:10,875 INFO L134 LiptonReduction]: Checked pairs total: 41489 [2022-11-20 09:33:10,875 INFO L136 LiptonReduction]: Total number of compositions: 196 [2022-11-20 09:33:10,883 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 95 transitions, 205 flow [2022-11-20 09:33:15,266 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 137812 states, 90058 states have (on average 5.824968353727598) internal successors, (524585), 137811 states have internal predecessors, (524585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:15,298 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:33:15,302 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=FINITE_AUTOMATA, 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;@7f747ec5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:33:15,303 INFO L358 AbstractCegarLoop]: Starting to check reachability of 109 error locations. [2022-11-20 09:33:15,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 137812 states, 90058 states have (on average 5.824968353727598) internal successors, (524585), 137811 states have internal predecessors, (524585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 09:33:15,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:15,669 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 09:33:15,670 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:33:15,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:15,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1399, now seen corresponding path program 1 times [2022-11-20 09:33:15,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:33:15,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017215174] [2022-11-20 09:33:15,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:15,689 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-20 09:33:15,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:33:15,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:15,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:16,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 09:33:16,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:16,143 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-20 09:33:16,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:33:16,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:33:16,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017215174] [2022-11-20 09:33:16,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017215174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:16,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:16,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 09:33:16,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082967868] [2022-11-20 09:33:16,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:16,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:33:16,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:33:16,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:33:16,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:33:16,389 INFO L87 Difference]: Start difference. First operand has 137812 states, 90058 states have (on average 5.824968353727598) internal successors, (524585), 137811 states have internal predecessors, (524585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:17,054 INFO L93 Difference]: Finished difference Result 11426 states and 40738 transitions. [2022-11-20 09:33:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:33:17,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-20 09:33:17,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:17,208 INFO L225 Difference]: With dead ends: 11426 [2022-11-20 09:33:17,215 INFO L226 Difference]: Without dead ends: 11426 [2022-11-20 09:33:17,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:33:17,221 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:17,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:33:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11426 states. [2022-11-20 09:33:17,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11426 to 11426. [2022-11-20 09:33:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11426 states, 10041 states have (on average 4.0571656209540885) internal successors, (40738), 11425 states have internal predecessors, (40738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11426 states to 11426 states and 40738 transitions. [2022-11-20 09:33:18,292 INFO L78 Accepts]: Start accepts. Automaton has 11426 states and 40738 transitions. Word has length 1 [2022-11-20 09:33:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:18,293 INFO L495 AbstractCegarLoop]: Abstraction has 11426 states and 40738 transitions. [2022-11-20 09:33:18,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:18,294 INFO L276 IsEmpty]: Start isEmpty. Operand 11426 states and 40738 transitions. [2022-11-20 09:33:18,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 09:33:18,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:18,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 09:33:18,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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)] Forceful destruction successful, exit code 0 [2022-11-20 09:33:18,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:18,497 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:33:18,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:18,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1383856, now seen corresponding path program 1 times [2022-11-20 09:33:18,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:33:18,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147800671] [2022-11-20 09:33:18,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:18,499 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-20 09:33:18,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:33:18,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:18,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:19,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 09:33:19,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:19,238 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 09:33:19,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 09:33:19,300 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-20 09:33:19,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:33:19,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:33:19,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147800671] [2022-11-20 09:33:19,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147800671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:19,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:19,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:33:19,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181465110] [2022-11-20 09:33:19,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:19,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:19,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:33:19,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:19,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:19,305 INFO L87 Difference]: Start difference. First operand 11426 states and 40738 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:19,851 INFO L93 Difference]: Finished difference Result 5165 states and 17678 transitions. [2022-11-20 09:33:19,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:19,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 09:33:19,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:19,910 INFO L225 Difference]: With dead ends: 5165 [2022-11-20 09:33:19,910 INFO L226 Difference]: Without dead ends: 5165 [2022-11-20 09:33:19,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:19,915 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:19,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 4 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:33:20,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2022-11-20 09:33:20,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 5165. [2022-11-20 09:33:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 4818 states have (on average 3.669157326691573) internal successors, (17678), 5164 states have internal predecessors, (17678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:20,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 17678 transitions. [2022-11-20 09:33:20,178 INFO L78 Accepts]: Start accepts. Automaton has 5165 states and 17678 transitions. Word has length 3 [2022-11-20 09:33:20,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:20,179 INFO L495 AbstractCegarLoop]: Abstraction has 5165 states and 17678 transitions. [2022-11-20 09:33:20,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:20,179 INFO L276 IsEmpty]: Start isEmpty. Operand 5165 states and 17678 transitions. [2022-11-20 09:33:20,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 09:33:20,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:20,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 09:33:20,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:20,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:20,392 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:33:20,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:20,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1383857, now seen corresponding path program 1 times [2022-11-20 09:33:20,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:33:20,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924509875] [2022-11-20 09:33:20,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:20,395 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-20 09:33:20,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:33:20,396 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:20,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:20,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:33:20,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:20,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:20,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 09:33:20,868 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-20 09:33:20,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:33:20,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:33:20,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924509875] [2022-11-20 09:33:20,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924509875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:20,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:20,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:33:20,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356559369] [2022-11-20 09:33:20,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:20,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:20,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:33:20,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:20,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:20,871 INFO L87 Difference]: Start difference. First operand 5165 states and 17678 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:21,091 INFO L93 Difference]: Finished difference Result 2202 states and 7245 transitions. [2022-11-20 09:33:21,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:21,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 09:33:21,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:21,104 INFO L225 Difference]: With dead ends: 2202 [2022-11-20 09:33:21,105 INFO L226 Difference]: Without dead ends: 2202 [2022-11-20 09:33:21,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:21,106 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:21,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:33:21,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2022-11-20 09:33:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202. [2022-11-20 09:33:21,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2202 states, 2120 states have (on average 3.417452830188679) internal successors, (7245), 2201 states have internal predecessors, (7245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 7245 transitions. [2022-11-20 09:33:21,279 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 7245 transitions. Word has length 3 [2022-11-20 09:33:21,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:21,280 INFO L495 AbstractCegarLoop]: Abstraction has 2202 states and 7245 transitions. [2022-11-20 09:33:21,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:21,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 7245 transitions. [2022-11-20 09:33:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:33:21,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:21,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:21,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:21,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:21,494 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:33:21,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:21,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1941441565, now seen corresponding path program 1 times [2022-11-20 09:33:21,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:33:21,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167893174] [2022-11-20 09:33:21,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:21,495 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-20 09:33:21,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:33:21,497 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:21,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:21,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 09:33:22,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:22,029 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-20 09:33:22,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:33:22,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:33:22,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167893174] [2022-11-20 09:33:22,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167893174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:22,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:22,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:33:22,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209000881] [2022-11-20 09:33:22,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:22,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:33:22,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:33:22,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:33:22,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:22,032 INFO L87 Difference]: Start difference. First operand 2202 states and 7245 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:22,280 INFO L93 Difference]: Finished difference Result 1020 states and 2698 transitions. [2022-11-20 09:33:22,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:33:22,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 09:33:22,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:22,285 INFO L225 Difference]: With dead ends: 1020 [2022-11-20 09:33:22,285 INFO L226 Difference]: Without dead ends: 1020 [2022-11-20 09:33:22,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:33:22,286 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:22,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 10 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:33:22,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2022-11-20 09:33:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1020. [2022-11-20 09:33:22,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 962 states have (on average 2.8045738045738045) internal successors, (2698), 1019 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:22,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2698 transitions. [2022-11-20 09:33:22,311 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2698 transitions. Word has length 11 [2022-11-20 09:33:22,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:22,312 INFO L495 AbstractCegarLoop]: Abstraction has 1020 states and 2698 transitions. [2022-11-20 09:33:22,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:22,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2698 transitions. [2022-11-20 09:33:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:33:22,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:22,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:22,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:22,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:22,527 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:33:22,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:22,527 INFO L85 PathProgramCache]: Analyzing trace with hash 211760477, now seen corresponding path program 1 times [2022-11-20 09:33:22,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:33:22,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229093157] [2022-11-20 09:33:22,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:22,528 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-20 09:33:22,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:33:22,529 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:22,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:23,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:33:23,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:23,170 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-20 09:33:23,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:33:23,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:33:23,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229093157] [2022-11-20 09:33:23,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229093157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:23,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:23,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:33:23,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768076778] [2022-11-20 09:33:23,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:23,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:33:23,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:33:23,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:33:23,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:33:23,173 INFO L87 Difference]: Start difference. First operand 1020 states and 2698 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:23,488 INFO L93 Difference]: Finished difference Result 321 states and 685 transitions. [2022-11-20 09:33:23,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:33:23,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 09:33:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:23,490 INFO L225 Difference]: With dead ends: 321 [2022-11-20 09:33:23,490 INFO L226 Difference]: Without dead ends: 321 [2022-11-20 09:33:23,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:33:23,491 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:23,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 18 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:33:23,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-11-20 09:33:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2022-11-20 09:33:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 301 states have (on average 2.2757475083056478) internal successors, (685), 320 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 685 transitions. [2022-11-20 09:33:23,498 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 685 transitions. Word has length 14 [2022-11-20 09:33:23,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:23,499 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 685 transitions. [2022-11-20 09:33:23,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 685 transitions. [2022-11-20 09:33:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 09:33:23,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:23,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:23,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:23,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:23,714 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:33:23,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:23,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1050270194, now seen corresponding path program 1 times [2022-11-20 09:33:23,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:33:23,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572238340] [2022-11-20 09:33:23,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:23,715 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-20 09:33:23,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:33:23,717 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:23,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:24,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:33:24,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:24,259 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-20 09:33:24,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:33:24,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:33:24,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572238340] [2022-11-20 09:33:24,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572238340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:24,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:24,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:33:24,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418631013] [2022-11-20 09:33:24,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:24,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:33:24,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:33:24,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:33:24,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:33:24,261 INFO L87 Difference]: Start difference. First operand 321 states and 685 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:24,685 INFO L93 Difference]: Finished difference Result 183 states and 420 transitions. [2022-11-20 09:33:24,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:33:24,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 09:33:24,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:24,687 INFO L225 Difference]: With dead ends: 183 [2022-11-20 09:33:24,687 INFO L226 Difference]: Without dead ends: 183 [2022-11-20 09:33:24,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:33:24,690 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:24,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 27 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:33:24,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-20 09:33:24,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-20 09:33:24,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 2.346368715083799) internal successors, (420), 182 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:24,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 420 transitions. [2022-11-20 09:33:24,700 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 420 transitions. Word has length 18 [2022-11-20 09:33:24,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:24,701 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 420 transitions. [2022-11-20 09:33:24,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 420 transitions. [2022-11-20 09:33:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 09:33:24,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:24,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:24,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:24,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:24,918 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:33:24,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:24,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1293531788, now seen corresponding path program 1 times [2022-11-20 09:33:24,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:33:24,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899788857] [2022-11-20 09:33:24,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:24,920 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-20 09:33:24,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:33:24,926 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:24,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:25,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:33:25,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:28,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 09:33:28,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 09:33:28,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2022-11-20 09:33:28,706 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-20 09:33:28,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:33:28,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:33:28,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899788857] [2022-11-20 09:33:28,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899788857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:28,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:28,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:33:28,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980647870] [2022-11-20 09:33:28,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:28,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:33:28,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:33:28,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:33:28,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:33:28,709 INFO L87 Difference]: Start difference. First operand 183 states and 420 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:33:28,979 INFO L93 Difference]: Finished difference Result 182 states and 419 transitions. [2022-11-20 09:33:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:33:28,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 09:33:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:33:28,980 INFO L225 Difference]: With dead ends: 182 [2022-11-20 09:33:28,980 INFO L226 Difference]: Without dead ends: 182 [2022-11-20 09:33:28,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:33:28,981 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:33:28,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:33:28,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-20 09:33:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-11-20 09:33:28,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 179 states have (on average 2.340782122905028) internal successors, (419), 181 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 419 transitions. [2022-11-20 09:33:28,986 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 419 transitions. Word has length 22 [2022-11-20 09:33:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:33:28,987 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 419 transitions. [2022-11-20 09:33:28,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 419 transitions. [2022-11-20 09:33:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 09:33:28,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:33:28,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:29,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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)] Ended with exit code 0 [2022-11-20 09:33:29,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:29,201 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:33:29,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:29,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1293531789, now seen corresponding path program 1 times [2022-11-20 09:33:29,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:33:29,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631349782] [2022-11-20 09:33:29,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:29,202 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-20 09:33:29,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:33:29,203 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:29,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:33:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:29,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 09:33:29,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:39,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 09:34:39,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2022-11-20 09:34:39,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 09:34:40,021 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-20 09:34:40,021 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:34:40,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:34:40,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631349782] [2022-11-20 09:34:40,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631349782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:34:40,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:34:40,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:34:40,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34616736] [2022-11-20 09:34:40,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:34:40,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:34:40,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:34:40,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:34:40,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:34:40,023 INFO L87 Difference]: Start difference. First operand 182 states and 419 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:40,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:34:40,303 INFO L93 Difference]: Finished difference Result 181 states and 418 transitions. [2022-11-20 09:34:40,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:34:40,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 09:34:40,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:34:40,305 INFO L225 Difference]: With dead ends: 181 [2022-11-20 09:34:40,305 INFO L226 Difference]: Without dead ends: 181 [2022-11-20 09:34:40,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:34:40,306 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:34:40,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:34:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-20 09:34:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-11-20 09:34:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 2.335195530726257) internal successors, (418), 180 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 418 transitions. [2022-11-20 09:34:40,311 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 418 transitions. Word has length 22 [2022-11-20 09:34:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:34:40,312 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 418 transitions. [2022-11-20 09:34:40,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:34:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 418 transitions. [2022-11-20 09:34:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 09:34:40,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:34:40,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:34:40,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:34:40,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:34:40,527 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-11-20 09:34:40,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:34:40,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1293532034, now seen corresponding path program 1 times [2022-11-20 09:34:40,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:34:40,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026507280] [2022-11-20 09:34:40,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:34:40,528 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-20 09:34:40,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:34:40,529 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:34:40,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:34:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:34:41,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:34:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:34:41,436 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-20 09:34:41,437 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:34:41,438 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (108 of 109 remaining) [2022-11-20 09:34:41,439 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 109 remaining) [2022-11-20 09:34:41,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 109 remaining) [2022-11-20 09:34:41,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 109 remaining) [2022-11-20 09:34:41,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 109 remaining) [2022-11-20 09:34:41,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 109 remaining) [2022-11-20 09:34:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 109 remaining) [2022-11-20 09:34:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 109 remaining) [2022-11-20 09:34:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 109 remaining) [2022-11-20 09:34:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 109 remaining) [2022-11-20 09:34:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 109 remaining) [2022-11-20 09:34:41,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 109 remaining) [2022-11-20 09:34:41,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 109 remaining) [2022-11-20 09:34:41,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 109 remaining) [2022-11-20 09:34:41,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 109 remaining) [2022-11-20 09:34:41,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 109 remaining) [2022-11-20 09:34:41,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 109 remaining) [2022-11-20 09:34:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 109 remaining) [2022-11-20 09:34:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 109 remaining) [2022-11-20 09:34:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 109 remaining) [2022-11-20 09:34:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 109 remaining) [2022-11-20 09:34:41,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 109 remaining) [2022-11-20 09:34:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 109 remaining) [2022-11-20 09:34:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 109 remaining) [2022-11-20 09:34:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 109 remaining) [2022-11-20 09:34:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 109 remaining) [2022-11-20 09:34:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 109 remaining) [2022-11-20 09:34:41,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 109 remaining) [2022-11-20 09:34:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 109 remaining) [2022-11-20 09:34:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 109 remaining) [2022-11-20 09:34:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 109 remaining) [2022-11-20 09:34:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 109 remaining) [2022-11-20 09:34:41,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 109 remaining) [2022-11-20 09:34:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 109 remaining) [2022-11-20 09:34:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 109 remaining) [2022-11-20 09:34:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 109 remaining) [2022-11-20 09:34:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 109 remaining) [2022-11-20 09:34:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 109 remaining) [2022-11-20 09:34:41,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 109 remaining) [2022-11-20 09:34:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 109 remaining) [2022-11-20 09:34:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 109 remaining) [2022-11-20 09:34:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 109 remaining) [2022-11-20 09:34:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 109 remaining) [2022-11-20 09:34:41,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 109 remaining) [2022-11-20 09:34:41,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 109 remaining) [2022-11-20 09:34:41,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 109 remaining) [2022-11-20 09:34:41,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 109 remaining) [2022-11-20 09:34:41,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 109 remaining) [2022-11-20 09:34:41,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 109 remaining) [2022-11-20 09:34:41,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 109 remaining) [2022-11-20 09:34:41,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 109 remaining) [2022-11-20 09:34:41,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 109 remaining) [2022-11-20 09:34:41,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 109 remaining) [2022-11-20 09:34:41,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 109 remaining) [2022-11-20 09:34:41,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 109 remaining) [2022-11-20 09:34:41,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 109 remaining) [2022-11-20 09:34:41,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 109 remaining) [2022-11-20 09:34:41,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 109 remaining) [2022-11-20 09:34:41,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 109 remaining) [2022-11-20 09:34:41,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 109 remaining) [2022-11-20 09:34:41,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 109 remaining) [2022-11-20 09:34:41,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 109 remaining) [2022-11-20 09:34:41,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 109 remaining) [2022-11-20 09:34:41,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 109 remaining) [2022-11-20 09:34:41,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 109 remaining) [2022-11-20 09:34:41,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (43 of 109 remaining) [2022-11-20 09:34:41,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 109 remaining) [2022-11-20 09:34:41,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 109 remaining) [2022-11-20 09:34:41,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 109 remaining) [2022-11-20 09:34:41,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 109 remaining) [2022-11-20 09:34:41,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 109 remaining) [2022-11-20 09:34:41,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 109 remaining) [2022-11-20 09:34:41,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 109 remaining) [2022-11-20 09:34:41,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 109 remaining) [2022-11-20 09:34:41,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 109 remaining) [2022-11-20 09:34:41,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 109 remaining) [2022-11-20 09:34:41,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 109 remaining) [2022-11-20 09:34:41,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 109 remaining) [2022-11-20 09:34:41,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 109 remaining) [2022-11-20 09:34:41,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 109 remaining) [2022-11-20 09:34:41,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 109 remaining) [2022-11-20 09:34:41,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 109 remaining) [2022-11-20 09:34:41,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 109 remaining) [2022-11-20 09:34:41,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 109 remaining) [2022-11-20 09:34:41,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 109 remaining) [2022-11-20 09:34:41,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 109 remaining) [2022-11-20 09:34:41,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 109 remaining) [2022-11-20 09:34:41,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 109 remaining) [2022-11-20 09:34:41,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 109 remaining) [2022-11-20 09:34:41,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 109 remaining) [2022-11-20 09:34:41,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 109 remaining) [2022-11-20 09:34:41,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 109 remaining) [2022-11-20 09:34:41,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 109 remaining) [2022-11-20 09:34:41,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 109 remaining) [2022-11-20 09:34:41,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 109 remaining) [2022-11-20 09:34:41,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 109 remaining) [2022-11-20 09:34:41,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 109 remaining) [2022-11-20 09:34:41,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 109 remaining) [2022-11-20 09:34:41,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 109 remaining) [2022-11-20 09:34:41,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 109 remaining) [2022-11-20 09:34:41,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 109 remaining) [2022-11-20 09:34:41,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 109 remaining) [2022-11-20 09:34:41,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 109 remaining) [2022-11-20 09:34:41,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 109 remaining) [2022-11-20 09:34:41,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 109 remaining) [2022-11-20 09:34:41,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 109 remaining) [2022-11-20 09:34:41,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 109 remaining) [2022-11-20 09:34:41,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 109 remaining) [2022-11-20 09:34:41,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 109 remaining) [2022-11-20 09:34:41,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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)] Ended with exit code 0 [2022-11-20 09:34:41,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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-20 09:34:41,676 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:34:41,681 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 09:34:41,681 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:34:41,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:34:41 BasicIcfg [2022-11-20 09:34:41,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:34:41,795 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:34:41,795 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:34:41,795 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:34:41,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:31:39" (3/4) ... [2022-11-20 09:34:41,798 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 09:34:41,798 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:34:41,807 INFO L158 Benchmark]: Toolchain (without parser) took 185414.36ms. Allocated memory was 77.6MB in the beginning and 3.3GB in the end (delta: 3.3GB). Free memory was 55.0MB in the beginning and 1.0GB in the end (delta: -968.9MB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2022-11-20 09:34:41,807 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 56.6MB. Free memory was 35.0MB in the beginning and 35.0MB in the end (delta: 37.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:34:41,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 781.14ms. Allocated memory is still 77.6MB. Free memory was 54.8MB in the beginning and 46.9MB in the end (delta: 8.0MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2022-11-20 09:34:41,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.44ms. Allocated memory is still 77.6MB. Free memory was 46.9MB in the beginning and 44.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:34:41,808 INFO L158 Benchmark]: Boogie Preprocessor took 57.34ms. Allocated memory is still 77.6MB. Free memory was 44.1MB in the beginning and 41.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:34:41,809 INFO L158 Benchmark]: RCFGBuilder took 2460.94ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 41.0MB in the beginning and 64.2MB in the end (delta: -23.2MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2022-11-20 09:34:41,809 INFO L158 Benchmark]: TraceAbstraction took 182001.92ms. Allocated memory was 113.2MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 63.0MB in the beginning and 1.0GB in the end (delta: -960.9MB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2022-11-20 09:34:41,810 INFO L158 Benchmark]: Witness Printer took 11.00ms. Allocated memory is still 3.3GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:34:41,816 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.19ms. Allocated memory is still 56.6MB. Free memory was 35.0MB in the beginning and 35.0MB in the end (delta: 37.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 781.14ms. Allocated memory is still 77.6MB. Free memory was 54.8MB in the beginning and 46.9MB in the end (delta: 8.0MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.44ms. Allocated memory is still 77.6MB. Free memory was 46.9MB in the beginning and 44.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.34ms. Allocated memory is still 77.6MB. Free memory was 44.1MB in the beginning and 41.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2460.94ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 41.0MB in the beginning and 64.2MB in the end (delta: -23.2MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * TraceAbstraction took 182001.92ms. Allocated memory was 113.2MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 63.0MB in the beginning and 1.0GB in the end (delta: -960.9MB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. * Witness Printer took 11.00ms. Allocated memory is still 3.3GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 90.7s, 208 PlacesBefore, 104 PlacesAfterwards, 200 TransitionsBefore, 95 TransitionsAfterwards, 9828 CoEnabledTransitionPairs, 8 FixpointIterations, 71 TrivialSequentialCompositions, 119 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 196 TotalNumberOfCompositions, 41489 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12424, independent: 11879, independent conditional: 0, independent unconditional: 11879, dependent: 455, dependent conditional: 0, dependent unconditional: 455, unknown: 90, unknown conditional: 0, unknown unconditional: 90] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5604, independent: 5495, independent conditional: 0, independent unconditional: 5495, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5604, independent: 4580, independent conditional: 0, independent unconditional: 4580, dependent: 1024, dependent conditional: 0, dependent unconditional: 1024, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1024, independent: 915, independent conditional: 0, independent unconditional: 915, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10654, independent: 6575, independent conditional: 0, independent unconditional: 6575, dependent: 2919, dependent conditional: 0, dependent unconditional: 2919, unknown: 1160, unknown conditional: 0, unknown unconditional: 1160] ], Cache Queries: [ total: 12424, independent: 6384, independent conditional: 0, independent unconditional: 6384, dependent: 360, dependent conditional: 0, dependent unconditional: 360, unknown: 5680, unknown conditional: 0, unknown unconditional: 5680] , Statistics on independence cache: Total cache size (in pairs): 502, Positive cache size: 464, Positive conditional cache size: 0, Positive unconditional cache size: 464, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 10, Unknown conditional cache size: 0, Unknown unconditional cache size: 10 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L851] 0 pthread_t t1801; [L852] FCALL, FORK 0 pthread_create(&t1801, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1801, ((void *)0), P0, ((void *)0))=0, t1801={-1073741824:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] EXPR 1 \read(y) [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L765] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L766] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L767] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L768] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L769] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L770] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L772] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L773] EXPR 1 \read(y) [L773] 1 __unbuffered_p0_EAX = y [L774] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L774] EXPR 1 \read(y) [L774] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L774] 1 y = y$flush_delayed ? y$mem_tmp : y [L775] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L853] 0 pthread_t t1802; [L854] FCALL, FORK 0 pthread_create(&t1802, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1802, ((void *)0), P1, ((void *)0))=1, t1801={-1073741824:0}, t1802={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] 0 pthread_t t1803; [L790] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 \read(y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L798] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L799] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L800] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L856] FCALL, FORK 0 pthread_create(&t1803, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1803, ((void *)0), P2, ((void *)0))=2, t1801={-1073741824:0}, t1802={6:0}, t1803={-2147483648:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 y$flush_delayed = weak$$choice2 [L813] EXPR 3 \read(y) [L813] 3 y$mem_tmp = y [L814] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L814] EXPR 3 \read(y) [L814] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L814] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L816] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L817] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L818] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L820] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 \read(y) [L821] 3 __unbuffered_p2_EAX = y [L822] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L822] EXPR 3 \read(y) [L822] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L822] 3 y = y$flush_delayed ? y$mem_tmp : y [L823] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L829] EXPR 3 \read(y) [L829] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L829] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 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) [L830] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L831] 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 [L832] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L833] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 3 return 0; [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L862] EXPR 0 \read(y) [L862] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 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) [L863] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] 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 [L865] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L866] 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 [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1801={-1073741824:0}, t1802={6:0}, t1803={-2147483648:0}, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L869] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L870] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L871] 0 y$flush_delayed = weak$$choice2 [L872] EXPR 0 \read(y) [L872] 0 y$mem_tmp = y [L873] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L873] EXPR 0 \read(y) [L873] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L873] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L875] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L876] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L877] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L879] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 x == 2 && y == 2 [L882] EXPR 0 \read(y) [L882] EXPR 0 x == 2 && y == 2 [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L883] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L883] EXPR 0 \read(y) [L883] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=2, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: -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: -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: -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: -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: -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: -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: -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: 849]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 854]: 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: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 265 locations, 109 error locations. Started 1 CEGAR loops. OverallTime: 181.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 95.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 203 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 203 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 626 IncrementalHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 36 mSDtfsCounter, 626 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137812occurred in iteration=0, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 74.2s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 514 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1130 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 09:34:41,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_288e71fb-ba8d-480d-a3a0-9b03405ec5bf/bin/uautomizer-ug76WZFUDN/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