./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/thin002_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/thin002_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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_0ad72675-7916-4824-829b-ecafeaee089e/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 e1655ef15816414a510c3a8c6c5388872fb389e863c7015deef825935bc10ec6 --- 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 11:24:30,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:24:30,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:24:31,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:24:31,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:24:31,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:24:31,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:24:31,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:24:31,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:24:31,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:24:31,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:24:31,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:24:31,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:24:31,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:24:31,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:24:31,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:24:31,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:24:31,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:24:31,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:24:31,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:24:31,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:24:31,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:24:31,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:24:31,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:24:31,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:24:31,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:24:31,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:24:31,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:24:31,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:24:31,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:24:31,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:24:31,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:24:31,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:24:31,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:24:31,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:24:31,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:24:31,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:24:31,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:24:31,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:24:31,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:24:31,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:24:31,057 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 11:24:31,080 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:24:31,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:24:31,081 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:24:31,081 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:24:31,082 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:24:31,082 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:24:31,083 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:24:31,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:24:31,083 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:24:31,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:24:31,083 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:24:31,084 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:24:31,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:24:31,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:24:31,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:24:31,084 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 11:24:31,084 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 11:24:31,085 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 11:24:31,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:24:31,085 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:24:31,085 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:24:31,085 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:24:31,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:24:31,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:24:31,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:24:31,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:24:31,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:24:31,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:24:31,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:24:31,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:24:31,087 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_0ad72675-7916-4824-829b-ecafeaee089e/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_0ad72675-7916-4824-829b-ecafeaee089e/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 -> e1655ef15816414a510c3a8c6c5388872fb389e863c7015deef825935bc10ec6 [2022-11-20 11:24:31,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:24:31,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:24:31,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:24:31,403 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:24:31,405 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:24:31,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/thin002_power.opt.i [2022-11-20 11:24:34,587 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:24:34,871 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:24:34,872 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/sv-benchmarks/c/pthread-wmm/thin002_power.opt.i [2022-11-20 11:24:34,886 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/data/3892ac0e9/f03368b5404e427dbf5359d6a56ee6a1/FLAGed12e4373 [2022-11-20 11:24:34,901 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/data/3892ac0e9/f03368b5404e427dbf5359d6a56ee6a1 [2022-11-20 11:24:34,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:24:34,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:24:34,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:24:34,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:24:34,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:24:34,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:24:34" (1/1) ... [2022-11-20 11:24:34,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2781d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:34, skipping insertion in model container [2022-11-20 11:24:34,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:24:34" (1/1) ... [2022-11-20 11:24:34,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:24:34,998 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:24:35,214 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_0ad72675-7916-4824-829b-ecafeaee089e/sv-benchmarks/c/pthread-wmm/thin002_power.opt.i[951,964] [2022-11-20 11:24:35,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:24:35,482 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:24:35,494 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_0ad72675-7916-4824-829b-ecafeaee089e/sv-benchmarks/c/pthread-wmm/thin002_power.opt.i[951,964] [2022-11-20 11:24:35,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:24:35,576 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:24:35,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:35 WrapperNode [2022-11-20 11:24:35,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:24:35,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:24:35,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:24:35,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:24:35,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:35" (1/1) ... [2022-11-20 11:24:35,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:35" (1/1) ... [2022-11-20 11:24:35,633 INFO L138 Inliner]: procedures = 177, calls = 84, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 199 [2022-11-20 11:24:35,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:24:35,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:24:35,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:24:35,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:24:35,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:35" (1/1) ... [2022-11-20 11:24:35,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:35" (1/1) ... [2022-11-20 11:24:35,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:35" (1/1) ... [2022-11-20 11:24:35,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:35" (1/1) ... [2022-11-20 11:24:35,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:35" (1/1) ... [2022-11-20 11:24:35,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:35" (1/1) ... [2022-11-20 11:24:35,682 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:35" (1/1) ... [2022-11-20 11:24:35,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:35" (1/1) ... [2022-11-20 11:24:35,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:24:35,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:24:35,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:24:35,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:24:35,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:35" (1/1) ... [2022-11-20 11:24:35,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:24:35,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:24:35,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:24:35,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:24:35,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:24:35,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:24:35,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 11:24:35,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:24:35,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:24:35,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:24:35,786 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 11:24:35,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 11:24:35,786 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 11:24:35,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 11:24:35,786 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 11:24:35,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 11:24:35,787 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-20 11:24:35,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-20 11:24:35,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:24:35,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 11:24:35,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:24:35,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:24:35,789 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 11:24:35,958 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:24:35,960 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:24:36,658 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:24:37,588 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:24:37,588 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 11:24:37,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:24:37 BoogieIcfgContainer [2022-11-20 11:24:37,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:24:37,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:24:37,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:24:37,598 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:24:37,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:24:34" (1/3) ... [2022-11-20 11:24:37,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efdecc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:24:37, skipping insertion in model container [2022-11-20 11:24:37,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:24:35" (2/3) ... [2022-11-20 11:24:37,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efdecc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:24:37, skipping insertion in model container [2022-11-20 11:24:37,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:24:37" (3/3) ... [2022-11-20 11:24:37,603 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.opt.i [2022-11-20 11:24:37,624 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:24:37,624 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-11-20 11:24:37,624 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 11:24:37,790 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 11:24:37,833 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 11:24:37,856 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 198 transitions, 416 flow [2022-11-20 11:24:37,861 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 198 transitions, 416 flow [2022-11-20 11:24:37,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 198 transitions, 416 flow [2022-11-20 11:24:37,998 INFO L130 PetriNetUnfolder]: 2/194 cut-off events. [2022-11-20 11:24:37,999 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 11:24:38,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 194 events. 2/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 242 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2022-11-20 11:24:38,013 INFO L119 LiptonReduction]: Number of co-enabled transitions 6900 [2022-11-20 11:25:04,956 INFO L134 LiptonReduction]: Checked pairs total: 29524 [2022-11-20 11:25:04,956 INFO L136 LiptonReduction]: Total number of compositions: 178 [2022-11-20 11:25:04,964 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 76 transitions, 172 flow [2022-11-20 11:25:07,645 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 64820 states, 63669 states have (on average 4.423879753098054) internal successors, (281664), 64819 states have internal predecessors, (281664), 0 states have call successors, (0), 0 states 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 11:25:07,685 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:25:07,692 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;@5a69883a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:25:07,692 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-11-20 11:25:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 64820 states, 63669 states have (on average 4.423879753098054) internal successors, (281664), 64819 states have internal predecessors, (281664), 0 states have call successors, (0), 0 states 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 11:25:07,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 11:25:07,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:07,785 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 11:25:07,786 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:07,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:07,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1231, now seen corresponding path program 1 times [2022-11-20 11:25:07,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:07,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402893519] [2022-11-20 11:25:07,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:07,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:08,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 11:25:08,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:08,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402893519] [2022-11-20 11:25:08,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402893519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:08,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:08,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 11:25:08,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15228451] [2022-11-20 11:25:08,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:08,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 11:25:08,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:08,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:25:08,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:25:08,462 INFO L87 Difference]: Start difference. First operand has 64820 states, 63669 states have (on average 4.423879753098054) internal successors, (281664), 64819 states have internal predecessors, (281664), 0 states have call successors, (0), 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 11:25:10,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:10,003 INFO L93 Difference]: Finished difference Result 28618 states and 121024 transitions. [2022-11-20 11:25:10,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:25:10,007 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 11:25:10,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:10,469 INFO L225 Difference]: With dead ends: 28618 [2022-11-20 11:25:10,469 INFO L226 Difference]: Without dead ends: 28618 [2022-11-20 11:25:10,470 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 11:25:10,488 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:10,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:25:10,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28618 states. [2022-11-20 11:25:11,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28618 to 28618. [2022-11-20 11:25:11,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28618 states, 28241 states have (on average 4.285400658616904) internal successors, (121024), 28617 states have internal predecessors, (121024), 0 states have call successors, (0), 0 states 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 11:25:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28618 states to 28618 states and 121024 transitions. [2022-11-20 11:25:12,406 INFO L78 Accepts]: Start accepts. Automaton has 28618 states and 121024 transitions. Word has length 1 [2022-11-20 11:25:12,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:12,406 INFO L495 AbstractCegarLoop]: Abstraction has 28618 states and 121024 transitions. [2022-11-20 11:25:12,407 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 11:25:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand 28618 states and 121024 transitions. [2022-11-20 11:25:12,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 11:25:12,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:12,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:12,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:25:12,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:12,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:12,410 INFO L85 PathProgramCache]: Analyzing trace with hash 85234803, now seen corresponding path program 1 times [2022-11-20 11:25:12,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:12,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499295165] [2022-11-20 11:25:12,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:12,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:13,015 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 11:25:13,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:13,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499295165] [2022-11-20 11:25:13,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499295165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:13,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:13,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:25:13,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672663344] [2022-11-20 11:25:13,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:13,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:25:13,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:13,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:25:13,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:25:13,020 INFO L87 Difference]: Start difference. First operand 28618 states and 121024 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 11:25:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:13,619 INFO L93 Difference]: Finished difference Result 25754 states and 108616 transitions. [2022-11-20 11:25:13,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:25:13,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-20 11:25:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:13,833 INFO L225 Difference]: With dead ends: 25754 [2022-11-20 11:25:13,834 INFO L226 Difference]: Without dead ends: 25754 [2022-11-20 11:25:13,834 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 11:25:13,852 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:13,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 8 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:25:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25754 states. [2022-11-20 11:25:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25754 to 25754. [2022-11-20 11:25:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25754 states, 25440 states have (on average 4.269496855345912) internal successors, (108616), 25753 states have internal predecessors, (108616), 0 states have call successors, (0), 0 states 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 11:25:15,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25754 states to 25754 states and 108616 transitions. [2022-11-20 11:25:15,262 INFO L78 Accepts]: Start accepts. Automaton has 25754 states and 108616 transitions. Word has length 8 [2022-11-20 11:25:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:15,263 INFO L495 AbstractCegarLoop]: Abstraction has 25754 states and 108616 transitions. [2022-11-20 11:25:15,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 11:25:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 25754 states and 108616 transitions. [2022-11-20 11:25:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 11:25:15,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:15,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:15,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:25:15,272 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:15,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:15,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1652687392, now seen corresponding path program 1 times [2022-11-20 11:25:15,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:15,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511988061] [2022-11-20 11:25:15,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:15,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:15,634 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 11:25:15,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:15,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511988061] [2022-11-20 11:25:15,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511988061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:15,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:15,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:25:15,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617214512] [2022-11-20 11:25:15,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:15,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:15,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:15,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:15,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:15,638 INFO L87 Difference]: Start difference. First operand 25754 states and 108616 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 11:25:16,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:16,198 INFO L93 Difference]: Finished difference Result 21354 states and 86208 transitions. [2022-11-20 11:25:16,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:25:16,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-20 11:25:16,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:16,357 INFO L225 Difference]: With dead ends: 21354 [2022-11-20 11:25:16,357 INFO L226 Difference]: Without dead ends: 21354 [2022-11-20 11:25:16,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 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 11:25:16,361 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 73 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:16,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 9 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:25:16,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21354 states. [2022-11-20 11:25:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21354 to 18858. [2022-11-20 11:25:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18858 states, 18729 states have (on average 4.240696246462705) internal successors, (79424), 18857 states have internal predecessors, (79424), 0 states have call successors, (0), 0 states 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 11:25:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18858 states to 18858 states and 79424 transitions. [2022-11-20 11:25:17,348 INFO L78 Accepts]: Start accepts. Automaton has 18858 states and 79424 transitions. Word has length 9 [2022-11-20 11:25:17,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:17,348 INFO L495 AbstractCegarLoop]: Abstraction has 18858 states and 79424 transitions. [2022-11-20 11:25:17,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 11:25:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 18858 states and 79424 transitions. [2022-11-20 11:25:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 11:25:17,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:17,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:17,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:25:17,350 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:17,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:17,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1652687391, now seen corresponding path program 1 times [2022-11-20 11:25:17,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:17,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858532286] [2022-11-20 11:25:17,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:17,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:17,458 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 11:25:17,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:17,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858532286] [2022-11-20 11:25:17,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858532286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:17,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:17,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:25:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953817164] [2022-11-20 11:25:17,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:17,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:25:17,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:17,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:25:17,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:25:17,461 INFO L87 Difference]: Start difference. First operand 18858 states and 79424 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 11:25:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:17,898 INFO L93 Difference]: Finished difference Result 24010 states and 101616 transitions. [2022-11-20 11:25:17,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:25:17,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-20 11:25:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:18,063 INFO L225 Difference]: With dead ends: 24010 [2022-11-20 11:25:18,063 INFO L226 Difference]: Without dead ends: 24010 [2022-11-20 11:25:18,063 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 11:25:18,064 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:18,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 12 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:25:18,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24010 states. [2022-11-20 11:25:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24010 to 21066. [2022-11-20 11:25:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21066 states, 20939 states have (on average 4.389130330961364) internal successors, (91904), 21065 states have internal predecessors, (91904), 0 states have call successors, (0), 0 states 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 11:25:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21066 states to 21066 states and 91904 transitions. [2022-11-20 11:25:19,177 INFO L78 Accepts]: Start accepts. Automaton has 21066 states and 91904 transitions. Word has length 9 [2022-11-20 11:25:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:19,177 INFO L495 AbstractCegarLoop]: Abstraction has 21066 states and 91904 transitions. [2022-11-20 11:25:19,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 11:25:19,177 INFO L276 IsEmpty]: Start isEmpty. Operand 21066 states and 91904 transitions. [2022-11-20 11:25:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 11:25:19,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:19,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:19,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:25:19,179 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:19,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:19,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1652687389, now seen corresponding path program 1 times [2022-11-20 11:25:19,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:19,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569906685] [2022-11-20 11:25:19,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:19,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:19,757 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 11:25:19,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:19,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569906685] [2022-11-20 11:25:19,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569906685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:19,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:19,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:25:19,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447454035] [2022-11-20 11:25:19,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:19,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:19,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:19,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:19,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:19,763 INFO L87 Difference]: Start difference. First operand 21066 states and 91904 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 11:25:19,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:19,935 INFO L93 Difference]: Finished difference Result 10746 states and 43624 transitions. [2022-11-20 11:25:19,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:25:19,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-20 11:25:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:19,987 INFO L225 Difference]: With dead ends: 10746 [2022-11-20 11:25:19,987 INFO L226 Difference]: Without dead ends: 10394 [2022-11-20 11:25:19,988 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 11:25:19,988 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:19,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10394 states. [2022-11-20 11:25:20,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10394 to 9962. [2022-11-20 11:25:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9962 states, 9936 states have (on average 4.093397745571659) internal successors, (40672), 9961 states have internal predecessors, (40672), 0 states have call successors, (0), 0 states 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 11:25:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9962 states to 9962 states and 40672 transitions. [2022-11-20 11:25:20,302 INFO L78 Accepts]: Start accepts. Automaton has 9962 states and 40672 transitions. Word has length 9 [2022-11-20 11:25:20,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:20,303 INFO L495 AbstractCegarLoop]: Abstraction has 9962 states and 40672 transitions. [2022-11-20 11:25:20,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 11:25:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 9962 states and 40672 transitions. [2022-11-20 11:25:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:25:20,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:20,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:20,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:25:20,305 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:20,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:20,306 INFO L85 PathProgramCache]: Analyzing trace with hash 961073538, now seen corresponding path program 1 times [2022-11-20 11:25:20,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:20,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943221545] [2022-11-20 11:25:20,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:20,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:20,397 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 11:25:20,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:20,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943221545] [2022-11-20 11:25:20,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943221545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:20,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:20,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:25:20,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909884112] [2022-11-20 11:25:20,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:20,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:25:20,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:20,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:25:20,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:25:20,400 INFO L87 Difference]: Start difference. First operand 9962 states and 40672 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 11:25:20,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:20,587 INFO L93 Difference]: Finished difference Result 9802 states and 39984 transitions. [2022-11-20 11:25:20,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:25:20,588 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 11:25:20,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:20,777 INFO L225 Difference]: With dead ends: 9802 [2022-11-20 11:25:20,778 INFO L226 Difference]: Without dead ends: 9802 [2022-11-20 11:25:20,778 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 11:25:20,778 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 7 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 11:25:20,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 7 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:20,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9802 states. [2022-11-20 11:25:21,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9802 to 9802. [2022-11-20 11:25:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9802 states, 9776 states have (on average 4.090016366612112) internal successors, (39984), 9801 states have internal predecessors, (39984), 0 states have call successors, (0), 0 states 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 11:25:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9802 states to 9802 states and 39984 transitions. [2022-11-20 11:25:21,057 INFO L78 Accepts]: Start accepts. Automaton has 9802 states and 39984 transitions. Word has length 11 [2022-11-20 11:25:21,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:21,058 INFO L495 AbstractCegarLoop]: Abstraction has 9802 states and 39984 transitions. [2022-11-20 11:25:21,058 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 11:25:21,058 INFO L276 IsEmpty]: Start isEmpty. Operand 9802 states and 39984 transitions. [2022-11-20 11:25:21,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:25:21,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:21,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:21,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:25:21,060 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:21,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:21,061 INFO L85 PathProgramCache]: Analyzing trace with hash -271585496, now seen corresponding path program 1 times [2022-11-20 11:25:21,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:21,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051671923] [2022-11-20 11:25:21,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:21,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:21,330 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 11:25:21,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:21,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051671923] [2022-11-20 11:25:21,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051671923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:21,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:21,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:25:21,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312543379] [2022-11-20 11:25:21,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:21,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:25:21,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:21,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:25:21,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:25:21,332 INFO L87 Difference]: Start difference. First operand 9802 states and 39984 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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 11:25:21,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:21,540 INFO L93 Difference]: Finished difference Result 10794 states and 43392 transitions. [2022-11-20 11:25:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:25:21,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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 11:25:21,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:21,592 INFO L225 Difference]: With dead ends: 10794 [2022-11-20 11:25:21,592 INFO L226 Difference]: Without dead ends: 10794 [2022-11-20 11:25:21,593 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 11:25:21,594 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:21,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 9 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:21,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10794 states. [2022-11-20 11:25:21,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10794 to 9482. [2022-11-20 11:25:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9482 states, 9457 states have (on average 4.090937929575976) internal successors, (38688), 9481 states have internal predecessors, (38688), 0 states have call successors, (0), 0 states 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 11:25:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9482 states to 9482 states and 38688 transitions. [2022-11-20 11:25:22,032 INFO L78 Accepts]: Start accepts. Automaton has 9482 states and 38688 transitions. Word has length 12 [2022-11-20 11:25:22,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:22,032 INFO L495 AbstractCegarLoop]: Abstraction has 9482 states and 38688 transitions. [2022-11-20 11:25:22,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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 11:25:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states and 38688 transitions. [2022-11-20 11:25:22,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:25:22,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:22,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:22,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:25:22,034 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:22,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:22,035 INFO L85 PathProgramCache]: Analyzing trace with hash -271585495, now seen corresponding path program 1 times [2022-11-20 11:25:22,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:22,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639723678] [2022-11-20 11:25:22,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:22,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:22,554 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 11:25:22,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:22,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639723678] [2022-11-20 11:25:22,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639723678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:22,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:22,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:25:22,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460739070] [2022-11-20 11:25:22,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:22,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:22,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:22,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:22,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:22,557 INFO L87 Difference]: Start difference. First operand 9482 states and 38688 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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 11:25:22,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:22,913 INFO L93 Difference]: Finished difference Result 13066 states and 52656 transitions. [2022-11-20 11:25:22,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:25:22,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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 11:25:22,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:22,974 INFO L225 Difference]: With dead ends: 13066 [2022-11-20 11:25:22,974 INFO L226 Difference]: Without dead ends: 13066 [2022-11-20 11:25:22,975 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 11:25:22,975 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 64 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:22,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 16 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:25:23,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13066 states. [2022-11-20 11:25:23,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13066 to 9738. [2022-11-20 11:25:23,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9738 states, 9713 states have (on average 4.081952023061876) internal successors, (39648), 9737 states have internal predecessors, (39648), 0 states have call successors, (0), 0 states 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 11:25:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9738 states to 9738 states and 39648 transitions. [2022-11-20 11:25:23,353 INFO L78 Accepts]: Start accepts. Automaton has 9738 states and 39648 transitions. Word has length 12 [2022-11-20 11:25:23,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:23,354 INFO L495 AbstractCegarLoop]: Abstraction has 9738 states and 39648 transitions. [2022-11-20 11:25:23,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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 11:25:23,354 INFO L276 IsEmpty]: Start isEmpty. Operand 9738 states and 39648 transitions. [2022-11-20 11:25:23,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:25:23,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:23,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:23,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 11:25:23,355 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:23,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash -271496554, now seen corresponding path program 1 times [2022-11-20 11:25:23,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:23,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877606408] [2022-11-20 11:25:23,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:23,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:23,664 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 11:25:23,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:23,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877606408] [2022-11-20 11:25:23,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877606408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:23,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:23,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:25:23,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323932458] [2022-11-20 11:25:23,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:23,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:23,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:23,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:23,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:23,667 INFO L87 Difference]: Start difference. First operand 9738 states and 39648 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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 11:25:23,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:23,894 INFO L93 Difference]: Finished difference Result 9638 states and 39193 transitions. [2022-11-20 11:25:23,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:25:23,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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 11:25:23,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:23,939 INFO L225 Difference]: With dead ends: 9638 [2022-11-20 11:25:23,939 INFO L226 Difference]: Without dead ends: 9638 [2022-11-20 11:25:23,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 11:25:23,940 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 33 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:23,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 12 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:25:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9638 states. [2022-11-20 11:25:24,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9638 to 9638. [2022-11-20 11:25:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9638 states, 9613 states have (on average 4.07708311661292) internal successors, (39193), 9637 states have internal predecessors, (39193), 0 states have call successors, (0), 0 states 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 11:25:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9638 states to 9638 states and 39193 transitions. [2022-11-20 11:25:24,184 INFO L78 Accepts]: Start accepts. Automaton has 9638 states and 39193 transitions. Word has length 12 [2022-11-20 11:25:24,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:24,184 INFO L495 AbstractCegarLoop]: Abstraction has 9638 states and 39193 transitions. [2022-11-20 11:25:24,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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 11:25:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 9638 states and 39193 transitions. [2022-11-20 11:25:24,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 11:25:24,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:24,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:24,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 11:25:24,185 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:24,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:24,186 INFO L85 PathProgramCache]: Analyzing trace with hash 690131402, now seen corresponding path program 1 times [2022-11-20 11:25:24,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:24,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109731192] [2022-11-20 11:25:24,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:24,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:24,333 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 11:25:24,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:24,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109731192] [2022-11-20 11:25:24,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109731192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:24,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:24,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:25:24,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082643457] [2022-11-20 11:25:24,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:24,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:24,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:24,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:24,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:24,335 INFO L87 Difference]: Start difference. First operand 9638 states and 39193 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 11:25:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:24,566 INFO L93 Difference]: Finished difference Result 13742 states and 55303 transitions. [2022-11-20 11:25:24,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:25:24,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 11:25:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:24,619 INFO L225 Difference]: With dead ends: 13742 [2022-11-20 11:25:24,619 INFO L226 Difference]: Without dead ends: 13742 [2022-11-20 11:25:24,620 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 11:25:24,620 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 74 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:24,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 8 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:24,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13742 states. [2022-11-20 11:25:24,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13742 to 10310. [2022-11-20 11:25:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10310 states, 10285 states have (on average 4.06660184735051) internal successors, (41825), 10309 states have internal predecessors, (41825), 0 states have call successors, (0), 0 states 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 11:25:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10310 states to 10310 states and 41825 transitions. [2022-11-20 11:25:25,058 INFO L78 Accepts]: Start accepts. Automaton has 10310 states and 41825 transitions. Word has length 13 [2022-11-20 11:25:25,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:25,059 INFO L495 AbstractCegarLoop]: Abstraction has 10310 states and 41825 transitions. [2022-11-20 11:25:25,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 11:25:25,059 INFO L276 IsEmpty]: Start isEmpty. Operand 10310 states and 41825 transitions. [2022-11-20 11:25:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:25:25,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:25,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:25,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 11:25:25,062 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:25,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:25,062 INFO L85 PathProgramCache]: Analyzing trace with hash -586796519, now seen corresponding path program 1 times [2022-11-20 11:25:25,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:25,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617504555] [2022-11-20 11:25:25,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:25,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:25,747 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 11:25:25,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:25,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617504555] [2022-11-20 11:25:25,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617504555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:25,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:25,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:25:25,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194770529] [2022-11-20 11:25:25,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:25,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:25:25,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:25,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:25:25,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:25:25,750 INFO L87 Difference]: Start difference. First operand 10310 states and 41825 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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 11:25:26,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:26,065 INFO L93 Difference]: Finished difference Result 9478 states and 38213 transitions. [2022-11-20 11:25:26,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:25:26,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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 11:25:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:26,095 INFO L225 Difference]: With dead ends: 9478 [2022-11-20 11:25:26,095 INFO L226 Difference]: Without dead ends: 9478 [2022-11-20 11:25:26,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:25:26,096 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 108 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:26,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 14 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:25:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9478 states. [2022-11-20 11:25:26,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9478 to 8878. [2022-11-20 11:25:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8878 states, 8860 states have (on average 4.051805869074492) internal successors, (35899), 8877 states have internal predecessors, (35899), 0 states have call successors, (0), 0 states 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 11:25:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 35899 transitions. [2022-11-20 11:25:26,281 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 35899 transitions. Word has length 14 [2022-11-20 11:25:26,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:26,281 INFO L495 AbstractCegarLoop]: Abstraction has 8878 states and 35899 transitions. [2022-11-20 11:25:26,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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 11:25:26,281 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 35899 transitions. [2022-11-20 11:25:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:25:26,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:26,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:26,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 11:25:26,283 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:26,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:26,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1084850997, now seen corresponding path program 1 times [2022-11-20 11:25:26,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:26,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098029060] [2022-11-20 11:25:26,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:26,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:26,428 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 11:25:26,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:26,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098029060] [2022-11-20 11:25:26,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098029060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:26,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:26,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:25:26,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883679794] [2022-11-20 11:25:26,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:26,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:25:26,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:26,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:25:26,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:25:26,430 INFO L87 Difference]: Start difference. First operand 8878 states and 35899 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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 11:25:26,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:26,779 INFO L93 Difference]: Finished difference Result 9102 states and 35771 transitions. [2022-11-20 11:25:26,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:25:26,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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 11:25:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:26,809 INFO L225 Difference]: With dead ends: 9102 [2022-11-20 11:25:26,809 INFO L226 Difference]: Without dead ends: 9102 [2022-11-20 11:25:26,809 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 11:25:26,810 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 57 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:26,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 15 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:25:26,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9102 states. [2022-11-20 11:25:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9102 to 8046. [2022-11-20 11:25:26,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8046 states, 8028 states have (on average 4.021300448430493) internal successors, (32283), 8045 states have internal predecessors, (32283), 0 states have call successors, (0), 0 states 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 11:25:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8046 states to 8046 states and 32283 transitions. [2022-11-20 11:25:26,977 INFO L78 Accepts]: Start accepts. Automaton has 8046 states and 32283 transitions. Word has length 14 [2022-11-20 11:25:26,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:26,977 INFO L495 AbstractCegarLoop]: Abstraction has 8046 states and 32283 transitions. [2022-11-20 11:25:26,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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 11:25:26,977 INFO L276 IsEmpty]: Start isEmpty. Operand 8046 states and 32283 transitions. [2022-11-20 11:25:26,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 11:25:26,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:26,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:26,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:25:26,979 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:26,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:26,980 INFO L85 PathProgramCache]: Analyzing trace with hash 909797940, now seen corresponding path program 1 times [2022-11-20 11:25:26,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:26,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519916112] [2022-11-20 11:25:26,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:26,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:27,217 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 11:25:27,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:27,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519916112] [2022-11-20 11:25:27,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519916112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:27,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:27,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:25:27,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511418236] [2022-11-20 11:25:27,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:27,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:25:27,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:27,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:25:27,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:25:27,219 INFO L87 Difference]: Start difference. First operand 8046 states and 32283 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 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 11:25:27,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:27,380 INFO L93 Difference]: Finished difference Result 8001 states and 32088 transitions. [2022-11-20 11:25:27,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:25:27,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 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 11:25:27,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:27,414 INFO L225 Difference]: With dead ends: 8001 [2022-11-20 11:25:27,414 INFO L226 Difference]: Without dead ends: 8001 [2022-11-20 11:25:27,415 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 11:25:27,415 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:27,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 8 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:27,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states. [2022-11-20 11:25:27,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8001 to 8001. [2022-11-20 11:25:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8001 states, 7983 states have (on average 4.019541525742202) internal successors, (32088), 8000 states have internal predecessors, (32088), 0 states have call successors, (0), 0 states 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 11:25:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8001 states to 8001 states and 32088 transitions. [2022-11-20 11:25:27,644 INFO L78 Accepts]: Start accepts. Automaton has 8001 states and 32088 transitions. Word has length 15 [2022-11-20 11:25:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:27,645 INFO L495 AbstractCegarLoop]: Abstraction has 8001 states and 32088 transitions. [2022-11-20 11:25:27,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 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 11:25:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 8001 states and 32088 transitions. [2022-11-20 11:25:27,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 11:25:27,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:27,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:27,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:25:27,649 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:27,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:27,649 INFO L85 PathProgramCache]: Analyzing trace with hash -729355614, now seen corresponding path program 1 times [2022-11-20 11:25:27,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:27,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944972845] [2022-11-20 11:25:27,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:27,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:27,889 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 11:25:27,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:27,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944972845] [2022-11-20 11:25:27,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944972845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:27,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:27,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:25:27,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253205868] [2022-11-20 11:25:27,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:27,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:25:27,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:27,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:25:27,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:25:27,891 INFO L87 Difference]: Start difference. First operand 8001 states and 32088 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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 11:25:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:28,249 INFO L93 Difference]: Finished difference Result 8033 states and 31352 transitions. [2022-11-20 11:25:28,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:25:28,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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 11:25:28,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:28,290 INFO L225 Difference]: With dead ends: 8033 [2022-11-20 11:25:28,291 INFO L226 Difference]: Without dead ends: 8033 [2022-11-20 11:25:28,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:25:28,291 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 72 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:28,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 23 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:25:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8033 states. [2022-11-20 11:25:28,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8033 to 7169. [2022-11-20 11:25:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7169 states, 7151 states have (on average 3.98154104321074) internal successors, (28472), 7168 states have internal predecessors, (28472), 0 states have call successors, (0), 0 states 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 11:25:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7169 states to 7169 states and 28472 transitions. [2022-11-20 11:25:28,577 INFO L78 Accepts]: Start accepts. Automaton has 7169 states and 28472 transitions. Word has length 15 [2022-11-20 11:25:28,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:28,577 INFO L495 AbstractCegarLoop]: Abstraction has 7169 states and 28472 transitions. [2022-11-20 11:25:28,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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 11:25:28,578 INFO L276 IsEmpty]: Start isEmpty. Operand 7169 states and 28472 transitions. [2022-11-20 11:25:28,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:25:28,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:28,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:28,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:25:28,584 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:28,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1245281822, now seen corresponding path program 1 times [2022-11-20 11:25:28,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:28,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568584858] [2022-11-20 11:25:28,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:28,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:28,884 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 11:25:28,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:28,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568584858] [2022-11-20 11:25:28,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568584858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:28,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:28,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:25:28,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296133576] [2022-11-20 11:25:28,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:28,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:28,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:28,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:28,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:28,887 INFO L87 Difference]: Start difference. First operand 7169 states and 28472 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 11:25:29,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:29,164 INFO L93 Difference]: Finished difference Result 9830 states and 38148 transitions. [2022-11-20 11:25:29,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:25:29,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 11:25:29,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:29,215 INFO L225 Difference]: With dead ends: 9830 [2022-11-20 11:25:29,215 INFO L226 Difference]: Without dead ends: 9830 [2022-11-20 11:25:29,217 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 11:25:29,218 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:29,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 11 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:25:29,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9830 states. [2022-11-20 11:25:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9830 to 6980. [2022-11-20 11:25:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6980 states, 6962 states have (on average 3.9758690031600117) internal successors, (27680), 6979 states have internal predecessors, (27680), 0 states have call successors, (0), 0 states 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 11:25:29,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6980 states to 6980 states and 27680 transitions. [2022-11-20 11:25:29,465 INFO L78 Accepts]: Start accepts. Automaton has 6980 states and 27680 transitions. Word has length 16 [2022-11-20 11:25:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:29,465 INFO L495 AbstractCegarLoop]: Abstraction has 6980 states and 27680 transitions. [2022-11-20 11:25:29,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 11:25:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand 6980 states and 27680 transitions. [2022-11-20 11:25:29,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:25:29,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:29,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:29,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:25:29,471 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:29,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:29,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1135185862, now seen corresponding path program 1 times [2022-11-20 11:25:29,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:29,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405054489] [2022-11-20 11:25:29,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:29,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:29,939 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 11:25:29,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:29,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405054489] [2022-11-20 11:25:29,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405054489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:29,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:29,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:25:29,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183494086] [2022-11-20 11:25:29,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:29,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:25:29,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:29,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:25:29,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:25:29,945 INFO L87 Difference]: Start difference. First operand 6980 states and 27680 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 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 11:25:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:30,445 INFO L93 Difference]: Finished difference Result 6820 states and 25728 transitions. [2022-11-20 11:25:30,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:25:30,446 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 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 11:25:30,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:30,471 INFO L225 Difference]: With dead ends: 6820 [2022-11-20 11:25:30,472 INFO L226 Difference]: Without dead ends: 6820 [2022-11-20 11:25:30,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:25:30,472 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 186 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:30,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 35 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:25:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6820 states. [2022-11-20 11:25:30,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6820 to 6148. [2022-11-20 11:25:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6148 states, 6130 states have (on average 3.789885807504078) internal successors, (23232), 6147 states have internal predecessors, (23232), 0 states have call successors, (0), 0 states 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 11:25:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6148 states to 6148 states and 23232 transitions. [2022-11-20 11:25:30,644 INFO L78 Accepts]: Start accepts. Automaton has 6148 states and 23232 transitions. Word has length 16 [2022-11-20 11:25:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:30,645 INFO L495 AbstractCegarLoop]: Abstraction has 6148 states and 23232 transitions. [2022-11-20 11:25:30,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 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 11:25:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 6148 states and 23232 transitions. [2022-11-20 11:25:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 11:25:30,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:30,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:30,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 11:25:30,649 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:30,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:30,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1135185798, now seen corresponding path program 1 times [2022-11-20 11:25:30,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:30,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109497234] [2022-11-20 11:25:30,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:30,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:31,386 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 11:25:31,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:31,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109497234] [2022-11-20 11:25:31,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109497234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:31,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:31,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:25:31,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079297752] [2022-11-20 11:25:31,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:31,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:25:31,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:31,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:25:31,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:25:31,388 INFO L87 Difference]: Start difference. First operand 6148 states and 23232 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 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 11:25:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:32,241 INFO L93 Difference]: Finished difference Result 4900 states and 18672 transitions. [2022-11-20 11:25:32,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:25:32,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 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 11:25:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:32,257 INFO L225 Difference]: With dead ends: 4900 [2022-11-20 11:25:32,257 INFO L226 Difference]: Without dead ends: 4464 [2022-11-20 11:25:32,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:25:32,258 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 104 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:32,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 110 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 11:25:32,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4464 states. [2022-11-20 11:25:32,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4464 to 4464. [2022-11-20 11:25:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4464 states, 4455 states have (on average 3.71672278338945) internal successors, (16558), 4463 states have internal predecessors, (16558), 0 states have call successors, (0), 0 states 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 11:25:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4464 states to 4464 states and 16558 transitions. [2022-11-20 11:25:32,342 INFO L78 Accepts]: Start accepts. Automaton has 4464 states and 16558 transitions. Word has length 16 [2022-11-20 11:25:32,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:32,343 INFO L495 AbstractCegarLoop]: Abstraction has 4464 states and 16558 transitions. [2022-11-20 11:25:32,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 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 11:25:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4464 states and 16558 transitions. [2022-11-20 11:25:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 11:25:32,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:32,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:32,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 11:25:32,348 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:32,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1857664732, now seen corresponding path program 1 times [2022-11-20 11:25:32,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:32,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167498832] [2022-11-20 11:25:32,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:32,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:32,549 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 11:25:32,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:32,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167498832] [2022-11-20 11:25:32,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167498832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:32,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:32,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:25:32,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837300748] [2022-11-20 11:25:32,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:32,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:25:32,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:32,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:25:32,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:25:32,552 INFO L87 Difference]: Start difference. First operand 4464 states and 16558 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 11:25:32,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:32,677 INFO L93 Difference]: Finished difference Result 4446 states and 16489 transitions. [2022-11-20 11:25:32,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:25:32,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-11-20 11:25:32,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:32,697 INFO L225 Difference]: With dead ends: 4446 [2022-11-20 11:25:32,698 INFO L226 Difference]: Without dead ends: 4446 [2022-11-20 11:25:32,698 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 11:25:32,699 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:32,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2022-11-20 11:25:32,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 4446. [2022-11-20 11:25:32,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4446 states, 4437 states have (on average 3.716249718278116) internal successors, (16489), 4445 states have internal predecessors, (16489), 0 states have call successors, (0), 0 states 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 11:25:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4446 states to 4446 states and 16489 transitions. [2022-11-20 11:25:32,882 INFO L78 Accepts]: Start accepts. Automaton has 4446 states and 16489 transitions. Word has length 17 [2022-11-20 11:25:32,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:32,883 INFO L495 AbstractCegarLoop]: Abstraction has 4446 states and 16489 transitions. [2022-11-20 11:25:32,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 11:25:32,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4446 states and 16489 transitions. [2022-11-20 11:25:32,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 11:25:32,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:32,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:32,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 11:25:32,888 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:32,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:32,889 INFO L85 PathProgramCache]: Analyzing trace with hash -831018934, now seen corresponding path program 1 times [2022-11-20 11:25:32,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:32,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059328119] [2022-11-20 11:25:32,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:32,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:32,976 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 11:25:32,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:32,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059328119] [2022-11-20 11:25:32,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059328119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:32,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:32,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:25:32,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670189942] [2022-11-20 11:25:32,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:32,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:32,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:32,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:32,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:32,979 INFO L87 Difference]: Start difference. First operand 4446 states and 16489 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 11:25:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:33,104 INFO L93 Difference]: Finished difference Result 5022 states and 18953 transitions. [2022-11-20 11:25:33,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:25:33,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-11-20 11:25:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:33,107 INFO L225 Difference]: With dead ends: 5022 [2022-11-20 11:25:33,107 INFO L226 Difference]: Without dead ends: 605 [2022-11-20 11:25:33,108 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 11:25:33,108 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 53 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:33,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 6 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-11-20 11:25:33,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 573. [2022-11-20 11:25:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 3.2604895104895104) internal successors, (1865), 572 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states 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 11:25:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1865 transitions. [2022-11-20 11:25:33,122 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1865 transitions. Word has length 17 [2022-11-20 11:25:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:33,122 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 1865 transitions. [2022-11-20 11:25:33,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 11:25:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1865 transitions. [2022-11-20 11:25:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 11:25:33,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:33,123 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 11:25:33,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 11:25:33,124 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:33,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1121747831, now seen corresponding path program 1 times [2022-11-20 11:25:33,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:33,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509692881] [2022-11-20 11:25:33,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:33,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:25:33,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:33,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509692881] [2022-11-20 11:25:33,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509692881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:33,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:33,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:25:33,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794484293] [2022-11-20 11:25:33,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:33,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:33,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:33,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:33,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:33,323 INFO L87 Difference]: Start difference. First operand 573 states and 1865 transitions. Second operand has 4 states, 3 states have (on average 6.0) 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 11:25:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:33,422 INFO L93 Difference]: Finished difference Result 693 states and 2215 transitions. [2022-11-20 11:25:33,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:25:33,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) 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 11:25:33,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:33,423 INFO L225 Difference]: With dead ends: 693 [2022-11-20 11:25:33,424 INFO L226 Difference]: Without dead ends: 297 [2022-11-20 11:25:33,424 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 11:25:33,424 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:33,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-11-20 11:25:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2022-11-20 11:25:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 3.010135135135135) internal successors, (891), 296 states have internal predecessors, (891), 0 states have call successors, (0), 0 states 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 11:25:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 891 transitions. [2022-11-20 11:25:33,431 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 891 transitions. Word has length 18 [2022-11-20 11:25:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:33,432 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 891 transitions. [2022-11-20 11:25:33,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) 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 11:25:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 891 transitions. [2022-11-20 11:25:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 11:25:33,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:33,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:33,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 11:25:33,433 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:33,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:33,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1490438157, now seen corresponding path program 1 times [2022-11-20 11:25:33,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:33,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461241564] [2022-11-20 11:25:33,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:33,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:34,679 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 11:25:34,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:34,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461241564] [2022-11-20 11:25:34,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461241564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:34,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:34,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:25:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008276526] [2022-11-20 11:25:34,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:34,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:25:34,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:34,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:25:34,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:25:34,680 INFO L87 Difference]: Start difference. First operand 297 states and 891 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 11:25:34,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:34,905 INFO L93 Difference]: Finished difference Result 313 states and 935 transitions. [2022-11-20 11:25:34,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:25:34,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-11-20 11:25:34,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:34,906 INFO L225 Difference]: With dead ends: 313 [2022-11-20 11:25:34,907 INFO L226 Difference]: Without dead ends: 313 [2022-11-20 11:25:34,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:25:34,908 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:34,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:25:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-11-20 11:25:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 297. [2022-11-20 11:25:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 2.9695945945945947) internal successors, (879), 296 states have internal predecessors, (879), 0 states have call successors, (0), 0 states 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 11:25:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 879 transitions. [2022-11-20 11:25:34,914 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 879 transitions. Word has length 19 [2022-11-20 11:25:34,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:34,915 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 879 transitions. [2022-11-20 11:25:34,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 11:25:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 879 transitions. [2022-11-20 11:25:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 11:25:34,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:34,916 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 11:25:34,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 11:25:34,916 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:34,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash 862250328, now seen corresponding path program 1 times [2022-11-20 11:25:34,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:34,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211642675] [2022-11-20 11:25:34,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:34,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:36,100 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 11:25:36,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:36,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211642675] [2022-11-20 11:25:36,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211642675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:36,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:36,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:25:36,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276225827] [2022-11-20 11:25:36,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:36,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:25:36,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:36,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:25:36,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:25:36,102 INFO L87 Difference]: Start difference. First operand 297 states and 879 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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 11:25:36,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:36,365 INFO L93 Difference]: Finished difference Result 293 states and 863 transitions. [2022-11-20 11:25:36,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:25:36,366 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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 11:25:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:36,367 INFO L225 Difference]: With dead ends: 293 [2022-11-20 11:25:36,367 INFO L226 Difference]: Without dead ends: 293 [2022-11-20 11:25:36,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:25:36,368 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 39 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:36,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 18 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:25:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-20 11:25:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 289. [2022-11-20 11:25:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 2.954861111111111) internal successors, (851), 288 states have internal predecessors, (851), 0 states have call successors, (0), 0 states 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 11:25:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 851 transitions. [2022-11-20 11:25:36,374 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 851 transitions. Word has length 20 [2022-11-20 11:25:36,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:36,374 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 851 transitions. [2022-11-20 11:25:36,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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 11:25:36,375 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 851 transitions. [2022-11-20 11:25:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:25:36,376 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:36,376 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] [2022-11-20 11:25:36,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 11:25:36,377 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2086814029, now seen corresponding path program 1 times [2022-11-20 11:25:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:36,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295445499] [2022-11-20 11:25:36,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:36,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:38,588 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 11:25:38,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:38,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295445499] [2022-11-20 11:25:38,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295445499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:38,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:38,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:25:38,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51605374] [2022-11-20 11:25:38,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:38,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:25:38,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:38,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:25:38,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:25:38,592 INFO L87 Difference]: Start difference. First operand 289 states and 851 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 11:25:38,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:38,870 INFO L93 Difference]: Finished difference Result 301 states and 883 transitions. [2022-11-20 11:25:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:25:38,871 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-11-20 11:25:38,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:38,872 INFO L225 Difference]: With dead ends: 301 [2022-11-20 11:25:38,872 INFO L226 Difference]: Without dead ends: 301 [2022-11-20 11:25:38,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:25:38,872 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:38,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:25:38,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-11-20 11:25:38,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 293. [2022-11-20 11:25:38,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 2.9554794520547945) internal successors, (863), 292 states have internal predecessors, (863), 0 states have call successors, (0), 0 states 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 11:25:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 863 transitions. [2022-11-20 11:25:38,879 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 863 transitions. Word has length 21 [2022-11-20 11:25:38,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:38,879 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 863 transitions. [2022-11-20 11:25:38,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 11:25:38,880 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 863 transitions. [2022-11-20 11:25:38,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:25:38,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:38,881 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] [2022-11-20 11:25:38,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 11:25:38,881 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:38,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:38,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2086813192, now seen corresponding path program 1 times [2022-11-20 11:25:38,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:38,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98542841] [2022-11-20 11:25:38,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:38,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:39,222 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 11:25:39,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:39,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98542841] [2022-11-20 11:25:39,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98542841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:39,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:39,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:25:39,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860814654] [2022-11-20 11:25:39,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:39,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:25:39,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:39,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:25:39,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:25:39,228 INFO L87 Difference]: Start difference. First operand 293 states and 863 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 11:25:39,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:39,293 INFO L93 Difference]: Finished difference Result 252 states and 696 transitions. [2022-11-20 11:25:39,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:25:39,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-11-20 11:25:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:39,294 INFO L225 Difference]: With dead ends: 252 [2022-11-20 11:25:39,295 INFO L226 Difference]: Without dead ends: 252 [2022-11-20 11:25:39,296 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 11:25:39,297 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:39,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:39,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-20 11:25:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2022-11-20 11:25:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 2.7729083665338647) internal successors, (696), 251 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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 11:25:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 696 transitions. [2022-11-20 11:25:39,305 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 696 transitions. Word has length 21 [2022-11-20 11:25:39,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:39,305 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 696 transitions. [2022-11-20 11:25:39,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 11:25:39,305 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 696 transitions. [2022-11-20 11:25:39,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:25:39,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:39,307 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 11:25:39,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 11:25:39,307 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:39,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:39,308 INFO L85 PathProgramCache]: Analyzing trace with hash 458271270, now seen corresponding path program 1 times [2022-11-20 11:25:39,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:39,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051537878] [2022-11-20 11:25:39,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:39,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:41,497 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 11:25:41,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:41,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051537878] [2022-11-20 11:25:41,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051537878] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:41,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:41,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:25:41,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148421440] [2022-11-20 11:25:41,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:41,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:25:41,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:41,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:25:41,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:25:41,500 INFO L87 Difference]: Start difference. First operand 252 states and 696 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 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 11:25:41,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:41,761 INFO L93 Difference]: Finished difference Result 280 states and 775 transitions. [2022-11-20 11:25:41,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:25:41,762 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 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 11:25:41,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:41,763 INFO L225 Difference]: With dead ends: 280 [2022-11-20 11:25:41,763 INFO L226 Difference]: Without dead ends: 280 [2022-11-20 11:25:41,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:25:41,764 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:41,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:25:41,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-20 11:25:41,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 267. [2022-11-20 11:25:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 2.8045112781954886) internal successors, (746), 266 states have internal predecessors, (746), 0 states have call successors, (0), 0 states 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 11:25:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 746 transitions. [2022-11-20 11:25:41,777 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 746 transitions. Word has length 22 [2022-11-20 11:25:41,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:41,777 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 746 transitions. [2022-11-20 11:25:41,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 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 11:25:41,777 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 746 transitions. [2022-11-20 11:25:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:25:41,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:41,780 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 11:25:41,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 11:25:41,780 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:41,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash -4305468, now seen corresponding path program 1 times [2022-11-20 11:25:41,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:41,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705539469] [2022-11-20 11:25:41,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:41,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:44,616 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 11:25:44,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:44,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705539469] [2022-11-20 11:25:44,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705539469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:44,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:44,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 11:25:44,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375561304] [2022-11-20 11:25:44,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:44,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 11:25:44,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:44,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 11:25:44,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:25:44,619 INFO L87 Difference]: Start difference. First operand 267 states and 746 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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 11:25:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:45,063 INFO L93 Difference]: Finished difference Result 260 states and 723 transitions. [2022-11-20 11:25:45,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:25:45,063 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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 11:25:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:45,065 INFO L225 Difference]: With dead ends: 260 [2022-11-20 11:25:45,065 INFO L226 Difference]: Without dead ends: 260 [2022-11-20 11:25:45,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:25:45,066 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 42 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:45,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 17 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:25:45,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-20 11:25:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 235. [2022-11-20 11:25:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 2.7735042735042734) internal successors, (649), 234 states have internal predecessors, (649), 0 states have call successors, (0), 0 states 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 11:25:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 649 transitions. [2022-11-20 11:25:45,075 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 649 transitions. Word has length 22 [2022-11-20 11:25:45,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:45,075 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 649 transitions. [2022-11-20 11:25:45,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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 11:25:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 649 transitions. [2022-11-20 11:25:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 11:25:45,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:45,077 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 11:25:45,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 11:25:45,078 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:45,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:45,078 INFO L85 PathProgramCache]: Analyzing trace with hash 116931285, now seen corresponding path program 1 times [2022-11-20 11:25:45,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:45,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599544406] [2022-11-20 11:25:45,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:45,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:45,393 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 11:25:45,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:45,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599544406] [2022-11-20 11:25:45,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599544406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:45,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:45,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:25:45,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854395814] [2022-11-20 11:25:45,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:45,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:25:45,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:45,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:25:45,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:25:45,395 INFO L87 Difference]: Start difference. First operand 235 states and 649 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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 11:25:45,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:45,484 INFO L93 Difference]: Finished difference Result 168 states and 401 transitions. [2022-11-20 11:25:45,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:25:45,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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 11:25:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:45,485 INFO L225 Difference]: With dead ends: 168 [2022-11-20 11:25:45,485 INFO L226 Difference]: Without dead ends: 168 [2022-11-20 11:25:45,486 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 11:25:45,486 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:45,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 7 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-20 11:25:45,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-11-20 11:25:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 2.4011976047904193) internal successors, (401), 167 states have internal predecessors, (401), 0 states have call successors, (0), 0 states 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 11:25:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 401 transitions. [2022-11-20 11:25:45,491 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 401 transitions. Word has length 22 [2022-11-20 11:25:45,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:45,491 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 401 transitions. [2022-11-20 11:25:45,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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 11:25:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 401 transitions. [2022-11-20 11:25:45,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 11:25:45,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:45,492 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, 1] [2022-11-20 11:25:45,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 11:25:45,492 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:45,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:45,493 INFO L85 PathProgramCache]: Analyzing trace with hash -852614873, now seen corresponding path program 1 times [2022-11-20 11:25:45,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:45,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045818715] [2022-11-20 11:25:45,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:45,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:45,806 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 11:25:45,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:45,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045818715] [2022-11-20 11:25:45,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045818715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:45,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:45,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:25:45,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751623378] [2022-11-20 11:25:45,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:45,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:25:45,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:45,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:25:45,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:25:45,809 INFO L87 Difference]: Start difference. First operand 168 states and 401 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 11:25:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:45,908 INFO L93 Difference]: Finished difference Result 113 states and 240 transitions. [2022-11-20 11:25:45,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:25:45,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-20 11:25:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:45,909 INFO L225 Difference]: With dead ends: 113 [2022-11-20 11:25:45,909 INFO L226 Difference]: Without dead ends: 113 [2022-11-20 11:25:45,909 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 11:25:45,910 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 55 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:45,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 7 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:45,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-20 11:25:45,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-11-20 11:25:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 2.142857142857143) internal successors, (240), 112 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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 11:25:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 240 transitions. [2022-11-20 11:25:45,913 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 240 transitions. Word has length 23 [2022-11-20 11:25:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:45,913 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 240 transitions. [2022-11-20 11:25:45,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 11:25:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 240 transitions. [2022-11-20 11:25:45,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 11:25:45,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:45,914 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, 1, 1] [2022-11-20 11:25:45,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-20 11:25:45,915 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:45,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash -662649263, now seen corresponding path program 1 times [2022-11-20 11:25:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:45,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677574702] [2022-11-20 11:25:45,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:45,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:25:46,240 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 11:25:46,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:25:46,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677574702] [2022-11-20 11:25:46,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677574702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:25:46,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:25:46,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:25:46,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595497788] [2022-11-20 11:25:46,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:25:46,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:25:46,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:25:46,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:25:46,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:25:46,243 INFO L87 Difference]: Start difference. First operand 113 states and 240 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 11:25:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:25:46,360 INFO L93 Difference]: Finished difference Result 92 states and 198 transitions. [2022-11-20 11:25:46,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:25:46,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-20 11:25:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:25:46,362 INFO L225 Difference]: With dead ends: 92 [2022-11-20 11:25:46,362 INFO L226 Difference]: Without dead ends: 92 [2022-11-20 11:25:46,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:25:46,363 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 62 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:25:46,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 7 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:25:46,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-20 11:25:46,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-20 11:25:46,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.1758241758241756) internal successors, (198), 91 states have internal predecessors, (198), 0 states have call successors, (0), 0 states 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 11:25:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 198 transitions. [2022-11-20 11:25:46,366 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 198 transitions. Word has length 24 [2022-11-20 11:25:46,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:25:46,367 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 198 transitions. [2022-11-20 11:25:46,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 11:25:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 198 transitions. [2022-11-20 11:25:46,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:25:46,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:25:46,368 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, 1, 1, 1, 1] [2022-11-20 11:25:46,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-20 11:25:46,369 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:25:46,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:25:46,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2066189107, now seen corresponding path program 1 times [2022-11-20 11:25:46,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:25:46,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492668121] [2022-11-20 11:25:46,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:25:46,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:25:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:25:46,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:25:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:25:46,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:25:46,609 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 11:25:46,611 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (69 of 70 remaining) [2022-11-20 11:25:46,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (68 of 70 remaining) [2022-11-20 11:25:46,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 70 remaining) [2022-11-20 11:25:46,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 70 remaining) [2022-11-20 11:25:46,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 70 remaining) [2022-11-20 11:25:46,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 70 remaining) [2022-11-20 11:25:46,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 70 remaining) [2022-11-20 11:25:46,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 70 remaining) [2022-11-20 11:25:46,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 70 remaining) [2022-11-20 11:25:46,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 70 remaining) [2022-11-20 11:25:46,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 70 remaining) [2022-11-20 11:25:46,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 70 remaining) [2022-11-20 11:25:46,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 70 remaining) [2022-11-20 11:25:46,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 70 remaining) [2022-11-20 11:25:46,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 70 remaining) [2022-11-20 11:25:46,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 70 remaining) [2022-11-20 11:25:46,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 70 remaining) [2022-11-20 11:25:46,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 70 remaining) [2022-11-20 11:25:46,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 70 remaining) [2022-11-20 11:25:46,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 70 remaining) [2022-11-20 11:25:46,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 70 remaining) [2022-11-20 11:25:46,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 70 remaining) [2022-11-20 11:25:46,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 70 remaining) [2022-11-20 11:25:46,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 70 remaining) [2022-11-20 11:25:46,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 70 remaining) [2022-11-20 11:25:46,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 70 remaining) [2022-11-20 11:25:46,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 70 remaining) [2022-11-20 11:25:46,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 70 remaining) [2022-11-20 11:25:46,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 70 remaining) [2022-11-20 11:25:46,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 70 remaining) [2022-11-20 11:25:46,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 70 remaining) [2022-11-20 11:25:46,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 70 remaining) [2022-11-20 11:25:46,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 70 remaining) [2022-11-20 11:25:46,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 70 remaining) [2022-11-20 11:25:46,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 70 remaining) [2022-11-20 11:25:46,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 70 remaining) [2022-11-20 11:25:46,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 70 remaining) [2022-11-20 11:25:46,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 70 remaining) [2022-11-20 11:25:46,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 70 remaining) [2022-11-20 11:25:46,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 70 remaining) [2022-11-20 11:25:46,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (29 of 70 remaining) [2022-11-20 11:25:46,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 70 remaining) [2022-11-20 11:25:46,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 70 remaining) [2022-11-20 11:25:46,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 70 remaining) [2022-11-20 11:25:46,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 70 remaining) [2022-11-20 11:25:46,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 70 remaining) [2022-11-20 11:25:46,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 70 remaining) [2022-11-20 11:25:46,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 70 remaining) [2022-11-20 11:25:46,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 70 remaining) [2022-11-20 11:25:46,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 70 remaining) [2022-11-20 11:25:46,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 70 remaining) [2022-11-20 11:25:46,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 70 remaining) [2022-11-20 11:25:46,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 70 remaining) [2022-11-20 11:25:46,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 70 remaining) [2022-11-20 11:25:46,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 70 remaining) [2022-11-20 11:25:46,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 70 remaining) [2022-11-20 11:25:46,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 70 remaining) [2022-11-20 11:25:46,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 70 remaining) [2022-11-20 11:25:46,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 70 remaining) [2022-11-20 11:25:46,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 70 remaining) [2022-11-20 11:25:46,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 70 remaining) [2022-11-20 11:25:46,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 70 remaining) [2022-11-20 11:25:46,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 70 remaining) [2022-11-20 11:25:46,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 70 remaining) [2022-11-20 11:25:46,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 70 remaining) [2022-11-20 11:25:46,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 70 remaining) [2022-11-20 11:25:46,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 70 remaining) [2022-11-20 11:25:46,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 70 remaining) [2022-11-20 11:25:46,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 70 remaining) [2022-11-20 11:25:46,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 70 remaining) [2022-11-20 11:25:46,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-20 11:25:46,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:25:46,638 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 11:25:46,639 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:25:46,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:25:46 BasicIcfg [2022-11-20 11:25:46,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:25:46,752 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:25:46,752 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:25:46,753 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:25:46,753 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:24:37" (3/4) ... [2022-11-20 11:25:46,756 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 11:25:46,756 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:25:46,757 INFO L158 Benchmark]: Toolchain (without parser) took 71845.18ms. Allocated memory was 140.5MB in the beginning and 11.3GB in the end (delta: 11.2GB). Free memory was 94.3MB in the beginning and 7.1GB in the end (delta: -7.0GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2022-11-20 11:25:46,757 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 100.7MB. Free memory was 70.0MB in the beginning and 69.9MB in the end (delta: 91.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:25:46,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 663.98ms. Allocated memory is still 140.5MB. Free memory was 94.3MB in the beginning and 93.5MB in the end (delta: 802.3kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 11:25:46,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.72ms. Allocated memory is still 140.5MB. Free memory was 93.5MB in the beginning and 90.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 11:25:46,758 INFO L158 Benchmark]: Boogie Preprocessor took 70.50ms. Allocated memory is still 140.5MB. Free memory was 90.6MB in the beginning and 88.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:25:46,759 INFO L158 Benchmark]: RCFGBuilder took 1886.39ms. Allocated memory was 140.5MB in the beginning and 178.3MB in the end (delta: 37.7MB). Free memory was 88.5MB in the beginning and 77.8MB in the end (delta: 10.7MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2022-11-20 11:25:46,759 INFO L158 Benchmark]: TraceAbstraction took 69157.71ms. Allocated memory was 178.3MB in the beginning and 11.3GB in the end (delta: 11.2GB). Free memory was 76.7MB in the beginning and 7.1GB in the end (delta: -7.0GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. [2022-11-20 11:25:46,759 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 11.3GB. Free memory was 7.1GB in the beginning and 7.1GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:25:46,761 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.85ms. Allocated memory is still 100.7MB. Free memory was 70.0MB in the beginning and 69.9MB in the end (delta: 91.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 663.98ms. Allocated memory is still 140.5MB. Free memory was 94.3MB in the beginning and 93.5MB in the end (delta: 802.3kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.72ms. Allocated memory is still 140.5MB. Free memory was 93.5MB in the beginning and 90.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.50ms. Allocated memory is still 140.5MB. Free memory was 90.6MB in the beginning and 88.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1886.39ms. Allocated memory was 140.5MB in the beginning and 178.3MB in the end (delta: 37.7MB). Free memory was 88.5MB in the beginning and 77.8MB in the end (delta: 10.7MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. * TraceAbstraction took 69157.71ms. Allocated memory was 178.3MB in the beginning and 11.3GB in the end (delta: 11.2GB). Free memory was 76.7MB in the beginning and 7.1GB in the end (delta: -7.0GB). Peak memory consumption was 4.1GB. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 11.3GB. Free memory was 7.1GB in the beginning and 7.1GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.1s, 209 PlacesBefore, 88 PlacesAfterwards, 198 TransitionsBefore, 76 TransitionsAfterwards, 6900 CoEnabledTransitionPairs, 8 FixpointIterations, 76 TrivialSequentialCompositions, 94 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 178 TotalNumberOfCompositions, 29524 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13061, independent: 12548, independent conditional: 0, independent unconditional: 12548, dependent: 509, dependent conditional: 0, dependent unconditional: 509, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4360, independent: 4253, independent conditional: 0, independent unconditional: 4253, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4360, independent: 4035, independent conditional: 0, independent unconditional: 4035, dependent: 325, dependent conditional: 0, dependent unconditional: 325, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 325, independent: 218, independent conditional: 0, independent unconditional: 218, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1824, independent: 855, independent conditional: 0, independent unconditional: 855, dependent: 924, dependent conditional: 0, dependent unconditional: 924, unknown: 44, unknown conditional: 0, unknown unconditional: 44] ], Cache Queries: [ total: 13061, independent: 8295, independent conditional: 0, independent unconditional: 8295, dependent: 403, dependent conditional: 0, dependent unconditional: 403, unknown: 4363, unknown conditional: 0, unknown unconditional: 4363] , Statistics on independence cache: Total cache size (in pairs): 898, Positive cache size: 849, Positive conditional cache size: 0, Positive unconditional cache size: 849, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1 - 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L719] 0 _Bool __unbuffered_p3_EAX$flush_delayed; [L720] 0 int __unbuffered_p3_EAX$mem_tmp; [L721] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd0; [L722] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd1; [L723] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd2; [L724] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd3; [L725] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd4; [L726] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd0; [L727] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd1; [L728] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd2; [L729] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd3; [L730] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd4; [L731] 0 _Bool __unbuffered_p3_EAX$read_delayed; [L732] 0 int *__unbuffered_p3_EAX$read_delayed_var; [L733] 0 int __unbuffered_p3_EAX$w_buff0; [L734] 0 _Bool __unbuffered_p3_EAX$w_buff0_used; [L735] 0 int __unbuffered_p3_EAX$w_buff1; [L736] 0 _Bool __unbuffered_p3_EAX$w_buff1_used; [L738] 0 int a = 0; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice1; [L767] 0 _Bool weak$$choice2; [L875] 0 pthread_t t2709; [L876] FCALL, FORK 0 pthread_create(&t2709, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2709, ((void *)0), P0, ((void *)0))=-3, t2709={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t2710; [L878] FCALL, FORK 0 pthread_create(&t2710, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2710, ((void *)0), P1, ((void *)0))=-2, t2709={7:0}, t2710={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L879] 0 pthread_t t2711; [L880] FCALL, FORK 0 pthread_create(&t2711, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2711, ((void *)0), P2, ((void *)0))=-1, t2709={7:0}, t2710={8:0}, t2711={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L881] 0 pthread_t t2712; [L882] FCALL, FORK 0 pthread_create(&t2712, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2712, ((void *)0), P3, ((void *)0))=0, t2709={7:0}, t2710={8:0}, t2711={9:0}, t2712={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 z$flush_delayed = weak$$choice2 [L834] EXPR 4 \read(z) [L834] 4 z$mem_tmp = z [L835] 4 weak$$choice1 = __VERIFIER_nondet_bool() [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] EXPR 4 \read(z) [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] 4 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L837] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)))) [L838] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)))) [L839] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : weak$$choice0)))) [L840] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L841] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L842] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$r_buff1_thd4 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L843] 4 __unbuffered_p3_EAX$read_delayed = (_Bool)1 [L844] 4 __unbuffered_p3_EAX$read_delayed_var = &z [L845] EXPR 4 \read(z) [L845] 4 __unbuffered_p3_EAX = z [L846] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L846] 4 z = z$flush_delayed ? z$mem_tmp : z [L847] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=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=255, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 \read(z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L854] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L855] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L856] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L857] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L862] 4 return 0; [L771] 1 __unbuffered_p0_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, 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=0, weak$$choice1=1, weak$$choice2=255, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, 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=0, weak$$choice1=1, weak$$choice2=255, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=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=0, weak$$choice1=1, weak$$choice2=255, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=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=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, 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=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1 = z$w_buff0 [L805] 3 z$w_buff0 = 1 [L806] 3 z$w_buff1_used = z$w_buff0_used [L807] 3 z$w_buff0_used = (_Bool)1 [L808] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L808] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 3 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, 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=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L820] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L821] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, 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=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L884] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L886] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L886] RET 0 assume_abort_if_not(main$tmp_guard0) [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 \read(z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L889] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L890] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L891] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L892] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=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, t2709={7:0}, t2710={8:0}, t2711={9:0}, t2712={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L895] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 \read(*__unbuffered_p3_EAX$read_delayed_var) [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] 0 __unbuffered_p3_EAX = __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L897] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L899] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 873]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 876]: 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: 880]: 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: 882]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 256 locations, 70 error locations. Started 1 CEGAR loops. OverallTime: 68.8s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 29.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1482 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1482 mSDsluCounter, 393 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 261 mSDsCounter, 252 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2993 IncrementalHoareTripleChecker+Invalid, 3245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 252 mSolverCounterUnsat, 132 mSDtfsCounter, 2993 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64820occurred in iteration=0, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 20084 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 474 NumberOfCodeBlocks, 474 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 419 ConstructedInterpolants, 0 QuantifiedInterpolants, 5128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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 11:25:46,791 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/thin002_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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_0ad72675-7916-4824-829b-ecafeaee089e/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 e1655ef15816414a510c3a8c6c5388872fb389e863c7015deef825935bc10ec6 --- 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 11:25:49,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:25:49,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:25:49,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:25:49,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:25:49,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:25:49,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:25:49,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:25:49,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:25:49,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:25:49,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:25:49,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:25:49,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:25:49,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:25:49,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:25:49,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:25:49,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:25:49,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:25:49,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:25:49,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:25:49,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:25:49,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:25:49,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:25:49,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:25:49,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:25:49,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:25:49,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:25:49,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:25:49,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:25:49,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:25:49,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:25:49,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:25:49,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:25:49,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:25:49,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:25:49,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:25:49,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:25:49,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:25:49,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:25:49,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:25:49,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:25:49,696 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-20 11:25:49,737 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:25:49,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:25:49,739 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:25:49,739 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:25:49,740 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:25:49,741 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:25:49,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:25:49,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:25:49,742 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:25:49,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:25:49,743 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:25:49,744 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:25:49,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:25:49,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:25:49,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:25:49,745 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 11:25:49,745 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 11:25:49,745 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 11:25:49,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:25:49,746 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:25:49,746 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 11:25:49,747 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 11:25:49,747 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:25:49,747 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:25:49,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:25:49,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:25:49,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:25:49,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:25:49,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:25:49,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:25:49,749 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 11:25:49,750 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 11:25:49,750 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 11:25:49,750 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_0ad72675-7916-4824-829b-ecafeaee089e/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_0ad72675-7916-4824-829b-ecafeaee089e/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 -> e1655ef15816414a510c3a8c6c5388872fb389e863c7015deef825935bc10ec6 [2022-11-20 11:25:50,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:25:50,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:25:50,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:25:50,156 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:25:50,157 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:25:50,158 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/thin002_power.opt.i [2022-11-20 11:25:53,260 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:25:53,666 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:25:53,667 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/sv-benchmarks/c/pthread-wmm/thin002_power.opt.i [2022-11-20 11:25:53,689 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/data/55ff60673/0b1e6e6fd0c54ec0a36c844420383e49/FLAGb11f33569 [2022-11-20 11:25:53,719 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/data/55ff60673/0b1e6e6fd0c54ec0a36c844420383e49 [2022-11-20 11:25:53,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:25:53,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:25:53,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:25:53,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:25:53,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:25:53,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:25:53" (1/1) ... [2022-11-20 11:25:53,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474ced2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:53, skipping insertion in model container [2022-11-20 11:25:53,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:25:53" (1/1) ... [2022-11-20 11:25:53,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:25:53,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:25:54,041 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_0ad72675-7916-4824-829b-ecafeaee089e/sv-benchmarks/c/pthread-wmm/thin002_power.opt.i[951,964] [2022-11-20 11:25:54,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:25:54,369 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:25:54,388 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_0ad72675-7916-4824-829b-ecafeaee089e/sv-benchmarks/c/pthread-wmm/thin002_power.opt.i[951,964] [2022-11-20 11:25:54,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:25:54,467 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:25:54,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:54 WrapperNode [2022-11-20 11:25:54,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:25:54,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:25:54,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:25:54,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:25:54,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:54" (1/1) ... [2022-11-20 11:25:54,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:54" (1/1) ... [2022-11-20 11:25:54,522 INFO L138 Inliner]: procedures = 181, calls = 84, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 200 [2022-11-20 11:25:54,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:25:54,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:25:54,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:25:54,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:25:54,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:54" (1/1) ... [2022-11-20 11:25:54,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:54" (1/1) ... [2022-11-20 11:25:54,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:54" (1/1) ... [2022-11-20 11:25:54,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:54" (1/1) ... [2022-11-20 11:25:54,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:54" (1/1) ... [2022-11-20 11:25:54,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:54" (1/1) ... [2022-11-20 11:25:54,558 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:54" (1/1) ... [2022-11-20 11:25:54,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:54" (1/1) ... [2022-11-20 11:25:54,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:25:54,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:25:54,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:25:54,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:25:54,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:54" (1/1) ... [2022-11-20 11:25:54,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:25:54,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:25:54,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:25:54,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:25:54,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-20 11:25:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 11:25:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:25:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:25:54,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:25:54,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 11:25:54,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 11:25:54,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-20 11:25:54,661 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 11:25:54,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 11:25:54,662 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 11:25:54,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 11:25:54,662 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 11:25:54,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 11:25:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-20 11:25:54,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-20 11:25:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 11:25:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:25:54,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:25:54,665 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 11:25:54,914 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:25:54,916 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:25:55,769 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:25:56,918 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:25:56,919 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 11:25:56,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:25:56 BoogieIcfgContainer [2022-11-20 11:25:56,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:25:56,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:25:56,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:25:56,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:25:56,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:25:53" (1/3) ... [2022-11-20 11:25:56,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a043984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:25:56, skipping insertion in model container [2022-11-20 11:25:56,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:25:54" (2/3) ... [2022-11-20 11:25:56,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a043984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:25:56, skipping insertion in model container [2022-11-20 11:25:56,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:25:56" (3/3) ... [2022-11-20 11:25:56,931 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.opt.i [2022-11-20 11:25:56,951 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:25:56,951 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-11-20 11:25:56,951 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 11:25:57,113 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 11:25:57,148 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 11:25:57,162 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 199 transitions, 418 flow [2022-11-20 11:25:57,165 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 199 transitions, 418 flow [2022-11-20 11:25:57,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 199 transitions, 418 flow [2022-11-20 11:25:57,284 INFO L130 PetriNetUnfolder]: 2/195 cut-off events. [2022-11-20 11:25:57,284 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 11:25:57,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 195 events. 2/195 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 242 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2022-11-20 11:25:57,296 INFO L119 LiptonReduction]: Number of co-enabled transitions 6900 [2022-11-20 11:26:13,683 WARN L233 SmtUtils]: Spent 5.31s on a formula simplification. DAG size of input: 218 DAG size of output: 215 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 11:26:24,303 WARN L233 SmtUtils]: Spent 7.92s on a formula simplification. DAG size of input: 254 DAG size of output: 250 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-20 11:26:43,674 INFO L134 LiptonReduction]: Checked pairs total: 29510 [2022-11-20 11:26:43,674 INFO L136 LiptonReduction]: Total number of compositions: 177 [2022-11-20 11:26:43,682 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 76 transitions, 172 flow [2022-11-20 11:26:46,605 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 64820 states, 63669 states have (on average 4.423879753098054) internal successors, (281664), 64819 states have internal predecessors, (281664), 0 states have call successors, (0), 0 states 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 11:26:46,651 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:26:46,655 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;@56d10da9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:26:46,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-11-20 11:26:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 64820 states, 63669 states have (on average 4.423879753098054) internal successors, (281664), 64819 states have internal predecessors, (281664), 0 states have call successors, (0), 0 states 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 11:26:46,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 11:26:46,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:46,917 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 11:26:46,918 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:26:46,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:46,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1231, now seen corresponding path program 1 times [2022-11-20 11:26:46,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:26:46,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474632184] [2022-11-20 11:26:46,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:46,966 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 11:26:46,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:26:46,979 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:26:47,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:26:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:47,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 11:26:47,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:47,531 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 11:26:47,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:26:47,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:26:47,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474632184] [2022-11-20 11:26:47,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474632184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:26:47,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:26:47,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 11:26:47,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37033493] [2022-11-20 11:26:47,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:26:47,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 11:26:47,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:26:47,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 11:26:47,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 11:26:47,710 INFO L87 Difference]: Start difference. First operand has 64820 states, 63669 states have (on average 4.423879753098054) internal successors, (281664), 64819 states have internal predecessors, (281664), 0 states have call successors, (0), 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 11:26:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:49,019 INFO L93 Difference]: Finished difference Result 28618 states and 121024 transitions. [2022-11-20 11:26:49,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 11:26:49,022 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 11:26:49,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:49,657 INFO L225 Difference]: With dead ends: 28618 [2022-11-20 11:26:49,657 INFO L226 Difference]: Without dead ends: 28618 [2022-11-20 11:26:49,658 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 11:26:49,662 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:49,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:26:49,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28618 states. [2022-11-20 11:26:51,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28618 to 28618. [2022-11-20 11:26:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28618 states, 28241 states have (on average 4.285400658616904) internal successors, (121024), 28617 states have internal predecessors, (121024), 0 states have call successors, (0), 0 states 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 11:26:52,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28618 states to 28618 states and 121024 transitions. [2022-11-20 11:26:52,069 INFO L78 Accepts]: Start accepts. Automaton has 28618 states and 121024 transitions. Word has length 1 [2022-11-20 11:26:52,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:52,070 INFO L495 AbstractCegarLoop]: Abstraction has 28618 states and 121024 transitions. [2022-11-20 11:26:52,071 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 11:26:52,071 INFO L276 IsEmpty]: Start isEmpty. Operand 28618 states and 121024 transitions. [2022-11-20 11:26:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 11:26:52,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:52,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:52,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:26:52,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:26:52,284 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:26:52,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:52,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1310168629, now seen corresponding path program 1 times [2022-11-20 11:26:52,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:26:52,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161572279] [2022-11-20 11:26:52,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:52,290 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 11:26:52,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:26:52,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:26:52,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:26:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:52,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:26:52,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:52,595 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 11:26:52,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:26:52,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:26:52,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161572279] [2022-11-20 11:26:52,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161572279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:26:52,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:26:52,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:26:52,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201137763] [2022-11-20 11:26:52,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:26:52,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:26:52,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:26:52,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:26:52,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:26:52,601 INFO L87 Difference]: Start difference. First operand 28618 states and 121024 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 11:26:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:53,629 INFO L93 Difference]: Finished difference Result 25754 states and 108616 transitions. [2022-11-20 11:26:53,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:26:53,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-20 11:26:53,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:54,037 INFO L225 Difference]: With dead ends: 25754 [2022-11-20 11:26:54,038 INFO L226 Difference]: Without dead ends: 25754 [2022-11-20 11:26:54,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 11:26:54,040 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:54,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 8 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:26:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25754 states. [2022-11-20 11:26:55,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25754 to 25754. [2022-11-20 11:26:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25754 states, 25440 states have (on average 4.269496855345912) internal successors, (108616), 25753 states have internal predecessors, (108616), 0 states have call successors, (0), 0 states 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 11:26:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25754 states to 25754 states and 108616 transitions. [2022-11-20 11:26:55,423 INFO L78 Accepts]: Start accepts. Automaton has 25754 states and 108616 transitions. Word has length 8 [2022-11-20 11:26:55,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:55,424 INFO L495 AbstractCegarLoop]: Abstraction has 25754 states and 108616 transitions. [2022-11-20 11:26:55,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 11:26:55,424 INFO L276 IsEmpty]: Start isEmpty. Operand 25754 states and 108616 transitions. [2022-11-20 11:26:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 11:26:55,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:55,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:55,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:26:55,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:26:55,631 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:26:55,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:55,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1960522848, now seen corresponding path program 1 times [2022-11-20 11:26:55,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:26:55,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333676859] [2022-11-20 11:26:55,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:55,633 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 11:26:55,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:26:55,635 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:26:55,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:26:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:55,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 11:26:55,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:55,902 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 11:26:55,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:26:55,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:26:55,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333676859] [2022-11-20 11:26:55,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333676859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:26:55,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:26:55,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:26:55,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346042706] [2022-11-20 11:26:55,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:26:55,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:26:55,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:26:55,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:26:55,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:26:55,908 INFO L87 Difference]: Start difference. First operand 25754 states and 108616 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 11:26:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:26:56,902 INFO L93 Difference]: Finished difference Result 32666 states and 138008 transitions. [2022-11-20 11:26:56,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:26:56,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-20 11:26:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:26:57,160 INFO L225 Difference]: With dead ends: 32666 [2022-11-20 11:26:57,161 INFO L226 Difference]: Without dead ends: 32666 [2022-11-20 11:26:57,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 11:26:57,165 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:26:57,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 12 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:26:57,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32666 states. [2022-11-20 11:26:58,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32666 to 27610. [2022-11-20 11:26:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27610 states, 27312 states have (on average 4.443760984182777) internal successors, (121368), 27609 states have internal predecessors, (121368), 0 states have call successors, (0), 0 states 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 11:26:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27610 states to 27610 states and 121368 transitions. [2022-11-20 11:26:59,051 INFO L78 Accepts]: Start accepts. Automaton has 27610 states and 121368 transitions. Word has length 9 [2022-11-20 11:26:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:26:59,052 INFO L495 AbstractCegarLoop]: Abstraction has 27610 states and 121368 transitions. [2022-11-20 11:26:59,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 11:26:59,056 INFO L276 IsEmpty]: Start isEmpty. Operand 27610 states and 121368 transitions. [2022-11-20 11:26:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 11:26:59,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:26:59,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:26:59,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:26:59,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:26:59,276 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:26:59,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:26:59,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1960522850, now seen corresponding path program 1 times [2022-11-20 11:26:59,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:26:59,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003577676] [2022-11-20 11:26:59,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:26:59,278 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 11:26:59,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:26:59,279 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:26:59,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:26:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:26:59,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 11:26:59,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:26:59,664 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 11:26:59,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-20 11:26:59,738 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 11:26:59,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-20 11:26:59,792 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 11:26:59,792 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 11:26:59,829 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 11:26:59,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:26:59,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:26:59,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003577676] [2022-11-20 11:26:59,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003577676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:26:59,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:26:59,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 11:26:59,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037265544] [2022-11-20 11:26:59,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:26:59,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:26:59,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:26:59,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:26:59,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:26:59,837 INFO L87 Difference]: Start difference. First operand 27610 states and 121368 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 11:27:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:27:00,311 INFO L93 Difference]: Finished difference Result 18026 states and 77568 transitions. [2022-11-20 11:27:00,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:27:00,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-20 11:27:00,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:27:00,455 INFO L225 Difference]: With dead ends: 18026 [2022-11-20 11:27:00,460 INFO L226 Difference]: Without dead ends: 18026 [2022-11-20 11:27:00,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 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 11:27:00,462 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 27 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:27:00,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:27:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18026 states. [2022-11-20 11:27:01,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18026 to 18026. [2022-11-20 11:27:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18026 states, 17899 states have (on average 4.333649924576792) internal successors, (77568), 18025 states have internal predecessors, (77568), 0 states have call successors, (0), 0 states 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 11:27:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18026 states to 18026 states and 77568 transitions. [2022-11-20 11:27:01,574 INFO L78 Accepts]: Start accepts. Automaton has 18026 states and 77568 transitions. Word has length 9 [2022-11-20 11:27:01,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:27:01,575 INFO L495 AbstractCegarLoop]: Abstraction has 18026 states and 77568 transitions. [2022-11-20 11:27:01,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 11:27:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 18026 states and 77568 transitions. [2022-11-20 11:27:01,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 11:27:01,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:27:01,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:27:01,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:01,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:01,802 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:27:01,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:27:01,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1960522851, now seen corresponding path program 1 times [2022-11-20 11:27:01,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:27:01,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398273136] [2022-11-20 11:27:01,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:27:01,805 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 11:27:01,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:27:01,806 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:01,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:02,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 11:27:02,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:27:02,134 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 11:27:02,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-20 11:27:02,153 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 11:27:02,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 11:27:02,210 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 11:27:02,262 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 11:27:02,263 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 12 treesize of output 14 [2022-11-20 11:27:02,313 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 11:27:02,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:27:02,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:27:02,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398273136] [2022-11-20 11:27:02,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398273136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:27:02,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:27:02,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:27:02,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593111952] [2022-11-20 11:27:02,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:27:02,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:27:02,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:27:02,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:27:02,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:27:02,317 INFO L87 Difference]: Start difference. First operand 18026 states and 77568 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 11:27:02,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:27:02,699 INFO L93 Difference]: Finished difference Result 11802 states and 46696 transitions. [2022-11-20 11:27:02,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:27:02,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-20 11:27:02,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:27:02,773 INFO L225 Difference]: With dead ends: 11802 [2022-11-20 11:27:02,773 INFO L226 Difference]: Without dead ends: 11450 [2022-11-20 11:27:02,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 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 11:27:02,774 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 67 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:27:02,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 6 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:27:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11450 states. [2022-11-20 11:27:03,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11450 to 9962. [2022-11-20 11:27:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9962 states, 9936 states have (on average 4.093397745571659) internal successors, (40672), 9961 states have internal predecessors, (40672), 0 states have call successors, (0), 0 states 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 11:27:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9962 states to 9962 states and 40672 transitions. [2022-11-20 11:27:03,230 INFO L78 Accepts]: Start accepts. Automaton has 9962 states and 40672 transitions. Word has length 9 [2022-11-20 11:27:03,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:27:03,231 INFO L495 AbstractCegarLoop]: Abstraction has 9962 states and 40672 transitions. [2022-11-20 11:27:03,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 11:27:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 9962 states and 40672 transitions. [2022-11-20 11:27:03,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:27:03,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:27:03,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:27:03,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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)] Ended with exit code 0 [2022-11-20 11:27:03,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:03,445 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:27:03,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:27:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1373381594, now seen corresponding path program 1 times [2022-11-20 11:27:03,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:27:03,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137173767] [2022-11-20 11:27:03,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:27:03,447 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 11:27:03,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:27:03,448 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:03,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:03,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:27:03,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:27:04,007 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 11:27:04,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:27:04,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:27:04,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137173767] [2022-11-20 11:27:04,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137173767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:27:04,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:27:04,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:27:04,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468490637] [2022-11-20 11:27:04,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:27:04,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:27:04,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:27:04,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:27:04,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:27:04,010 INFO L87 Difference]: Start difference. First operand 9962 states and 40672 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 11:27:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:27:04,267 INFO L93 Difference]: Finished difference Result 5966 states and 21151 transitions. [2022-11-20 11:27:04,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:27:04,268 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 11:27:04,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:27:04,294 INFO L225 Difference]: With dead ends: 5966 [2022-11-20 11:27:04,294 INFO L226 Difference]: Without dead ends: 5966 [2022-11-20 11:27:04,295 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 11:27:04,297 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:27:04,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 8 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:27:04,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2022-11-20 11:27:04,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 5966. [2022-11-20 11:27:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5966 states, 5940 states have (on average 3.560774410774411) internal successors, (21151), 5965 states have internal predecessors, (21151), 0 states have call successors, (0), 0 states 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 11:27:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5966 states to 5966 states and 21151 transitions. [2022-11-20 11:27:04,469 INFO L78 Accepts]: Start accepts. Automaton has 5966 states and 21151 transitions. Word has length 11 [2022-11-20 11:27:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:27:04,471 INFO L495 AbstractCegarLoop]: Abstraction has 5966 states and 21151 transitions. [2022-11-20 11:27:04,472 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 11:27:04,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5966 states and 21151 transitions. [2022-11-20 11:27:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:27:04,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:27:04,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:27:04,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:04,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:04,687 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:27:04,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:27:04,688 INFO L85 PathProgramCache]: Analyzing trace with hash -122333584, now seen corresponding path program 1 times [2022-11-20 11:27:04,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:27:04,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735053389] [2022-11-20 11:27:04,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:27:04,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 11:27:04,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:27:04,690 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:04,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:04,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:27:04,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:27:04,993 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 11:27:04,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:27:04,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:27:04,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735053389] [2022-11-20 11:27:04,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735053389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:27:04,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:27:04,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:27:04,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622424757] [2022-11-20 11:27:04,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:27:04,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:27:04,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:27:04,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:27:04,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:27:04,996 INFO L87 Difference]: Start difference. First operand 5966 states and 21151 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 11:27:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:27:05,299 INFO L93 Difference]: Finished difference Result 2168 states and 6301 transitions. [2022-11-20 11:27:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:27:05,300 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 11:27:05,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:27:05,307 INFO L225 Difference]: With dead ends: 2168 [2022-11-20 11:27:05,307 INFO L226 Difference]: Without dead ends: 2168 [2022-11-20 11:27:05,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:27:05,308 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:27:05,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 16 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:27:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2022-11-20 11:27:05,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2168. [2022-11-20 11:27:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 2142 states have (on average 2.9416433239962654) internal successors, (6301), 2167 states have internal predecessors, (6301), 0 states have call successors, (0), 0 states 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 11:27:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 6301 transitions. [2022-11-20 11:27:05,363 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 6301 transitions. Word has length 14 [2022-11-20 11:27:05,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:27:05,364 INFO L495 AbstractCegarLoop]: Abstraction has 2168 states and 6301 transitions. [2022-11-20 11:27:05,364 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 11:27:05,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 6301 transitions. [2022-11-20 11:27:05,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 11:27:05,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:27:05,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:27:05,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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)] Forceful destruction successful, exit code 0 [2022-11-20 11:27:05,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:05,579 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:27:05,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:27:05,580 INFO L85 PathProgramCache]: Analyzing trace with hash 645334461, now seen corresponding path program 1 times [2022-11-20 11:27:05,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:27:05,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41955146] [2022-11-20 11:27:05,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:27:05,581 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 11:27:05,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:27:05,582 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:05,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:05,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 11:27:05,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:27:05,869 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 11:27:05,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:27:05,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:27:05,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41955146] [2022-11-20 11:27:05,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41955146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:27:05,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:27:05,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:27:05,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933642645] [2022-11-20 11:27:05,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:27:05,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:27:05,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:27:05,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:27:05,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:27:05,874 INFO L87 Difference]: Start difference. First operand 2168 states and 6301 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 11:27:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:27:06,293 INFO L93 Difference]: Finished difference Result 878 states and 2506 transitions. [2022-11-20 11:27:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:27:06,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-11-20 11:27:06,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:27:06,296 INFO L225 Difference]: With dead ends: 878 [2022-11-20 11:27:06,296 INFO L226 Difference]: Without dead ends: 878 [2022-11-20 11:27:06,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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 11:27:06,297 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:27:06,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 36 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:27:06,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-11-20 11:27:06,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2022-11-20 11:27:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 864 states have (on average 2.900462962962963) internal successors, (2506), 877 states have internal predecessors, (2506), 0 states have call successors, (0), 0 states 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 11:27:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 2506 transitions. [2022-11-20 11:27:06,320 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 2506 transitions. Word has length 17 [2022-11-20 11:27:06,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:27:06,320 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 2506 transitions. [2022-11-20 11:27:06,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 11:27:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 2506 transitions. [2022-11-20 11:27:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 11:27:06,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:27:06,323 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] [2022-11-20 11:27:06,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:06,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:06,535 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:27:06,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:27:06,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1021353287, now seen corresponding path program 1 times [2022-11-20 11:27:06,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:27:06,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134018820] [2022-11-20 11:27:06,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:27:06,537 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 11:27:06,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:27:06,538 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:06,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:06,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:27:06,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:27:06,891 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 11:27:06,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:27:06,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:27:06,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134018820] [2022-11-20 11:27:06,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134018820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:27:06,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:27:06,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:27:06,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151063753] [2022-11-20 11:27:06,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:27:06,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:27:06,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:27:06,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:27:06,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:27:06,894 INFO L87 Difference]: Start difference. First operand 878 states and 2506 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 11:27:07,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:27:07,439 INFO L93 Difference]: Finished difference Result 692 states and 2138 transitions. [2022-11-20 11:27:07,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:27:07,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-11-20 11:27:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:27:07,441 INFO L225 Difference]: With dead ends: 692 [2022-11-20 11:27:07,441 INFO L226 Difference]: Without dead ends: 692 [2022-11-20 11:27:07,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:27:07,442 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 48 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:27:07,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 64 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:27:07,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2022-11-20 11:27:07,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2022-11-20 11:27:07,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 688 states have (on average 3.1075581395348837) internal successors, (2138), 691 states have internal predecessors, (2138), 0 states have call successors, (0), 0 states 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 11:27:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 2138 transitions. [2022-11-20 11:27:07,457 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 2138 transitions. Word has length 21 [2022-11-20 11:27:07,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:27:07,458 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 2138 transitions. [2022-11-20 11:27:07,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 11:27:07,458 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 2138 transitions. [2022-11-20 11:27:07,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:27:07,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:27:07,461 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, 1, 1, 1] [2022-11-20 11:27:07,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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)] Forceful destruction successful, exit code 0 [2022-11-20 11:27:07,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:07,673 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:27:07,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:27:07,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1860134295, now seen corresponding path program 1 times [2022-11-20 11:27:07,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:27:07,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186073712] [2022-11-20 11:27:07,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:27:07,675 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 11:27:07,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:27:07,676 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:07,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 (11)] Waiting until timeout for monitored process [2022-11-20 11:27:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:07,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:27:07,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:27:13,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 730 treesize of output 737 [2022-11-20 11:27:13,197 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 718 treesize of output 712 [2022-11-20 11:27:13,223 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 11:27:13,365 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 11:27:13,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:27:13,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:27:13,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186073712] [2022-11-20 11:27:13,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186073712] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:27:13,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:27:13,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:27:13,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964667652] [2022-11-20 11:27:13,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:27:13,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:27:13,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:27:13,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:27:13,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:27:13,367 INFO L87 Difference]: Start difference. First operand 692 states and 2138 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 11:27:13,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:27:13,665 INFO L93 Difference]: Finished difference Result 755 states and 2345 transitions. [2022-11-20 11:27:13,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:27:13,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-20 11:27:13,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:27:13,667 INFO L225 Difference]: With dead ends: 755 [2022-11-20 11:27:13,667 INFO L226 Difference]: Without dead ends: 755 [2022-11-20 11:27:13,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:27:13,668 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:27:13,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 22 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:27:13,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2022-11-20 11:27:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 691. [2022-11-20 11:27:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 688 states have (on average 3.1061046511627906) internal successors, (2137), 690 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states 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 11:27:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 2137 transitions. [2022-11-20 11:27:13,683 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 2137 transitions. Word has length 25 [2022-11-20 11:27:13,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:27:13,684 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 2137 transitions. [2022-11-20 11:27:13,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 11:27:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 2137 transitions. [2022-11-20 11:27:13,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 11:27:13,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:27:13,687 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, 1, 1, 1] [2022-11-20 11:27:13,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 (11)] Forceful destruction successful, exit code 0 [2022-11-20 11:27:13,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:13,899 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:27:13,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:27:13,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1860134294, now seen corresponding path program 1 times [2022-11-20 11:27:13,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:27:13,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160353703] [2022-11-20 11:27:13,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:27:13,901 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 11:27:13,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:27:13,902 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:13,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 (12)] Waiting until timeout for monitored process [2022-11-20 11:27:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:14,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 11:27:14,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:27:19,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 704 treesize of output 711 [2022-11-20 11:27:19,502 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 692 treesize of output 686 [2022-11-20 11:27:19,541 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 11:27:19,662 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 11:27:19,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:27:19,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:27:19,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160353703] [2022-11-20 11:27:19,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160353703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:27:19,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:27:19,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:27:19,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502576138] [2022-11-20 11:27:19,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:27:19,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:27:19,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:27:19,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:27:19,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:27:19,665 INFO L87 Difference]: Start difference. First operand 691 states and 2137 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 11:27:19,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:27:19,956 INFO L93 Difference]: Finished difference Result 754 states and 2344 transitions. [2022-11-20 11:27:19,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:27:19,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-20 11:27:19,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:27:19,960 INFO L225 Difference]: With dead ends: 754 [2022-11-20 11:27:19,960 INFO L226 Difference]: Without dead ends: 754 [2022-11-20 11:27:19,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:27:19,961 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:27:19,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 22 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:27:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-11-20 11:27:19,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 690. [2022-11-20 11:27:19,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 688 states have (on average 3.104651162790698) internal successors, (2136), 689 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states 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 11:27:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 2136 transitions. [2022-11-20 11:27:19,976 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 2136 transitions. Word has length 25 [2022-11-20 11:27:19,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:27:19,977 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 2136 transitions. [2022-11-20 11:27:19,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 11:27:19,977 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 2136 transitions. [2022-11-20 11:27:19,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:27:19,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:27:19,980 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, 1, 1, 1, 1] [2022-11-20 11:27:19,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 (12)] Forceful destruction successful, exit code 0 [2022-11-20 11:27:20,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:20,191 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:27:20,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:27:20,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1829583077, now seen corresponding path program 1 times [2022-11-20 11:27:20,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:27:20,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190621596] [2022-11-20 11:27:20,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:27:20,192 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 11:27:20,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:27:20,194 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:20,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 (13)] Waiting until timeout for monitored process [2022-11-20 11:27:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:27:20,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:27:20,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:27:20,568 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 11:27:20,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:27:20,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:27:20,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190621596] [2022-11-20 11:27:20,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190621596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:27:20,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:27:20,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:27:20,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220218598] [2022-11-20 11:27:20,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:27:20,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:27:20,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:27:20,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:27:20,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:27:20,570 INFO L87 Difference]: Start difference. First operand 690 states and 2136 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 11:27:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:27:20,751 INFO L93 Difference]: Finished difference Result 877 states and 2662 transitions. [2022-11-20 11:27:20,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:27:20,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-11-20 11:27:20,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:27:20,753 INFO L225 Difference]: With dead ends: 877 [2022-11-20 11:27:20,753 INFO L226 Difference]: Without dead ends: 877 [2022-11-20 11:27:20,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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 11:27:20,754 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:27:20,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 8 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:27:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2022-11-20 11:27:20,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 872. [2022-11-20 11:27:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 870 states have (on average 3.0551724137931036) internal successors, (2658), 871 states have internal predecessors, (2658), 0 states have call successors, (0), 0 states 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 11:27:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 2658 transitions. [2022-11-20 11:27:20,782 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 2658 transitions. Word has length 26 [2022-11-20 11:27:20,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:27:20,782 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 2658 transitions. [2022-11-20 11:27:20,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 11:27:20,783 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 2658 transitions. [2022-11-20 11:27:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:27:20,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:27:20,786 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, 1, 1, 1, 1] [2022-11-20 11:27:20,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 (13)] Forceful destruction successful, exit code 0 [2022-11-20 11:27:21,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:21,000 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:27:21,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:27:21,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1915720387, now seen corresponding path program 2 times [2022-11-20 11:27:21,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:27:21,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880416265] [2022-11-20 11:27:21,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:27:21,001 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 11:27:21,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:27:21,002 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:21,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 (14)] Waiting until timeout for monitored process [2022-11-20 11:27:21,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 11:27:21,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:27:21,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:27:21,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:27:21,358 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 11:27:21,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:27:21,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:27:21,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880416265] [2022-11-20 11:27:21,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880416265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:27:21,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:27:21,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:27:21,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675826469] [2022-11-20 11:27:21,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:27:21,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:27:21,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:27:21,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:27:21,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:27:21,362 INFO L87 Difference]: Start difference. First operand 872 states and 2658 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 11:27:21,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:27:21,622 INFO L93 Difference]: Finished difference Result 1223 states and 3613 transitions. [2022-11-20 11:27:21,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:27:21,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-11-20 11:27:21,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:27:21,625 INFO L225 Difference]: With dead ends: 1223 [2022-11-20 11:27:21,625 INFO L226 Difference]: Without dead ends: 1223 [2022-11-20 11:27:21,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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 11:27:21,626 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:27:21,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 11 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:27:21,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2022-11-20 11:27:21,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 827. [2022-11-20 11:27:21,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 825 states have (on average 3.050909090909091) internal successors, (2517), 826 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states 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 11:27:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 2517 transitions. [2022-11-20 11:27:21,654 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 2517 transitions. Word has length 26 [2022-11-20 11:27:21,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:27:21,655 INFO L495 AbstractCegarLoop]: Abstraction has 827 states and 2517 transitions. [2022-11-20 11:27:21,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 11:27:21,655 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 2517 transitions. [2022-11-20 11:27:21,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:27:21,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:27:21,658 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, 1, 1, 1, 1] [2022-11-20 11:27:21,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 (14)] Forceful destruction successful, exit code 0 [2022-11-20 11:27:21,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:21,863 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:27:21,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:27:21,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1098242093, now seen corresponding path program 3 times [2022-11-20 11:27:21,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:27:21,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289198282] [2022-11-20 11:27:21,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:27:21,864 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 11:27:21,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:27:21,865 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:21,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 (15)] Waiting until timeout for monitored process [2022-11-20 11:27:22,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 11:27:22,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:27:22,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 11:27:22,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:27:22,229 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 11:27:22,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:27:22,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:27:22,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289198282] [2022-11-20 11:27:22,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289198282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:27:22,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:27:22,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:27:22,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615411653] [2022-11-20 11:27:22,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:27:22,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:27:22,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:27:22,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:27:22,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:27:22,231 INFO L87 Difference]: Start difference. First operand 827 states and 2517 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 11:27:22,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:27:22,462 INFO L93 Difference]: Finished difference Result 1140 states and 3379 transitions. [2022-11-20 11:27:22,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:27:22,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-11-20 11:27:22,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:27:22,465 INFO L225 Difference]: With dead ends: 1140 [2022-11-20 11:27:22,465 INFO L226 Difference]: Without dead ends: 1140 [2022-11-20 11:27:22,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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 11:27:22,466 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 27 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:27:22,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 10 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:27:22,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-11-20 11:27:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 767. [2022-11-20 11:27:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 765 states have (on average 3.05359477124183) internal successors, (2336), 766 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states 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 11:27:22,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 2336 transitions. [2022-11-20 11:27:22,491 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 2336 transitions. Word has length 26 [2022-11-20 11:27:22,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:27:22,492 INFO L495 AbstractCegarLoop]: Abstraction has 767 states and 2336 transitions. [2022-11-20 11:27:22,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states 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 11:27:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 2336 transitions. [2022-11-20 11:27:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 11:27:22,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:27:22,495 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, 1, 1, 1, 1] [2022-11-20 11:27:22,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 (15)] Forceful destruction successful, exit code 0 [2022-11-20 11:27:22,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:22,705 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-11-20 11:27:22,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:27:22,705 INFO L85 PathProgramCache]: Analyzing trace with hash -948957641, now seen corresponding path program 4 times [2022-11-20 11:27:22,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:27:22,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271426371] [2022-11-20 11:27:22,706 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 11:27:22,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:27:22,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:27:22,707 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:22,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 (16)] Waiting until timeout for monitored process [2022-11-20 11:27:23,158 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 11:27:23,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 11:27:23,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:27:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:27:23,493 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-20 11:27:23,493 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 11:27:23,494 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (69 of 70 remaining) [2022-11-20 11:27:23,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (68 of 70 remaining) [2022-11-20 11:27:23,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 70 remaining) [2022-11-20 11:27:23,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 70 remaining) [2022-11-20 11:27:23,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 70 remaining) [2022-11-20 11:27:23,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 70 remaining) [2022-11-20 11:27:23,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 70 remaining) [2022-11-20 11:27:23,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 70 remaining) [2022-11-20 11:27:23,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 70 remaining) [2022-11-20 11:27:23,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 70 remaining) [2022-11-20 11:27:23,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 70 remaining) [2022-11-20 11:27:23,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 70 remaining) [2022-11-20 11:27:23,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 70 remaining) [2022-11-20 11:27:23,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 70 remaining) [2022-11-20 11:27:23,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 70 remaining) [2022-11-20 11:27:23,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 70 remaining) [2022-11-20 11:27:23,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 70 remaining) [2022-11-20 11:27:23,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 70 remaining) [2022-11-20 11:27:23,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 70 remaining) [2022-11-20 11:27:23,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 70 remaining) [2022-11-20 11:27:23,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 70 remaining) [2022-11-20 11:27:23,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 70 remaining) [2022-11-20 11:27:23,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 70 remaining) [2022-11-20 11:27:23,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 70 remaining) [2022-11-20 11:27:23,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 70 remaining) [2022-11-20 11:27:23,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 70 remaining) [2022-11-20 11:27:23,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 70 remaining) [2022-11-20 11:27:23,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 70 remaining) [2022-11-20 11:27:23,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 70 remaining) [2022-11-20 11:27:23,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 70 remaining) [2022-11-20 11:27:23,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 70 remaining) [2022-11-20 11:27:23,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 70 remaining) [2022-11-20 11:27:23,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 70 remaining) [2022-11-20 11:27:23,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 70 remaining) [2022-11-20 11:27:23,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 70 remaining) [2022-11-20 11:27:23,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 70 remaining) [2022-11-20 11:27:23,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 70 remaining) [2022-11-20 11:27:23,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 70 remaining) [2022-11-20 11:27:23,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 70 remaining) [2022-11-20 11:27:23,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 70 remaining) [2022-11-20 11:27:23,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (29 of 70 remaining) [2022-11-20 11:27:23,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 70 remaining) [2022-11-20 11:27:23,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 70 remaining) [2022-11-20 11:27:23,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 70 remaining) [2022-11-20 11:27:23,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 70 remaining) [2022-11-20 11:27:23,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 70 remaining) [2022-11-20 11:27:23,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 70 remaining) [2022-11-20 11:27:23,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 70 remaining) [2022-11-20 11:27:23,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 70 remaining) [2022-11-20 11:27:23,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 70 remaining) [2022-11-20 11:27:23,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 70 remaining) [2022-11-20 11:27:23,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 70 remaining) [2022-11-20 11:27:23,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 70 remaining) [2022-11-20 11:27:23,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 70 remaining) [2022-11-20 11:27:23,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 70 remaining) [2022-11-20 11:27:23,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 70 remaining) [2022-11-20 11:27:23,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 70 remaining) [2022-11-20 11:27:23,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 70 remaining) [2022-11-20 11:27:23,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 70 remaining) [2022-11-20 11:27:23,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 70 remaining) [2022-11-20 11:27:23,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 70 remaining) [2022-11-20 11:27:23,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 70 remaining) [2022-11-20 11:27:23,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 70 remaining) [2022-11-20 11:27:23,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 70 remaining) [2022-11-20 11:27:23,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 70 remaining) [2022-11-20 11:27:23,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 70 remaining) [2022-11-20 11:27:23,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 70 remaining) [2022-11-20 11:27:23,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 70 remaining) [2022-11-20 11:27:23,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 70 remaining) [2022-11-20 11:27:23,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 70 remaining) [2022-11-20 11:27:23,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 (16)] Forceful destruction successful, exit code 0 [2022-11-20 11:27:23,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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 11:27:23,729 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:27:23,735 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 11:27:23,735 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:27:23,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:27:23 BasicIcfg [2022-11-20 11:27:23,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:27:23,886 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:27:23,886 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:27:23,887 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:27:23,887 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:25:56" (3/4) ... [2022-11-20 11:27:23,896 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 11:27:23,896 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:27:23,897 INFO L158 Benchmark]: Toolchain (without parser) took 90168.11ms. Allocated memory was 75.5MB in the beginning and 10.0GB in the end (delta: 10.0GB). Free memory was 52.3MB in the beginning and 4.6GB in the end (delta: -4.6GB). Peak memory consumption was 5.4GB. Max. memory is 16.1GB. [2022-11-20 11:27:23,897 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 58.7MB. Free memory was 36.7MB in the beginning and 36.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:27:23,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.83ms. Allocated memory is still 75.5MB. Free memory was 52.1MB in the beginning and 43.7MB in the end (delta: 8.4MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2022-11-20 11:27:23,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.70ms. Allocated memory is still 75.5MB. Free memory was 43.7MB in the beginning and 41.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:27:23,899 INFO L158 Benchmark]: Boogie Preprocessor took 41.82ms. Allocated memory is still 75.5MB. Free memory was 41.0MB in the beginning and 38.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 11:27:23,899 INFO L158 Benchmark]: RCFGBuilder took 2356.07ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 38.4MB in the beginning and 77.7MB in the end (delta: -39.2MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2022-11-20 11:27:23,900 INFO L158 Benchmark]: TraceAbstraction took 86961.80ms. Allocated memory was 111.1MB in the beginning and 10.0GB in the end (delta: 9.9GB). Free memory was 77.7MB in the beginning and 4.6GB in the end (delta: -4.6GB). Peak memory consumption was 5.4GB. Max. memory is 16.1GB. [2022-11-20 11:27:23,902 INFO L158 Benchmark]: Witness Printer took 9.97ms. Allocated memory is still 10.0GB. Free memory is still 4.6GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:27:23,904 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 58.7MB. Free memory was 36.7MB in the beginning and 36.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.83ms. Allocated memory is still 75.5MB. Free memory was 52.1MB in the beginning and 43.7MB in the end (delta: 8.4MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.70ms. Allocated memory is still 75.5MB. Free memory was 43.7MB in the beginning and 41.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.82ms. Allocated memory is still 75.5MB. Free memory was 41.0MB in the beginning and 38.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2356.07ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 38.4MB in the beginning and 77.7MB in the end (delta: -39.2MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * TraceAbstraction took 86961.80ms. Allocated memory was 111.1MB in the beginning and 10.0GB in the end (delta: 9.9GB). Free memory was 77.7MB in the beginning and 4.6GB in the end (delta: -4.6GB). Peak memory consumption was 5.4GB. Max. memory is 16.1GB. * Witness Printer took 9.97ms. Allocated memory is still 10.0GB. Free memory is still 4.6GB. 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: 46.5s, 210 PlacesBefore, 88 PlacesAfterwards, 199 TransitionsBefore, 76 TransitionsAfterwards, 6900 CoEnabledTransitionPairs, 8 FixpointIterations, 77 TrivialSequentialCompositions, 92 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 177 TotalNumberOfCompositions, 29510 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13400, independent: 12887, independent conditional: 0, independent unconditional: 12887, dependent: 497, dependent conditional: 0, dependent unconditional: 497, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4395, independent: 4288, independent conditional: 0, independent unconditional: 4288, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4395, independent: 4061, independent conditional: 0, independent unconditional: 4061, dependent: 334, dependent conditional: 0, dependent unconditional: 334, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 334, independent: 227, independent conditional: 0, independent unconditional: 227, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3230, independent: 1347, independent conditional: 0, independent unconditional: 1347, dependent: 1688, dependent conditional: 0, dependent unconditional: 1688, unknown: 195, unknown conditional: 0, unknown unconditional: 195] ], Cache Queries: [ total: 13400, independent: 8599, independent conditional: 0, independent unconditional: 8599, dependent: 392, dependent conditional: 0, dependent unconditional: 392, unknown: 4409, unknown conditional: 0, unknown unconditional: 4409] , Statistics on independence cache: Total cache size (in pairs): 930, Positive cache size: 882, Positive conditional cache size: 0, Positive unconditional cache size: 882, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2 - 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L719] 0 _Bool __unbuffered_p3_EAX$flush_delayed; [L720] 0 int __unbuffered_p3_EAX$mem_tmp; [L721] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd0; [L722] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd1; [L723] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd2; [L724] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd3; [L725] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd4; [L726] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd0; [L727] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd1; [L728] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd2; [L729] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd3; [L730] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd4; [L731] 0 _Bool __unbuffered_p3_EAX$read_delayed; [L732] 0 int *__unbuffered_p3_EAX$read_delayed_var; [L733] 0 int __unbuffered_p3_EAX$w_buff0; [L734] 0 _Bool __unbuffered_p3_EAX$w_buff0_used; [L735] 0 int __unbuffered_p3_EAX$w_buff1; [L736] 0 _Bool __unbuffered_p3_EAX$w_buff1_used; [L738] 0 int a = 0; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice1; [L767] 0 _Bool weak$$choice2; [L875] 0 pthread_t t2709; [L876] FCALL, FORK 0 pthread_create(&t2709, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2709, ((void *)0), P0, ((void *)0))=0, t2709={11:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t2710; [L878] FCALL, FORK 0 pthread_create(&t2710, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2710, ((void *)0), P1, ((void *)0))=1, t2709={11:0}, t2710={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L879] 0 pthread_t t2711; [L880] FCALL, FORK 0 pthread_create(&t2711, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2711, ((void *)0), P2, ((void *)0))=2, t2709={11:0}, t2710={5:0}, t2711={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L881] 0 pthread_t t2712; [L882] FCALL, FORK 0 pthread_create(&t2712, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2712, ((void *)0), P3, ((void *)0))=3, t2709={11:0}, t2710={5:0}, t2711={15:0}, t2712={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 z$flush_delayed = weak$$choice2 [L834] EXPR 4 \read(z) [L834] 4 z$mem_tmp = z [L835] 4 weak$$choice1 = __VERIFIER_nondet_bool() [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] EXPR 4 \read(z) [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] 4 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L837] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)))) [L838] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)))) [L839] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : weak$$choice0)))) [L840] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L841] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L842] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$r_buff1_thd4 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L843] 4 __unbuffered_p3_EAX$read_delayed = (_Bool)1 [L844] 4 __unbuffered_p3_EAX$read_delayed_var = &z [L845] EXPR 4 \read(z) [L845] 4 __unbuffered_p3_EAX = z [L846] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L846] EXPR 4 \read(z) [L846] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L846] 4 z = z$flush_delayed ? z$mem_tmp : z [L847] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=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=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 \read(z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L854] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L855] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L856] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L857] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L862] 4 return 0; [L771] 1 __unbuffered_p0_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, 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=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, 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=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L786] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=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=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 2 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=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=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, 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=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1 = z$w_buff0 [L805] 3 z$w_buff0 = 1 [L806] 3 z$w_buff1_used = z$w_buff0_used [L807] 3 z$w_buff0_used = (_Bool)1 [L808] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L808] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 3 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, 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=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L820] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L821] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, 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=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L884] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L886] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L886] RET 0 assume_abort_if_not(main$tmp_guard0) [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 \read(z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L889] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L890] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L891] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L892] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=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, t2709={11:0}, t2710={5:0}, t2711={15:0}, t2712={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L895] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 \read(*__unbuffered_p3_EAX$read_delayed_var) [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] 0 __unbuffered_p3_EAX = __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L897] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L899] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=2, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 873]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 876]: 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: 880]: 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: 882]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 257 locations, 70 error locations. Started 1 CEGAR loops. OverallTime: 86.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.3s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 49.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 431 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 431 mSDsluCounter, 233 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1547 IncrementalHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 98 mSDtfsCounter, 1547 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64820occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 7446 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 973 SizeOfPredicates, 64 NumberOfNonLiveVariables, 2405 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 11:27:23,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad72675-7916-4824-829b-ecafeaee089e/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