./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe003_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe003_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 16:06:56,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 16:06:56,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 16:06:56,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 16:06:56,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 16:06:56,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 16:06:56,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 16:06:56,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 16:06:56,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 16:06:56,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 16:06:56,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 16:06:56,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 16:06:56,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 16:06:56,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 16:06:56,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 16:06:56,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 16:06:56,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 16:06:56,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 16:06:56,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 16:06:56,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 16:06:56,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 16:06:56,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 16:06:56,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 16:06:56,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 16:06:56,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 16:06:56,116 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 16:06:56,116 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 16:06:56,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 16:06:56,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 16:06:56,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 16:06:56,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 16:06:56,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 16:06:56,123 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 16:06:56,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 16:06:56,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 16:06:56,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 16:06:56,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 16:06:56,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 16:06:56,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 16:06:56,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 16:06:56,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 16:06:56,131 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-23 16:06:56,173 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 16:06:56,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 16:06:56,175 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 16:06:56,175 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 16:06:56,176 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 16:06:56,176 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 16:06:56,176 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 16:06:56,177 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 16:06:56,177 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 16:06:56,177 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 16:06:56,178 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 16:06:56,179 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 16:06:56,179 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 16:06:56,179 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 16:06:56,180 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 16:06:56,180 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 16:06:56,180 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 16:06:56,180 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 16:06:56,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 16:06:56,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 16:06:56,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 16:06:56,182 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 16:06:56,182 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 16:06:56,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 16:06:56,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 16:06:56,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 16:06:56,184 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 16:06:56,184 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 16:06:56,184 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 16:06:56,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 16:06:56,185 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 16:06:56,185 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 16:06:56,185 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 16:06:56,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 16:06:56,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 16:06:56,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 16:06:56,187 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 16:06:56,187 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 16:06:56,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 16:06:56,187 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 16:06:56,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 16:06:56,188 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 16:06:56,188 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_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/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_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW 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 -> Taipan 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 -> 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 [2022-11-23 16:06:56,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 16:06:56,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 16:06:56,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 16:06:56,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 16:06:56,537 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 16:06:56,539 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/safe003_power.opt.i [2022-11-23 16:06:59,525 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 16:06:59,865 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 16:06:59,865 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/sv-benchmarks/c/pthread-wmm/safe003_power.opt.i [2022-11-23 16:06:59,888 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/data/7df81d6a7/6d61d63c5a9a4ee3aded4eb4140b5be3/FLAG39670a41d [2022-11-23 16:06:59,907 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/data/7df81d6a7/6d61d63c5a9a4ee3aded4eb4140b5be3 [2022-11-23 16:06:59,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 16:06:59,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 16:06:59,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 16:06:59,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 16:06:59,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 16:06:59,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:06:59" (1/1) ... [2022-11-23 16:06:59,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62564c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:06:59, skipping insertion in model container [2022-11-23 16:06:59,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:06:59" (1/1) ... [2022-11-23 16:06:59,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 16:06:59,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 16:07:00,172 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_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/sv-benchmarks/c/pthread-wmm/safe003_power.opt.i[951,964] [2022-11-23 16:07:00,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 16:07:00,392 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 16:07:00,404 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_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/sv-benchmarks/c/pthread-wmm/safe003_power.opt.i[951,964] [2022-11-23 16:07:00,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 16:07:00,484 INFO L208 MainTranslator]: Completed translation [2022-11-23 16:07:00,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:00 WrapperNode [2022-11-23 16:07:00,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 16:07:00,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 16:07:00,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 16:07:00,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 16:07:00,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:00" (1/1) ... [2022-11-23 16:07:00,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:00" (1/1) ... [2022-11-23 16:07:00,545 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2022-11-23 16:07:00,546 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 16:07:00,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 16:07:00,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 16:07:00,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 16:07:00,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:00" (1/1) ... [2022-11-23 16:07:00,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:00" (1/1) ... [2022-11-23 16:07:00,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:00" (1/1) ... [2022-11-23 16:07:00,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:00" (1/1) ... [2022-11-23 16:07:00,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:00" (1/1) ... [2022-11-23 16:07:00,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:00" (1/1) ... [2022-11-23 16:07:00,576 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:00" (1/1) ... [2022-11-23 16:07:00,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:00" (1/1) ... [2022-11-23 16:07:00,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 16:07:00,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 16:07:00,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 16:07:00,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 16:07:00,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:00" (1/1) ... [2022-11-23 16:07:00,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 16:07:00,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:07:00,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 16:07:00,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 16:07:00,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 16:07:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 16:07:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 16:07:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 16:07:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 16:07:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 16:07:00,671 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 16:07:00,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 16:07:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 16:07:00,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 16:07:00,672 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 16:07:00,672 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 16:07:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 16:07:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 16:07:00,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 16:07:00,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 16:07:00,675 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 16:07:00,866 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 16:07:00,868 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 16:07:01,611 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 16:07:02,299 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 16:07:02,299 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 16:07:02,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:07:02 BoogieIcfgContainer [2022-11-23 16:07:02,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 16:07:02,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 16:07:02,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 16:07:02,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 16:07:02,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:06:59" (1/3) ... [2022-11-23 16:07:02,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269b0e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:07:02, skipping insertion in model container [2022-11-23 16:07:02,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:00" (2/3) ... [2022-11-23 16:07:02,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269b0e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:07:02, skipping insertion in model container [2022-11-23 16:07:02,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:07:02" (3/3) ... [2022-11-23 16:07:02,316 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2022-11-23 16:07:02,339 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 16:07:02,339 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2022-11-23 16:07:02,339 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 16:07:02,485 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 16:07:02,533 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 16:07:02,553 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 178 transitions, 371 flow [2022-11-23 16:07:02,558 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 178 transitions, 371 flow [2022-11-23 16:07:02,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 178 transitions, 371 flow [2022-11-23 16:07:02,635 INFO L130 PetriNetUnfolder]: 2/175 cut-off events. [2022-11-23 16:07:02,635 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 16:07:02,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 2/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 244 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2022-11-23 16:07:02,646 INFO L119 LiptonReduction]: Number of co-enabled transitions 6624 [2022-11-23 16:07:21,170 INFO L134 LiptonReduction]: Checked pairs total: 34536 [2022-11-23 16:07:21,170 INFO L136 LiptonReduction]: Total number of compositions: 160 [2022-11-23 16:07:21,179 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 73 transitions, 161 flow [2022-11-23 16:07:22,586 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:22,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 16:07:22,617 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;@3760ee04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 16:07:22,618 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2022-11-23 16:07:22,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 16:07:22,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:22,683 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 16:07:22,684 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:22,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:22,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1141, now seen corresponding path program 1 times [2022-11-23 16:07:22,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:22,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336880500] [2022-11-23 16:07:22,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:22,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:22,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:22,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336880500] [2022-11-23 16:07:22,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336880500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:22,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:22,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 16:07:22,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010490307] [2022-11-23 16:07:22,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:22,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 16:07:22,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:23,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 16:07:23,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 16:07:23,068 INFO L87 Difference]: Start difference. First operand has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 0 states have call successors, (0), 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-23 16:07:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:23,632 INFO L93 Difference]: Finished difference Result 15204 states and 54879 transitions. [2022-11-23 16:07:23,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 16:07:23,635 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-23 16:07:23,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:23,812 INFO L225 Difference]: With dead ends: 15204 [2022-11-23 16:07:23,813 INFO L226 Difference]: Without dead ends: 15204 [2022-11-23 16:07:23,814 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-23 16:07:23,817 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:23,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:07:23,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15204 states. [2022-11-23 16:07:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15204 to 15204. [2022-11-23 16:07:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15204 states, 13315 states have (on average 4.121592189260233) internal successors, (54879), 15203 states have internal predecessors, (54879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15204 states to 15204 states and 54879 transitions. [2022-11-23 16:07:24,797 INFO L78 Accepts]: Start accepts. Automaton has 15204 states and 54879 transitions. Word has length 1 [2022-11-23 16:07:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:24,798 INFO L495 AbstractCegarLoop]: Abstraction has 15204 states and 54879 transitions. [2022-11-23 16:07:24,802 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-23 16:07:24,803 INFO L276 IsEmpty]: Start isEmpty. Operand 15204 states and 54879 transitions. [2022-11-23 16:07:24,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-23 16:07:24,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:24,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-23 16:07:24,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 16:07:24,805 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:24,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:24,806 INFO L85 PathProgramCache]: Analyzing trace with hash 34964962, now seen corresponding path program 1 times [2022-11-23 16:07:24,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:24,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052439482] [2022-11-23 16:07:24,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:24,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:25,144 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:25,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052439482] [2022-11-23 16:07:25,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052439482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:25,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:25,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 16:07:25,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922495580] [2022-11-23 16:07:25,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:25,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:07:25,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:25,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:07:25,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:07:25,157 INFO L87 Difference]: Start difference. First operand 15204 states and 54879 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:25,584 INFO L93 Difference]: Finished difference Result 13683 states and 49236 transitions. [2022-11-23 16:07:25,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:07:25,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-23 16:07:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:25,802 INFO L225 Difference]: With dead ends: 13683 [2022-11-23 16:07:25,803 INFO L226 Difference]: Without dead ends: 13683 [2022-11-23 16:07:25,804 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-23 16:07:25,805 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 32 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:25,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 16:07:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13683 states. [2022-11-23 16:07:26,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13683 to 13683. [2022-11-23 16:07:26,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13683 states, 12109 states have (on average 4.066066562061277) internal successors, (49236), 13682 states have internal predecessors, (49236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13683 states to 13683 states and 49236 transitions. [2022-11-23 16:07:26,877 INFO L78 Accepts]: Start accepts. Automaton has 13683 states and 49236 transitions. Word has length 4 [2022-11-23 16:07:26,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:26,878 INFO L495 AbstractCegarLoop]: Abstraction has 13683 states and 49236 transitions. [2022-11-23 16:07:26,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 13683 states and 49236 transitions. [2022-11-23 16:07:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 16:07:26,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:26,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 16:07:26,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 16:07:26,882 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:26,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:26,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1083914754, now seen corresponding path program 1 times [2022-11-23 16:07:26,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:26,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913278858] [2022-11-23 16:07:26,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:26,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:27,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:27,086 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:27,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913278858] [2022-11-23 16:07:27,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913278858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:27,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:27,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 16:07:27,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001485404] [2022-11-23 16:07:27,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:27,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:07:27,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:27,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:07:27,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:07:27,090 INFO L87 Difference]: Start difference. First operand 13683 states and 49236 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:27,626 INFO L93 Difference]: Finished difference Result 17556 states and 63266 transitions. [2022-11-23 16:07:27,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:07:27,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-23 16:07:27,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:27,829 INFO L225 Difference]: With dead ends: 17556 [2022-11-23 16:07:27,829 INFO L226 Difference]: Without dead ends: 17556 [2022-11-23 16:07:27,830 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-23 16:07:27,833 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:27,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 6 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 16:07:27,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17556 states. [2022-11-23 16:07:28,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17556 to 14790. [2022-11-23 16:07:28,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14790 states, 13280 states have (on average 4.209638554216867) internal successors, (55904), 14789 states have internal predecessors, (55904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14790 states to 14790 states and 55904 transitions. [2022-11-23 16:07:28,636 INFO L78 Accepts]: Start accepts. Automaton has 14790 states and 55904 transitions. Word has length 5 [2022-11-23 16:07:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:28,639 INFO L495 AbstractCegarLoop]: Abstraction has 14790 states and 55904 transitions. [2022-11-23 16:07:28,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 14790 states and 55904 transitions. [2022-11-23 16:07:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 16:07:28,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:28,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 16:07:28,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 16:07:28,641 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:28,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:28,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1083914756, now seen corresponding path program 1 times [2022-11-23 16:07:28,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:28,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450047575] [2022-11-23 16:07:28,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:28,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:28,944 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:28,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450047575] [2022-11-23 16:07:28,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450047575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:28,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:28,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 16:07:28,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894161154] [2022-11-23 16:07:28,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:28,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:07:28,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:28,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:07:28,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:07:28,952 INFO L87 Difference]: Start difference. First operand 14790 states and 55904 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:29,497 INFO L93 Difference]: Finished difference Result 7762 states and 28303 transitions. [2022-11-23 16:07:29,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 16:07:29,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-23 16:07:29,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:29,553 INFO L225 Difference]: With dead ends: 7762 [2022-11-23 16:07:29,553 INFO L226 Difference]: Without dead ends: 7762 [2022-11-23 16:07:29,553 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-23 16:07:29,556 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 56 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:29,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 16:07:29,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2022-11-23 16:07:29,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 7762. [2022-11-23 16:07:29,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7762 states, 7237 states have (on average 3.910874671825342) internal successors, (28303), 7761 states have internal predecessors, (28303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7762 states to 7762 states and 28303 transitions. [2022-11-23 16:07:29,795 INFO L78 Accepts]: Start accepts. Automaton has 7762 states and 28303 transitions. Word has length 5 [2022-11-23 16:07:29,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:29,796 INFO L495 AbstractCegarLoop]: Abstraction has 7762 states and 28303 transitions. [2022-11-23 16:07:29,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:29,796 INFO L276 IsEmpty]: Start isEmpty. Operand 7762 states and 28303 transitions. [2022-11-23 16:07:29,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 16:07:29,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:29,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 16:07:29,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 16:07:29,798 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:29,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:29,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1083914757, now seen corresponding path program 1 times [2022-11-23 16:07:29,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:29,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313753553] [2022-11-23 16:07:29,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:29,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:30,220 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:30,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313753553] [2022-11-23 16:07:30,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313753553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:30,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:30,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 16:07:30,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682875247] [2022-11-23 16:07:30,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:30,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:07:30,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:30,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:07:30,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:07:30,225 INFO L87 Difference]: Start difference. First operand 7762 states and 28303 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:30,424 INFO L93 Difference]: Finished difference Result 2820 states and 9632 transitions. [2022-11-23 16:07:30,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 16:07:30,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-23 16:07:30,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:30,436 INFO L225 Difference]: With dead ends: 2820 [2022-11-23 16:07:30,436 INFO L226 Difference]: Without dead ends: 2820 [2022-11-23 16:07:30,437 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-23 16:07:30,437 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 64 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:30,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 4 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 16:07:30,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2022-11-23 16:07:30,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2689. [2022-11-23 16:07:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 2615 states have (on average 3.5196940726577437) internal successors, (9204), 2688 states have internal predecessors, (9204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 9204 transitions. [2022-11-23 16:07:30,511 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 9204 transitions. Word has length 5 [2022-11-23 16:07:30,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:30,511 INFO L495 AbstractCegarLoop]: Abstraction has 2689 states and 9204 transitions. [2022-11-23 16:07:30,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 9204 transitions. [2022-11-23 16:07:30,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 16:07:30,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:30,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:07:30,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 16:07:30,513 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:30,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:30,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1662071600, now seen corresponding path program 1 times [2022-11-23 16:07:30,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:30,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499966488] [2022-11-23 16:07:30,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:30,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:30,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:30,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499966488] [2022-11-23 16:07:30,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499966488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:30,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:30,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 16:07:30,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433055664] [2022-11-23 16:07:30,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:30,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:07:30,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:30,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:07:30,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:07:30,598 INFO L87 Difference]: Start difference. First operand 2689 states and 9204 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:30,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:30,722 INFO L93 Difference]: Finished difference Result 2639 states and 9024 transitions. [2022-11-23 16:07:30,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:07:30,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-23 16:07:30,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:30,732 INFO L225 Difference]: With dead ends: 2639 [2022-11-23 16:07:30,732 INFO L226 Difference]: Without dead ends: 2639 [2022-11-23 16:07:30,732 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-23 16:07:30,733 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4 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.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:30,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:07:30,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2022-11-23 16:07:30,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 2639. [2022-11-23 16:07:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2639 states, 2565 states have (on average 3.51812865497076) internal successors, (9024), 2638 states have internal predecessors, (9024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 9024 transitions. [2022-11-23 16:07:30,802 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 9024 transitions. Word has length 10 [2022-11-23 16:07:30,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:30,803 INFO L495 AbstractCegarLoop]: Abstraction has 2639 states and 9024 transitions. [2022-11-23 16:07:30,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 9024 transitions. [2022-11-23 16:07:30,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 16:07:30,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:30,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:07:30,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 16:07:30,805 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:30,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:30,805 INFO L85 PathProgramCache]: Analyzing trace with hash 505917, now seen corresponding path program 1 times [2022-11-23 16:07:30,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:30,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490799245] [2022-11-23 16:07:30,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:30,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:31,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:31,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490799245] [2022-11-23 16:07:31,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490799245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:31,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:31,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 16:07:31,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535883893] [2022-11-23 16:07:31,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:31,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:07:31,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:31,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:07:31,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:07:31,181 INFO L87 Difference]: Start difference. First operand 2639 states and 9024 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-23 16:07:31,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:31,436 INFO L93 Difference]: Finished difference Result 3379 states and 10949 transitions. [2022-11-23 16:07:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 16:07:31,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-23 16:07:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:31,457 INFO L225 Difference]: With dead ends: 3379 [2022-11-23 16:07:31,457 INFO L226 Difference]: Without dead ends: 3267 [2022-11-23 16:07:31,458 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-23 16:07:31,458 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 46 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:31,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 8 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 16:07:31,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3267 states. [2022-11-23 16:07:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3267 to 3119. [2022-11-23 16:07:31,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3119 states, 3046 states have (on average 3.411687458962574) internal successors, (10392), 3118 states have internal predecessors, (10392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 10392 transitions. [2022-11-23 16:07:31,555 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 10392 transitions. Word has length 11 [2022-11-23 16:07:31,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:31,556 INFO L495 AbstractCegarLoop]: Abstraction has 3119 states and 10392 transitions. [2022-11-23 16:07:31,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-23 16:07:31,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 10392 transitions. [2022-11-23 16:07:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 16:07:31,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:31,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:07:31,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 16:07:31,562 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:31,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:31,563 INFO L85 PathProgramCache]: Analyzing trace with hash 505918, now seen corresponding path program 1 times [2022-11-23 16:07:31,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:31,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847278890] [2022-11-23 16:07:31,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:31,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:31,909 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:31,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847278890] [2022-11-23 16:07:31,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847278890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:31,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:31,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 16:07:31,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847069546] [2022-11-23 16:07:31,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:31,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:07:31,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:31,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:07:31,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:07:31,912 INFO L87 Difference]: Start difference. First operand 3119 states and 10392 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-23 16:07:32,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:32,101 INFO L93 Difference]: Finished difference Result 4939 states and 16575 transitions. [2022-11-23 16:07:32,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 16:07:32,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-23 16:07:32,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:32,128 INFO L225 Difference]: With dead ends: 4939 [2022-11-23 16:07:32,128 INFO L226 Difference]: Without dead ends: 4939 [2022-11-23 16:07:32,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:07:32,131 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 59 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:32,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 5 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:07:32,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2022-11-23 16:07:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 3359. [2022-11-23 16:07:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3359 states, 3286 states have (on average 3.3974437005477784) internal successors, (11164), 3358 states have internal predecessors, (11164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 11164 transitions. [2022-11-23 16:07:32,287 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 11164 transitions. Word has length 11 [2022-11-23 16:07:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:32,287 INFO L495 AbstractCegarLoop]: Abstraction has 3359 states and 11164 transitions. [2022-11-23 16:07:32,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-23 16:07:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 11164 transitions. [2022-11-23 16:07:32,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 16:07:32,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:32,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:07:32,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 16:07:32,292 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:32,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:32,292 INFO L85 PathProgramCache]: Analyzing trace with hash 15382714, now seen corresponding path program 1 times [2022-11-23 16:07:32,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:32,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48439538] [2022-11-23 16:07:32,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:32,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:32,754 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:32,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48439538] [2022-11-23 16:07:32,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48439538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:32,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:32,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 16:07:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695866467] [2022-11-23 16:07:32,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:32,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:07:32,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:32,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:07:32,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:07:32,757 INFO L87 Difference]: Start difference. First operand 3359 states and 11164 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-23 16:07:32,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:32,902 INFO L93 Difference]: Finished difference Result 3349 states and 11124 transitions. [2022-11-23 16:07:32,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:07:32,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-23 16:07:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:32,920 INFO L225 Difference]: With dead ends: 3349 [2022-11-23 16:07:32,920 INFO L226 Difference]: Without dead ends: 3349 [2022-11-23 16:07:32,920 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-23 16:07:32,922 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:32,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:07:32,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states. [2022-11-23 16:07:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 3349. [2022-11-23 16:07:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3349 states, 3276 states have (on average 3.3956043956043955) internal successors, (11124), 3348 states have internal predecessors, (11124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3349 states to 3349 states and 11124 transitions. [2022-11-23 16:07:33,053 INFO L78 Accepts]: Start accepts. Automaton has 3349 states and 11124 transitions. Word has length 11 [2022-11-23 16:07:33,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:33,053 INFO L495 AbstractCegarLoop]: Abstraction has 3349 states and 11124 transitions. [2022-11-23 16:07:33,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-23 16:07:33,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3349 states and 11124 transitions. [2022-11-23 16:07:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 16:07:33,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:33,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:07:33,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 16:07:33,055 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:33,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:33,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2106728444, now seen corresponding path program 2 times [2022-11-23 16:07:33,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:33,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501660377] [2022-11-23 16:07:33,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:33,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:33,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:33,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:33,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501660377] [2022-11-23 16:07:33,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501660377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:33,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:33,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 16:07:33,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586134535] [2022-11-23 16:07:33,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:33,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 16:07:33,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:33,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 16:07:33,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 16:07:33,519 INFO L87 Difference]: Start difference. First operand 3349 states and 11124 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-23 16:07:33,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:33,818 INFO L93 Difference]: Finished difference Result 4793 states and 15695 transitions. [2022-11-23 16:07:33,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 16:07:33,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-23 16:07:33,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:33,846 INFO L225 Difference]: With dead ends: 4793 [2022-11-23 16:07:33,846 INFO L226 Difference]: Without dead ends: 4793 [2022-11-23 16:07:33,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-23 16:07:33,847 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 68 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:33,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 10 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 16:07:33,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4793 states. [2022-11-23 16:07:33,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4793 to 3225. [2022-11-23 16:07:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3225 states, 3152 states have (on average 3.389276649746193) internal successors, (10683), 3224 states have internal predecessors, (10683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:33,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 10683 transitions. [2022-11-23 16:07:33,979 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 10683 transitions. Word has length 11 [2022-11-23 16:07:33,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:33,979 INFO L495 AbstractCegarLoop]: Abstraction has 3225 states and 10683 transitions. [2022-11-23 16:07:33,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-23 16:07:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 10683 transitions. [2022-11-23 16:07:33,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 16:07:33,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:33,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:07:33,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 16:07:33,981 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:33,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:33,982 INFO L85 PathProgramCache]: Analyzing trace with hash 15678189, now seen corresponding path program 1 times [2022-11-23 16:07:33,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:33,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255179206] [2022-11-23 16:07:33,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:33,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:34,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:34,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255179206] [2022-11-23 16:07:34,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255179206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:34,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:34,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 16:07:34,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944006060] [2022-11-23 16:07:34,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:34,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:07:34,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:34,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:07:34,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:07:34,291 INFO L87 Difference]: Start difference. First operand 3225 states and 10683 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:34,426 INFO L93 Difference]: Finished difference Result 3185 states and 10533 transitions. [2022-11-23 16:07:34,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:07:34,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 16:07:34,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:34,442 INFO L225 Difference]: With dead ends: 3185 [2022-11-23 16:07:34,443 INFO L226 Difference]: Without dead ends: 3185 [2022-11-23 16:07:34,443 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-23 16:07:34,444 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3 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-23 16:07:34,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:07:34,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2022-11-23 16:07:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 3185. [2022-11-23 16:07:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3185 states, 3112 states have (on average 3.3846401028277633) internal successors, (10533), 3184 states have internal predecessors, (10533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:34,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 10533 transitions. [2022-11-23 16:07:34,556 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 10533 transitions. Word has length 12 [2022-11-23 16:07:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:34,557 INFO L495 AbstractCegarLoop]: Abstraction has 3185 states and 10533 transitions. [2022-11-23 16:07:34,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 10533 transitions. [2022-11-23 16:07:34,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 16:07:34,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:34,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:07:34,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 16:07:34,559 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:34,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:34,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1786401029, now seen corresponding path program 1 times [2022-11-23 16:07:34,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:34,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024159963] [2022-11-23 16:07:34,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:34,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:34,809 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:34,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024159963] [2022-11-23 16:07:34,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024159963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:34,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:34,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 16:07:34,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880948402] [2022-11-23 16:07:34,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:34,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:07:34,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:34,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:07:34,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:07:34,812 INFO L87 Difference]: Start difference. First operand 3185 states and 10533 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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-23 16:07:34,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:34,943 INFO L93 Difference]: Finished difference Result 3170 states and 10478 transitions. [2022-11-23 16:07:34,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:07:34,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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-23 16:07:34,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:34,959 INFO L225 Difference]: With dead ends: 3170 [2022-11-23 16:07:34,960 INFO L226 Difference]: Without dead ends: 3170 [2022-11-23 16:07:34,960 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-23 16:07:34,961 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:34,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 4 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:07:34,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2022-11-23 16:07:35,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3170. [2022-11-23 16:07:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3170 states, 3097 states have (on average 3.383274136260898) internal successors, (10478), 3169 states have internal predecessors, (10478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 10478 transitions. [2022-11-23 16:07:35,070 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 10478 transitions. Word has length 13 [2022-11-23 16:07:35,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:35,070 INFO L495 AbstractCegarLoop]: Abstraction has 3170 states and 10478 transitions. [2022-11-23 16:07:35,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 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-23 16:07:35,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 10478 transitions. [2022-11-23 16:07:35,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 16:07:35,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:35,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:07:35,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 16:07:35,073 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:35,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:35,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1897917952, now seen corresponding path program 1 times [2022-11-23 16:07:35,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:35,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334223588] [2022-11-23 16:07:35,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:35,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:35,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:35,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334223588] [2022-11-23 16:07:35,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334223588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:35,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:35,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 16:07:35,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670459799] [2022-11-23 16:07:35,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:35,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 16:07:35,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:35,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 16:07:35,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 16:07:35,283 INFO L87 Difference]: Start difference. First operand 3170 states and 10478 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:35,444 INFO L93 Difference]: Finished difference Result 2832 states and 9252 transitions. [2022-11-23 16:07:35,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:07:35,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 16:07:35,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:35,454 INFO L225 Difference]: With dead ends: 2832 [2022-11-23 16:07:35,455 INFO L226 Difference]: Without dead ends: 2832 [2022-11-23 16:07:35,455 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-23 16:07:35,456 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 24 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:35,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 8 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:07:35,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2022-11-23 16:07:35,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2720. [2022-11-23 16:07:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2720 states, 2647 states have (on average 3.349452210049112) internal successors, (8866), 2719 states have internal predecessors, (8866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 8866 transitions. [2022-11-23 16:07:35,549 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 8866 transitions. Word has length 13 [2022-11-23 16:07:35,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:35,549 INFO L495 AbstractCegarLoop]: Abstraction has 2720 states and 8866 transitions. [2022-11-23 16:07:35,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:35,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 8866 transitions. [2022-11-23 16:07:35,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 16:07:35,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:35,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:07:35,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 16:07:35,552 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:35,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:35,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1314565663, now seen corresponding path program 1 times [2022-11-23 16:07:35,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:35,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626662141] [2022-11-23 16:07:35,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:35,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:36,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:36,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626662141] [2022-11-23 16:07:36,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626662141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:36,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:36,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 16:07:36,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250089215] [2022-11-23 16:07:36,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:36,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 16:07:36,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:36,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 16:07:36,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 16:07:36,124 INFO L87 Difference]: Start difference. First operand 2720 states and 8866 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:36,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:36,311 INFO L93 Difference]: Finished difference Result 2868 states and 9219 transitions. [2022-11-23 16:07:36,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 16:07:36,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 16:07:36,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:36,323 INFO L225 Difference]: With dead ends: 2868 [2022-11-23 16:07:36,323 INFO L226 Difference]: Without dead ends: 2868 [2022-11-23 16:07:36,323 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-23 16:07:36,324 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 73 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:36,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 6 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 16:07:36,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2022-11-23 16:07:36,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 2504. [2022-11-23 16:07:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 2432 states have (on average 3.3717105263157894) internal successors, (8200), 2503 states have internal predecessors, (8200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:36,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 8200 transitions. [2022-11-23 16:07:36,416 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 8200 transitions. Word has length 13 [2022-11-23 16:07:36,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:36,417 INFO L495 AbstractCegarLoop]: Abstraction has 2504 states and 8200 transitions. [2022-11-23 16:07:36,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 8200 transitions. [2022-11-23 16:07:36,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 16:07:36,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:36,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:07:36,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 16:07:36,419 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:36,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:36,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2070352504, now seen corresponding path program 1 times [2022-11-23 16:07:36,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:36,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058216309] [2022-11-23 16:07:36,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:36,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:36,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:36,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058216309] [2022-11-23 16:07:36,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058216309] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:36,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:36,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 16:07:36,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602072890] [2022-11-23 16:07:36,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:36,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:07:36,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:36,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:07:36,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:07:36,707 INFO L87 Difference]: Start difference. First operand 2504 states and 8200 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 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-23 16:07:36,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:36,849 INFO L93 Difference]: Finished difference Result 2501 states and 8189 transitions. [2022-11-23 16:07:36,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:07:36,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 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-23 16:07:36,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:36,861 INFO L225 Difference]: With dead ends: 2501 [2022-11-23 16:07:36,862 INFO L226 Difference]: Without dead ends: 2501 [2022-11-23 16:07:36,864 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-23 16:07:36,864 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:36,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:07:36,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2022-11-23 16:07:36,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 2501. [2022-11-23 16:07:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2501 states, 2429 states have (on average 3.371346233017703) internal successors, (8189), 2500 states have internal predecessors, (8189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:36,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2501 states and 8189 transitions. [2022-11-23 16:07:36,945 INFO L78 Accepts]: Start accepts. Automaton has 2501 states and 8189 transitions. Word has length 14 [2022-11-23 16:07:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:36,947 INFO L495 AbstractCegarLoop]: Abstraction has 2501 states and 8189 transitions. [2022-11-23 16:07:36,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 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-23 16:07:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 8189 transitions. [2022-11-23 16:07:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 16:07:36,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:36,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:07:36,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 16:07:36,950 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:36,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:36,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1294084264, now seen corresponding path program 1 times [2022-11-23 16:07:36,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:36,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637875637] [2022-11-23 16:07:36,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:36,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:37,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:37,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637875637] [2022-11-23 16:07:37,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637875637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:37,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:37,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 16:07:37,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62038746] [2022-11-23 16:07:37,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:37,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:07:37,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:37,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:07:37,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:07:37,142 INFO L87 Difference]: Start difference. First operand 2501 states and 8189 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-23 16:07:37,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:37,251 INFO L93 Difference]: Finished difference Result 1054 states and 2796 transitions. [2022-11-23 16:07:37,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:07:37,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-23 16:07:37,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:37,254 INFO L225 Difference]: With dead ends: 1054 [2022-11-23 16:07:37,254 INFO L226 Difference]: Without dead ends: 1054 [2022-11-23 16:07:37,255 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-23 16:07:37,256 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:37,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:07:37,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2022-11-23 16:07:37,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1054. [2022-11-23 16:07:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 1006 states have (on average 2.779324055666004) internal successors, (2796), 1053 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 2796 transitions. [2022-11-23 16:07:37,286 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 2796 transitions. Word has length 14 [2022-11-23 16:07:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:37,287 INFO L495 AbstractCegarLoop]: Abstraction has 1054 states and 2796 transitions. [2022-11-23 16:07:37,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-23 16:07:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 2796 transitions. [2022-11-23 16:07:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 16:07:37,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:37,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:07:37,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 16:07:37,291 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:37,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:37,293 INFO L85 PathProgramCache]: Analyzing trace with hash 159305904, now seen corresponding path program 1 times [2022-11-23 16:07:37,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:37,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273577584] [2022-11-23 16:07:37,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:37,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:37,574 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:37,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273577584] [2022-11-23 16:07:37,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273577584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:37,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:37,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 16:07:37,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306502634] [2022-11-23 16:07:37,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:37,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:07:37,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:37,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:07:37,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:07:37,577 INFO L87 Difference]: Start difference. First operand 1054 states and 2796 transitions. Second operand has 3 states, 2 states have (on average 8.5) 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-23 16:07:37,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:37,701 INFO L93 Difference]: Finished difference Result 1636 states and 4305 transitions. [2022-11-23 16:07:37,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:07:37,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) 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-23 16:07:37,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:37,705 INFO L225 Difference]: With dead ends: 1636 [2022-11-23 16:07:37,705 INFO L226 Difference]: Without dead ends: 1636 [2022-11-23 16:07:37,705 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-23 16:07:37,707 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:37,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:07:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2022-11-23 16:07:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1224. [2022-11-23 16:07:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1176 states have (on average 2.7653061224489797) internal successors, (3252), 1223 states have internal predecessors, (3252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 3252 transitions. [2022-11-23 16:07:37,750 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 3252 transitions. Word has length 17 [2022-11-23 16:07:37,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:37,750 INFO L495 AbstractCegarLoop]: Abstraction has 1224 states and 3252 transitions. [2022-11-23 16:07:37,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) 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-23 16:07:37,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 3252 transitions. [2022-11-23 16:07:37,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 16:07:37,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:37,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:07:37,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-23 16:07:37,753 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:37,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:37,754 INFO L85 PathProgramCache]: Analyzing trace with hash 159308880, now seen corresponding path program 1 times [2022-11-23 16:07:37,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:37,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588812701] [2022-11-23 16:07:37,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:37,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:38,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:38,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588812701] [2022-11-23 16:07:38,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588812701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:38,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:38,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 16:07:38,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859629942] [2022-11-23 16:07:38,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:38,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:07:38,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:38,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:07:38,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:07:38,072 INFO L87 Difference]: Start difference. First operand 1224 states and 3252 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-23 16:07:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:38,239 INFO L93 Difference]: Finished difference Result 2115 states and 5614 transitions. [2022-11-23 16:07:38,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 16:07:38,239 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-23 16:07:38,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:38,245 INFO L225 Difference]: With dead ends: 2115 [2022-11-23 16:07:38,245 INFO L226 Difference]: Without dead ends: 2115 [2022-11-23 16:07:38,245 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-23 16:07:38,246 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 47 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:38,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:07:38,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2022-11-23 16:07:38,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 1310. [2022-11-23 16:07:38,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1262 states have (on average 2.7741679873217118) internal successors, (3501), 1309 states have internal predecessors, (3501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 3501 transitions. [2022-11-23 16:07:38,289 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 3501 transitions. Word has length 17 [2022-11-23 16:07:38,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:38,289 INFO L495 AbstractCegarLoop]: Abstraction has 1310 states and 3501 transitions. [2022-11-23 16:07:38,289 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-23 16:07:38,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 3501 transitions. [2022-11-23 16:07:38,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 16:07:38,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:38,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:07:38,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 16:07:38,292 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:38,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:38,292 INFO L85 PathProgramCache]: Analyzing trace with hash 422130208, now seen corresponding path program 2 times [2022-11-23 16:07:38,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:38,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327033566] [2022-11-23 16:07:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:38,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:38,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:38,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327033566] [2022-11-23 16:07:38,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327033566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:38,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:38,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 16:07:38,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511084506] [2022-11-23 16:07:38,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:38,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:07:38,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:38,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:07:38,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:07:38,625 INFO L87 Difference]: Start difference. First operand 1310 states and 3501 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) 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-23 16:07:38,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:38,902 INFO L93 Difference]: Finished difference Result 2910 states and 7687 transitions. [2022-11-23 16:07:38,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 16:07:38,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-23 16:07:38,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:38,911 INFO L225 Difference]: With dead ends: 2910 [2022-11-23 16:07:38,911 INFO L226 Difference]: Without dead ends: 2910 [2022-11-23 16:07:38,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-23 16:07:38,912 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 66 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:38,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 7 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 16:07:38,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2022-11-23 16:07:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1181. [2022-11-23 16:07:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 1133 states have (on average 2.7749338040600176) internal successors, (3144), 1180 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:38,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 3144 transitions. [2022-11-23 16:07:38,962 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 3144 transitions. Word has length 17 [2022-11-23 16:07:38,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:38,964 INFO L495 AbstractCegarLoop]: Abstraction has 1181 states and 3144 transitions. [2022-11-23 16:07:38,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-23 16:07:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 3144 transitions. [2022-11-23 16:07:38,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 16:07:38,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:38,966 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-23 16:07:38,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-23 16:07:38,966 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:38,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:38,971 INFO L85 PathProgramCache]: Analyzing trace with hash -843848721, now seen corresponding path program 1 times [2022-11-23 16:07:38,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:38,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705234295] [2022-11-23 16:07:38,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:38,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:39,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:39,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705234295] [2022-11-23 16:07:39,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705234295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:39,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:39,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 16:07:39,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897845409] [2022-11-23 16:07:39,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:39,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:07:39,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:39,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:07:39,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:07:39,380 INFO L87 Difference]: Start difference. First operand 1181 states and 3144 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:39,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:39,533 INFO L93 Difference]: Finished difference Result 424 states and 943 transitions. [2022-11-23 16:07:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 16:07:39,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 16:07:39,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:39,535 INFO L225 Difference]: With dead ends: 424 [2022-11-23 16:07:39,535 INFO L226 Difference]: Without dead ends: 424 [2022-11-23 16:07:39,535 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-23 16:07:39,536 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:39,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:07:39,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-11-23 16:07:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2022-11-23 16:07:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 408 states have (on average 2.3112745098039214) internal successors, (943), 423 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 943 transitions. [2022-11-23 16:07:39,547 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 943 transitions. Word has length 18 [2022-11-23 16:07:39,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:39,547 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 943 transitions. [2022-11-23 16:07:39,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 943 transitions. [2022-11-23 16:07:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 16:07:39,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:39,549 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-23 16:07:39,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-23 16:07:39,550 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:39,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:39,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1170735974, now seen corresponding path program 1 times [2022-11-23 16:07:39,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:39,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927750863] [2022-11-23 16:07:39,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:39,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:07:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:07:40,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:07:40,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927750863] [2022-11-23 16:07:40,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927750863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:07:40,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:07:40,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 16:07:40,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006985622] [2022-11-23 16:07:40,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:07:40,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 16:07:40,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:07:40,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 16:07:40,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 16:07:40,055 INFO L87 Difference]: Start difference. First operand 424 states and 943 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:40,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:07:40,187 INFO L93 Difference]: Finished difference Result 286 states and 667 transitions. [2022-11-23 16:07:40,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 16:07:40,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-23 16:07:40,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:07:40,188 INFO L225 Difference]: With dead ends: 286 [2022-11-23 16:07:40,188 INFO L226 Difference]: Without dead ends: 286 [2022-11-23 16:07:40,188 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-23 16:07:40,189 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 43 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:07:40,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 6 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:07:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-23 16:07:40,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-11-23 16:07:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 284 states have (on average 2.3485915492957745) internal successors, (667), 285 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 667 transitions. [2022-11-23 16:07:40,197 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 667 transitions. Word has length 20 [2022-11-23 16:07:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:07:40,197 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 667 transitions. [2022-11-23 16:07:40,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:07:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 667 transitions. [2022-11-23 16:07:40,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 16:07:40,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:07:40,199 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-23 16:07:40,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-23 16:07:40,199 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:07:40,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:07:40,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1045592822, now seen corresponding path program 1 times [2022-11-23 16:07:40,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:07:40,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426765345] [2022-11-23 16:07:40,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:07:40,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:07:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 16:07:40,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 16:07:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 16:07:40,582 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 16:07:40,582 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 16:07:40,583 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 75 remaining) [2022-11-23 16:07:40,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (73 of 75 remaining) [2022-11-23 16:07:40,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2022-11-23 16:07:40,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2022-11-23 16:07:40,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2022-11-23 16:07:40,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2022-11-23 16:07:40,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2022-11-23 16:07:40,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2022-11-23 16:07:40,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2022-11-23 16:07:40,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2022-11-23 16:07:40,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2022-11-23 16:07:40,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2022-11-23 16:07:40,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2022-11-23 16:07:40,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2022-11-23 16:07:40,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2022-11-23 16:07:40,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2022-11-23 16:07:40,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2022-11-23 16:07:40,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2022-11-23 16:07:40,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2022-11-23 16:07:40,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2022-11-23 16:07:40,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2022-11-23 16:07:40,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2022-11-23 16:07:40,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2022-11-23 16:07:40,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2022-11-23 16:07:40,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2022-11-23 16:07:40,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2022-11-23 16:07:40,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2022-11-23 16:07:40,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2022-11-23 16:07:40,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2022-11-23 16:07:40,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2022-11-23 16:07:40,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2022-11-23 16:07:40,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2022-11-23 16:07:40,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2022-11-23 16:07:40,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2022-11-23 16:07:40,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2022-11-23 16:07:40,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2022-11-23 16:07:40,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2022-11-23 16:07:40,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2022-11-23 16:07:40,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2022-11-23 16:07:40,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2022-11-23 16:07:40,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2022-11-23 16:07:40,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2022-11-23 16:07:40,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (32 of 75 remaining) [2022-11-23 16:07:40,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2022-11-23 16:07:40,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2022-11-23 16:07:40,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 75 remaining) [2022-11-23 16:07:40,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 75 remaining) [2022-11-23 16:07:40,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2022-11-23 16:07:40,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2022-11-23 16:07:40,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2022-11-23 16:07:40,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2022-11-23 16:07:40,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2022-11-23 16:07:40,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2022-11-23 16:07:40,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2022-11-23 16:07:40,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2022-11-23 16:07:40,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2022-11-23 16:07:40,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2022-11-23 16:07:40,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2022-11-23 16:07:40,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2022-11-23 16:07:40,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2022-11-23 16:07:40,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2022-11-23 16:07:40,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2022-11-23 16:07:40,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2022-11-23 16:07:40,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2022-11-23 16:07:40,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2022-11-23 16:07:40,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2022-11-23 16:07:40,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2022-11-23 16:07:40,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2022-11-23 16:07:40,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2022-11-23 16:07:40,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2022-11-23 16:07:40,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2022-11-23 16:07:40,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2022-11-23 16:07:40,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2022-11-23 16:07:40,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2022-11-23 16:07:40,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2022-11-23 16:07:40,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-23 16:07:40,606 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:07:40,612 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 16:07:40,612 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 16:07:40,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:07:40 BasicIcfg [2022-11-23 16:07:40,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 16:07:40,746 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 16:07:40,746 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 16:07:40,746 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 16:07:40,747 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:07:02" (3/4) ... [2022-11-23 16:07:40,750 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 16:07:40,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 16:07:40,750 INFO L158 Benchmark]: Toolchain (without parser) took 40838.05ms. Allocated memory was 130.0MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 97.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2022-11-23 16:07:40,751 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 130.0MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 16:07:40,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.46ms. Allocated memory is still 130.0MB. Free memory was 97.4MB in the beginning and 73.1MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-23 16:07:40,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.51ms. Allocated memory is still 130.0MB. Free memory was 73.1MB in the beginning and 70.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 16:07:40,753 INFO L158 Benchmark]: Boogie Preprocessor took 35.61ms. Allocated memory is still 130.0MB. Free memory was 70.6MB in the beginning and 68.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 16:07:40,753 INFO L158 Benchmark]: RCFGBuilder took 1719.78ms. Allocated memory was 130.0MB in the beginning and 159.4MB in the end (delta: 29.4MB). Free memory was 68.2MB in the beginning and 115.1MB in the end (delta: -46.9MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2022-11-23 16:07:40,754 INFO L158 Benchmark]: TraceAbstraction took 38440.34ms. Allocated memory was 159.4MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 115.1MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2022-11-23 16:07:40,755 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 3.8GB. Free memory is still 1.6GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 16:07:40,758 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 130.0MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 569.46ms. Allocated memory is still 130.0MB. Free memory was 97.4MB in the beginning and 73.1MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.51ms. Allocated memory is still 130.0MB. Free memory was 73.1MB in the beginning and 70.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.61ms. Allocated memory is still 130.0MB. Free memory was 70.6MB in the beginning and 68.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1719.78ms. Allocated memory was 130.0MB in the beginning and 159.4MB in the end (delta: 29.4MB). Free memory was 68.2MB in the beginning and 115.1MB in the end (delta: -46.9MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * TraceAbstraction took 38440.34ms. Allocated memory was 159.4MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 115.1MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 3.8GB. Free memory is still 1.6GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.6s, 186 PlacesBefore, 82 PlacesAfterwards, 178 TransitionsBefore, 73 TransitionsAfterwards, 6624 CoEnabledTransitionPairs, 8 FixpointIterations, 73 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 160 TotalNumberOfCompositions, 34536 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8903, independent: 8286, independent conditional: 0, independent unconditional: 8286, dependent: 556, dependent conditional: 0, dependent unconditional: 556, unknown: 61, unknown conditional: 0, unknown unconditional: 61] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3517, independent: 3412, independent conditional: 0, independent unconditional: 3412, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3517, independent: 3234, independent conditional: 0, independent unconditional: 3234, dependent: 283, dependent conditional: 0, dependent unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 283, independent: 178, independent conditional: 0, independent unconditional: 178, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1446, independent: 681, independent conditional: 0, independent unconditional: 681, dependent: 617, dependent conditional: 0, dependent unconditional: 617, unknown: 148, unknown conditional: 0, unknown unconditional: 148] ], Cache Queries: [ total: 8903, independent: 4874, independent conditional: 0, independent unconditional: 4874, dependent: 458, dependent conditional: 0, dependent unconditional: 458, unknown: 3571, unknown conditional: 0, unknown unconditional: 3571] , Statistics on independence cache: Total cache size (in pairs): 595, Positive cache size: 542, Positive conditional cache size: 0, Positive unconditional cache size: 542, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Unknown cache size: 7, Unknown conditional cache size: 0, Unknown unconditional cache size: 7 - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L731] 0 int __unbuffered_p2_EBX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1852; [L854] FCALL, FORK 0 pthread_create(&t1852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1852, ((void *)0), P0, ((void *)0))=9, t1852={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L855] 0 pthread_t t1853; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1852={7:0}, t1853={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L856] FCALL, FORK 0 pthread_create(&t1853, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1853, ((void *)0), P1, ((void *)0))=10, t1852={7:0}, t1853={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L857] 0 pthread_t t1854; [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L858] FCALL, FORK 0 pthread_create(&t1854, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1854, ((void *)0), P2, ((void *)0))=11, t1852={7:0}, t1853={8:0}, t1854={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L808] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L825] 3 __unbuffered_p2_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L828] 3 __unbuffered_p2_EBX = y VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L760] 1 y = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1852={7:0}, t1853={8:0}, t1854={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 233 locations, 75 error locations. Started 1 CEGAR loops. OverallTime: 38.1s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 764 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 764 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1973 IncrementalHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 48 mSDtfsCounter, 1973 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35046occurred in iteration=0, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 9615 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 1133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-23 16:07:40,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe003_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 16:07:43,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 16:07:43,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 16:07:43,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 16:07:43,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 16:07:43,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 16:07:43,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 16:07:43,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 16:07:43,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 16:07:43,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 16:07:43,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 16:07:43,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 16:07:43,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 16:07:43,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 16:07:43,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 16:07:43,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 16:07:43,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 16:07:43,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 16:07:43,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 16:07:43,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 16:07:43,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 16:07:43,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 16:07:43,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 16:07:43,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 16:07:43,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 16:07:43,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 16:07:43,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 16:07:43,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 16:07:43,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 16:07:43,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 16:07:43,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 16:07:43,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 16:07:43,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 16:07:43,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 16:07:43,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 16:07:43,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 16:07:43,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 16:07:43,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 16:07:43,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 16:07:43,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 16:07:43,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 16:07:43,445 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-23 16:07:43,470 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 16:07:43,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 16:07:43,471 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 16:07:43,472 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 16:07:43,472 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 16:07:43,473 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 16:07:43,473 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 16:07:43,473 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 16:07:43,473 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 16:07:43,473 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 16:07:43,474 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 16:07:43,474 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 16:07:43,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 16:07:43,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 16:07:43,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 16:07:43,475 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 16:07:43,476 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 16:07:43,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 16:07:43,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 16:07:43,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 16:07:43,477 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 16:07:43,477 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 16:07:43,477 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 16:07:43,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 16:07:43,477 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 16:07:43,478 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 16:07:43,478 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 16:07:43,478 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 16:07:43,478 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 16:07:43,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 16:07:43,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 16:07:43,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 16:07:43,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 16:07:43,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 16:07:43,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 16:07:43,480 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-23 16:07:43,480 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 16:07:43,480 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 16:07:43,480 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 16:07:43,481 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_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/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_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW 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 -> Taipan 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 -> 91a9aa2f0d12b9c007fce98740577392f81daf83caae08bbaade32d740f10d38 [2022-11-23 16:07:43,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 16:07:43,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 16:07:43,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 16:07:43,904 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 16:07:43,904 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 16:07:43,906 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/safe003_power.opt.i [2022-11-23 16:07:47,136 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 16:07:47,485 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 16:07:47,489 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/sv-benchmarks/c/pthread-wmm/safe003_power.opt.i [2022-11-23 16:07:47,509 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/data/7072ec526/08fa7d66bfe3448fa35cb626b979e2b3/FLAG83c2acdf7 [2022-11-23 16:07:47,536 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/data/7072ec526/08fa7d66bfe3448fa35cb626b979e2b3 [2022-11-23 16:07:47,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 16:07:47,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 16:07:47,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 16:07:47,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 16:07:47,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 16:07:47,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:07:47" (1/1) ... [2022-11-23 16:07:47,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb5faba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:47, skipping insertion in model container [2022-11-23 16:07:47,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:07:47" (1/1) ... [2022-11-23 16:07:47,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 16:07:47,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 16:07:47,862 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_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/sv-benchmarks/c/pthread-wmm/safe003_power.opt.i[951,964] [2022-11-23 16:07:48,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 16:07:48,178 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 16:07:48,196 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_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/sv-benchmarks/c/pthread-wmm/safe003_power.opt.i[951,964] [2022-11-23 16:07:48,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 16:07:48,313 INFO L208 MainTranslator]: Completed translation [2022-11-23 16:07:48,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:48 WrapperNode [2022-11-23 16:07:48,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 16:07:48,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 16:07:48,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 16:07:48,315 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 16:07:48,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:48" (1/1) ... [2022-11-23 16:07:48,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:48" (1/1) ... [2022-11-23 16:07:48,389 INFO L138 Inliner]: procedures = 180, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2022-11-23 16:07:48,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 16:07:48,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 16:07:48,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 16:07:48,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 16:07:48,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:48" (1/1) ... [2022-11-23 16:07:48,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:48" (1/1) ... [2022-11-23 16:07:48,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:48" (1/1) ... [2022-11-23 16:07:48,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:48" (1/1) ... [2022-11-23 16:07:48,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:48" (1/1) ... [2022-11-23 16:07:48,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:48" (1/1) ... [2022-11-23 16:07:48,439 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:48" (1/1) ... [2022-11-23 16:07:48,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:48" (1/1) ... [2022-11-23 16:07:48,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 16:07:48,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 16:07:48,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 16:07:48,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 16:07:48,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:48" (1/1) ... [2022-11-23 16:07:48,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 16:07:48,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:07:48,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 16:07:48,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 16:07:48,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-23 16:07:48,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 16:07:48,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 16:07:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 16:07:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 16:07:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 16:07:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 16:07:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-23 16:07:48,570 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 16:07:48,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 16:07:48,570 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 16:07:48,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 16:07:48,571 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 16:07:48,571 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 16:07:48,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 16:07:48,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 16:07:48,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 16:07:48,574 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 16:07:48,839 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 16:07:48,842 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 16:07:49,512 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 16:07:50,268 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 16:07:50,269 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 16:07:50,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:07:50 BoogieIcfgContainer [2022-11-23 16:07:50,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 16:07:50,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 16:07:50,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 16:07:50,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 16:07:50,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:07:47" (1/3) ... [2022-11-23 16:07:50,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248fe4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:07:50, skipping insertion in model container [2022-11-23 16:07:50,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:07:48" (2/3) ... [2022-11-23 16:07:50,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248fe4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:07:50, skipping insertion in model container [2022-11-23 16:07:50,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:07:50" (3/3) ... [2022-11-23 16:07:50,283 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.opt.i [2022-11-23 16:07:50,303 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 16:07:50,303 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2022-11-23 16:07:50,303 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 16:07:50,489 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 16:07:50,534 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 16:07:50,557 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 179 transitions, 373 flow [2022-11-23 16:07:50,562 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 179 transitions, 373 flow [2022-11-23 16:07:50,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 179 transitions, 373 flow [2022-11-23 16:07:50,694 INFO L130 PetriNetUnfolder]: 2/176 cut-off events. [2022-11-23 16:07:50,695 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 16:07:50,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 2/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 244 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2022-11-23 16:07:50,707 INFO L119 LiptonReduction]: Number of co-enabled transitions 6624 [2022-11-23 16:08:10,905 WARN L233 SmtUtils]: Spent 5.65s on a formula simplification. DAG size of input: 232 DAG size of output: 230 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-23 16:08:30,211 INFO L134 LiptonReduction]: Checked pairs total: 34156 [2022-11-23 16:08:30,212 INFO L136 LiptonReduction]: Total number of compositions: 159 [2022-11-23 16:08:30,222 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 73 transitions, 161 flow [2022-11-23 16:08:31,857 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:31,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 16:08:31,912 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;@75e4e40c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 16:08:31,913 INFO L358 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2022-11-23 16:08:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 16:08:32,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:32,002 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 16:08:32,003 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:08:32,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:32,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1141, now seen corresponding path program 1 times [2022-11-23 16:08:32,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:08:32,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598123914] [2022-11-23 16:08:32,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:32,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:32,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:08:32,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:08:32,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-23 16:08:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:32,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 16:08:32,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:32,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 16:08:32,229 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 16:08:32,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598123914] [2022-11-23 16:08:32,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598123914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:32,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:32,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 16:08:32,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950794640] [2022-11-23 16:08:32,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:32,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 16:08:32,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 16:08:32,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 16:08:32,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 16:08:32,319 INFO L87 Difference]: Start difference. First operand has 35046 states, 29111 states have (on average 4.471402562605201) internal successors, (130167), 35045 states have internal predecessors, (130167), 0 states have call successors, (0), 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-23 16:08:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:33,315 INFO L93 Difference]: Finished difference Result 15204 states and 54879 transitions. [2022-11-23 16:08:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 16:08:33,317 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-23 16:08:33,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:33,623 INFO L225 Difference]: With dead ends: 15204 [2022-11-23 16:08:33,624 INFO L226 Difference]: Without dead ends: 15204 [2022-11-23 16:08:33,635 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-23 16:08:33,638 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:33,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 16:08:33,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15204 states. [2022-11-23 16:08:34,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15204 to 15204. [2022-11-23 16:08:34,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15204 states, 13315 states have (on average 4.121592189260233) internal successors, (54879), 15203 states have internal predecessors, (54879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15204 states to 15204 states and 54879 transitions. [2022-11-23 16:08:34,785 INFO L78 Accepts]: Start accepts. Automaton has 15204 states and 54879 transitions. Word has length 1 [2022-11-23 16:08:34,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:34,786 INFO L495 AbstractCegarLoop]: Abstraction has 15204 states and 54879 transitions. [2022-11-23 16:08:34,787 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-23 16:08:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 15204 states and 54879 transitions. [2022-11-23 16:08:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-23 16:08:34,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:34,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-23 16:08:34,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/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-23 16:08:35,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:35,005 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:08:35,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:35,005 INFO L85 PathProgramCache]: Analyzing trace with hash 34966948, now seen corresponding path program 1 times [2022-11-23 16:08:35,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:08:35,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350563247] [2022-11-23 16:08:35,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:35,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:35,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:08:35,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:08:35,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-23 16:08:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:35,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 16:08:35,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:35,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 16:08:35,405 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 16:08:35,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350563247] [2022-11-23 16:08:35,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350563247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:35,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:35,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 16:08:35,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279135265] [2022-11-23 16:08:35,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:35,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:08:35,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 16:08:35,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:08:35,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:08:35,422 INFO L87 Difference]: Start difference. First operand 15204 states and 54879 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:36,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:36,316 INFO L93 Difference]: Finished difference Result 13683 states and 49236 transitions. [2022-11-23 16:08:36,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:08:36,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-23 16:08:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:36,424 INFO L225 Difference]: With dead ends: 13683 [2022-11-23 16:08:36,425 INFO L226 Difference]: Without dead ends: 13683 [2022-11-23 16:08:36,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-23 16:08:36,426 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 32 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:36,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 16:08:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13683 states. [2022-11-23 16:08:36,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13683 to 13683. [2022-11-23 16:08:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13683 states, 12109 states have (on average 4.066066562061277) internal successors, (49236), 13682 states have internal predecessors, (49236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13683 states to 13683 states and 49236 transitions. [2022-11-23 16:08:37,217 INFO L78 Accepts]: Start accepts. Automaton has 13683 states and 49236 transitions. Word has length 4 [2022-11-23 16:08:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:37,217 INFO L495 AbstractCegarLoop]: Abstraction has 13683 states and 49236 transitions. [2022-11-23 16:08:37,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 13683 states and 49236 transitions. [2022-11-23 16:08:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 16:08:37,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:37,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 16:08:37,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:37,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:37,430 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:08:37,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:37,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1083976322, now seen corresponding path program 1 times [2022-11-23 16:08:37,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:08:37,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387318704] [2022-11-23 16:08:37,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:37,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:37,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:08:37,433 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:08:37,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-23 16:08:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:37,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 16:08:37,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:37,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 16:08:37,615 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 16:08:37,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387318704] [2022-11-23 16:08:37,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387318704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:37,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:37,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 16:08:37,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912839552] [2022-11-23 16:08:37,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:37,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:08:37,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 16:08:37,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:08:37,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:08:37,618 INFO L87 Difference]: Start difference. First operand 13683 states and 49236 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:38,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:38,439 INFO L93 Difference]: Finished difference Result 17556 states and 63266 transitions. [2022-11-23 16:08:38,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:08:38,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-23 16:08:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:38,580 INFO L225 Difference]: With dead ends: 17556 [2022-11-23 16:08:38,580 INFO L226 Difference]: Without dead ends: 17556 [2022-11-23 16:08:38,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-23 16:08:38,583 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:38,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 6 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 16:08:38,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17556 states. [2022-11-23 16:08:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17556 to 14790. [2022-11-23 16:08:39,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14790 states, 13280 states have (on average 4.209638554216867) internal successors, (55904), 14789 states have internal predecessors, (55904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14790 states to 14790 states and 55904 transitions. [2022-11-23 16:08:39,362 INFO L78 Accepts]: Start accepts. Automaton has 14790 states and 55904 transitions. Word has length 5 [2022-11-23 16:08:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:39,365 INFO L495 AbstractCegarLoop]: Abstraction has 14790 states and 55904 transitions. [2022-11-23 16:08:39,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:39,366 INFO L276 IsEmpty]: Start isEmpty. Operand 14790 states and 55904 transitions. [2022-11-23 16:08:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 16:08:39,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:39,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 16:08:39,384 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/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)] Ended with exit code 0 [2022-11-23 16:08:39,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:39,578 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:08:39,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:39,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1083976324, now seen corresponding path program 1 times [2022-11-23 16:08:39,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:08:39,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027273978] [2022-11-23 16:08:39,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:39,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:39,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:08:39,581 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:08:39,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-23 16:08:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:39,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 16:08:39,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:40,015 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 16:08:40,016 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-23 16:08:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:40,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 16:08:40,080 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 16:08:40,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027273978] [2022-11-23 16:08:40,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027273978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:40,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:40,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 16:08:40,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153681798] [2022-11-23 16:08:40,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:40,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:08:40,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 16:08:40,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:08:40,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:08:40,086 INFO L87 Difference]: Start difference. First operand 14790 states and 55904 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:40,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:40,472 INFO L93 Difference]: Finished difference Result 8104 states and 29603 transitions. [2022-11-23 16:08:40,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:08:40,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-23 16:08:40,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:40,520 INFO L225 Difference]: With dead ends: 8104 [2022-11-23 16:08:40,520 INFO L226 Difference]: Without dead ends: 8104 [2022-11-23 16:08:40,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-23 16:08:40,522 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:40,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 4 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 16:08:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8104 states. [2022-11-23 16:08:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8104 to 8104. [2022-11-23 16:08:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8104 states, 7579 states have (on average 3.9059242644148306) internal successors, (29603), 8103 states have internal predecessors, (29603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8104 states to 8104 states and 29603 transitions. [2022-11-23 16:08:40,884 INFO L78 Accepts]: Start accepts. Automaton has 8104 states and 29603 transitions. Word has length 5 [2022-11-23 16:08:40,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:40,884 INFO L495 AbstractCegarLoop]: Abstraction has 8104 states and 29603 transitions. [2022-11-23 16:08:40,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 8104 states and 29603 transitions. [2022-11-23 16:08:40,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 16:08:40,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:40,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 16:08:40,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:41,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:41,097 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:08:41,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:41,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1083976325, now seen corresponding path program 1 times [2022-11-23 16:08:41,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:08:41,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201195360] [2022-11-23 16:08:41,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:41,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:41,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:08:41,100 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:08:41,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-23 16:08:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:41,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 16:08:41,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:41,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:41,304 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-23 16:08:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:41,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 16:08:41,358 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 16:08:41,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201195360] [2022-11-23 16:08:41,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201195360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:41,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:41,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 16:08:41,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039450611] [2022-11-23 16:08:41,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:41,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:08:41,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 16:08:41,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:08:41,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:08:41,360 INFO L87 Difference]: Start difference. First operand 8104 states and 29603 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:41,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:41,532 INFO L93 Difference]: Finished difference Result 2932 states and 10036 transitions. [2022-11-23 16:08:41,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:08:41,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-23 16:08:41,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:41,547 INFO L225 Difference]: With dead ends: 2932 [2022-11-23 16:08:41,547 INFO L226 Difference]: Without dead ends: 2932 [2022-11-23 16:08:41,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-23 16:08:41,548 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:41,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:08:41,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2022-11-23 16:08:41,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2801. [2022-11-23 16:08:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2801 states, 2727 states have (on average 3.523285661899523) internal successors, (9608), 2800 states have internal predecessors, (9608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 9608 transitions. [2022-11-23 16:08:41,705 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 9608 transitions. Word has length 5 [2022-11-23 16:08:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:41,705 INFO L495 AbstractCegarLoop]: Abstraction has 2801 states and 9608 transitions. [2022-11-23 16:08:41,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 9608 transitions. [2022-11-23 16:08:41,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 16:08:41,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:41,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:41,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:41,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:41,919 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:08:41,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:41,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1773648678, now seen corresponding path program 1 times [2022-11-23 16:08:41,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:08:41,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407364773] [2022-11-23 16:08:41,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:41,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:41,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:08:41,921 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:08:41,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-23 16:08:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:42,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 16:08:42,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:42,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 16:08:42,154 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 16:08:42,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407364773] [2022-11-23 16:08:42,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407364773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:42,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:42,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 16:08:42,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303735183] [2022-11-23 16:08:42,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:42,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:08:42,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 16:08:42,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:08:42,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:08:42,156 INFO L87 Difference]: Start difference. First operand 2801 states and 9608 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:42,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:42,353 INFO L93 Difference]: Finished difference Result 1210 states and 3294 transitions. [2022-11-23 16:08:42,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:08:42,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-23 16:08:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:42,359 INFO L225 Difference]: With dead ends: 1210 [2022-11-23 16:08:42,359 INFO L226 Difference]: Without dead ends: 1210 [2022-11-23 16:08:42,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-23 16:08:42,360 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4 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-23 16:08:42,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 16:08:42,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2022-11-23 16:08:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2022-11-23 16:08:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1160 states have (on average 2.839655172413793) internal successors, (3294), 1209 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 3294 transitions. [2022-11-23 16:08:42,386 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 3294 transitions. Word has length 10 [2022-11-23 16:08:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:42,387 INFO L495 AbstractCegarLoop]: Abstraction has 1210 states and 3294 transitions. [2022-11-23 16:08:42,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 3294 transitions. [2022-11-23 16:08:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 16:08:42,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:42,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:42,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:42,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:42,602 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:08:42,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash 820661136, now seen corresponding path program 1 times [2022-11-23 16:08:42,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:08:42,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560978699] [2022-11-23 16:08:42,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:42,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:42,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:08:42,604 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:08:42,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-23 16:08:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:42,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 16:08:42,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:42,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 16:08:42,852 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 16:08:42,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560978699] [2022-11-23 16:08:42,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560978699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:42,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:42,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 16:08:42,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16124309] [2022-11-23 16:08:42,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:42,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:08:42,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 16:08:42,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:08:42,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:08:42,854 INFO L87 Difference]: Start difference. First operand 1210 states and 3294 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-23 16:08:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:43,130 INFO L93 Difference]: Finished difference Result 377 states and 828 transitions. [2022-11-23 16:08:43,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 16:08:43,131 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-23 16:08:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:43,132 INFO L225 Difference]: With dead ends: 377 [2022-11-23 16:08:43,132 INFO L226 Difference]: Without dead ends: 377 [2022-11-23 16:08:43,132 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-23 16:08:43,133 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:43,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 16:08:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-23 16:08:43,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2022-11-23 16:08:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 359 states have (on average 2.3064066852367686) internal successors, (828), 376 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:43,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 828 transitions. [2022-11-23 16:08:43,140 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 828 transitions. Word has length 14 [2022-11-23 16:08:43,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:43,140 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 828 transitions. [2022-11-23 16:08:43,141 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-23 16:08:43,141 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 828 transitions. [2022-11-23 16:08:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 16:08:43,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:43,142 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-23 16:08:43,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:43,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:43,355 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:08:43,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:43,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1454132968, now seen corresponding path program 1 times [2022-11-23 16:08:43,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:08:43,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016147883] [2022-11-23 16:08:43,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:43,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:43,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:08:43,359 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:08:43,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-23 16:08:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:43,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 16:08:43,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:43,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 16:08:43,681 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 16:08:43,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016147883] [2022-11-23 16:08:43,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016147883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:43,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:43,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 16:08:43,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353269388] [2022-11-23 16:08:43,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:43,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 16:08:43,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 16:08:43,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 16:08:43,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 16:08:43,683 INFO L87 Difference]: Start difference. First operand 377 states and 828 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:44,064 INFO L93 Difference]: Finished difference Result 226 states and 533 transitions. [2022-11-23 16:08:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 16:08:44,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 16:08:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:44,065 INFO L225 Difference]: With dead ends: 226 [2022-11-23 16:08:44,065 INFO L226 Difference]: Without dead ends: 226 [2022-11-23 16:08:44,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 16:08:44,066 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:44,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 18 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 16:08:44,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-23 16:08:44,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-11-23 16:08:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 222 states have (on average 2.400900900900901) internal successors, (533), 225 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 533 transitions. [2022-11-23 16:08:44,072 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 533 transitions. Word has length 18 [2022-11-23 16:08:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:44,072 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 533 transitions. [2022-11-23 16:08:44,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 533 transitions. [2022-11-23 16:08:44,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 16:08:44,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:44,073 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-23 16:08:44,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:44,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:44,274 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:08:44,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:44,275 INFO L85 PathProgramCache]: Analyzing trace with hash 969750758, now seen corresponding path program 1 times [2022-11-23 16:08:44,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:08:44,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996193046] [2022-11-23 16:08:44,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:44,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-23 16:08:44,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:08:44,279 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:08:44,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-23 16:08:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:44,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 16:08:44,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:50,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 192 treesize of output 180 [2022-11-23 16:08:50,084 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 66 treesize of output 62 [2022-11-23 16:08:50,111 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 62 treesize of output 58 [2022-11-23 16:08:50,803 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-23 16:08:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:50,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 16:08:50,824 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 16:08:50,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996193046] [2022-11-23 16:08:50,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996193046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:50,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:50,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 16:08:50,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501878562] [2022-11-23 16:08:50,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:50,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 16:08:50,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 16:08:50,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 16:08:50,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 16:08:50,826 INFO L87 Difference]: Start difference. First operand 226 states and 533 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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-23 16:08:51,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:51,238 INFO L93 Difference]: Finished difference Result 225 states and 532 transitions. [2022-11-23 16:08:51,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 16:08:51,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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-23 16:08:51,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:51,240 INFO L225 Difference]: With dead ends: 225 [2022-11-23 16:08:51,240 INFO L226 Difference]: Without dead ends: 225 [2022-11-23 16:08:51,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-23 16:08:51,241 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 71 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:51,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 8 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 16:08:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-23 16:08:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2022-11-23 16:08:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 222 states have (on average 2.3963963963963963) internal successors, (532), 224 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 532 transitions. [2022-11-23 16:08:51,246 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 532 transitions. Word has length 22 [2022-11-23 16:08:51,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:51,247 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 532 transitions. [2022-11-23 16:08:51,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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-23 16:08:51,247 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 532 transitions. [2022-11-23 16:08:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 16:08:51,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:51,248 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-23 16:08:51,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:51,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:51,449 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:08:51,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:51,449 INFO L85 PathProgramCache]: Analyzing trace with hash 969750759, now seen corresponding path program 1 times [2022-11-23 16:08:51,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:08:51,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34666494] [2022-11-23 16:08:51,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:51,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:51,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:08:51,451 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:08:51,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-23 16:08:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:51,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 16:08:51,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:54,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 192 treesize of output 180 [2022-11-23 16:08:54,722 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 66 treesize of output 62 [2022-11-23 16:08:54,751 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 62 treesize of output 58 [2022-11-23 16:08:55,346 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-23 16:08:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:55,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 16:08:55,392 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 16:08:55,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34666494] [2022-11-23 16:08:55,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34666494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:55,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:55,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 16:08:55,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411231913] [2022-11-23 16:08:55,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:55,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 16:08:55,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 16:08:55,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 16:08:55,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 16:08:55,394 INFO L87 Difference]: Start difference. First operand 225 states and 532 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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-23 16:08:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:55,792 INFO L93 Difference]: Finished difference Result 224 states and 531 transitions. [2022-11-23 16:08:55,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 16:08:55,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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-23 16:08:55,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:55,794 INFO L225 Difference]: With dead ends: 224 [2022-11-23 16:08:55,794 INFO L226 Difference]: Without dead ends: 224 [2022-11-23 16:08:55,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-23 16:08:55,795 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 72 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:55,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 8 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 16:08:55,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-23 16:08:55,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-11-23 16:08:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 222 states have (on average 2.391891891891892) internal successors, (531), 223 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:55,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 531 transitions. [2022-11-23 16:08:55,800 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 531 transitions. Word has length 22 [2022-11-23 16:08:55,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:55,800 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 531 transitions. [2022-11-23 16:08:55,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 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-23 16:08:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 531 transitions. [2022-11-23 16:08:55,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 16:08:55,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:55,801 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-23 16:08:55,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:56,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:56,011 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:08:56,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:56,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2502848, now seen corresponding path program 1 times [2022-11-23 16:08:56,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:08:56,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677547682] [2022-11-23 16:08:56,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:56,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:56,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:08:56,013 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:08:56,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-23 16:08:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:56,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 16:08:56,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:56,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 16:08:56,277 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 16:08:56,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677547682] [2022-11-23 16:08:56,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677547682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:56,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:56,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 16:08:56,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384811619] [2022-11-23 16:08:56,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:56,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:08:56,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 16:08:56,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:08:56,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:08:56,279 INFO L87 Difference]: Start difference. First operand 224 states and 531 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-23 16:08:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:56,448 INFO L93 Difference]: Finished difference Result 326 states and 757 transitions. [2022-11-23 16:08:56,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:08:56,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-23 16:08:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:56,449 INFO L225 Difference]: With dead ends: 326 [2022-11-23 16:08:56,449 INFO L226 Difference]: Without dead ends: 326 [2022-11-23 16:08:56,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-23 16:08:56,450 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:56,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 16:08:56,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-11-23 16:08:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 322. [2022-11-23 16:08:56,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 320 states have (on average 2.35625) internal successors, (754), 321 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 754 transitions. [2022-11-23 16:08:56,458 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 754 transitions. Word has length 23 [2022-11-23 16:08:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:56,458 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 754 transitions. [2022-11-23 16:08:56,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-23 16:08:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 754 transitions. [2022-11-23 16:08:56,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 16:08:56,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:56,459 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-23 16:08:56,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:56,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:56,660 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:08:56,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:56,660 INFO L85 PathProgramCache]: Analyzing trace with hash 489882822, now seen corresponding path program 2 times [2022-11-23 16:08:56,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:08:56,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753951973] [2022-11-23 16:08:56,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 16:08:56,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:56,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:08:56,663 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:08:56,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/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-23 16:08:56,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 16:08:56,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:08:56,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 16:08:56,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:56,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 16:08:56,983 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 16:08:56,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753951973] [2022-11-23 16:08:56,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753951973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:56,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:56,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 16:08:56,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008446802] [2022-11-23 16:08:56,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:56,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:08:56,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 16:08:56,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:08:56,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:08:56,985 INFO L87 Difference]: Start difference. First operand 322 states and 754 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) 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-23 16:08:57,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:57,230 INFO L93 Difference]: Finished difference Result 412 states and 947 transitions. [2022-11-23 16:08:57,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 16:08:57,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) 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-23 16:08:57,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:57,233 INFO L225 Difference]: With dead ends: 412 [2022-11-23 16:08:57,233 INFO L226 Difference]: Without dead ends: 412 [2022-11-23 16:08:57,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-23 16:08:57,234 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:57,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 4 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 16:08:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2022-11-23 16:08:57,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 274. [2022-11-23 16:08:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 272 states have (on average 2.3455882352941178) internal successors, (638), 273 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 638 transitions. [2022-11-23 16:08:57,240 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 638 transitions. Word has length 23 [2022-11-23 16:08:57,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:57,241 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 638 transitions. [2022-11-23 16:08:57,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) 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-23 16:08:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 638 transitions. [2022-11-23 16:08:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 16:08:57,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:57,242 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-23 16:08:57,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/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-23 16:08:57,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:57,456 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:08:57,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:57,456 INFO L85 PathProgramCache]: Analyzing trace with hash -127010490, now seen corresponding path program 3 times [2022-11-23 16:08:57,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:08:57,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810782921] [2022-11-23 16:08:57,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:08:57,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:57,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:08:57,459 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:08:57,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/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-23 16:08:57,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 16:08:57,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:08:57,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 16:08:57,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:57,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 16:08:57,756 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 16:08:57,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810782921] [2022-11-23 16:08:57,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810782921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:57,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:57,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 16:08:57,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027179028] [2022-11-23 16:08:57,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:57,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:08:57,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 16:08:57,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:08:57,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:08:57,758 INFO L87 Difference]: Start difference. First operand 274 states and 638 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) 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-23 16:08:57,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:57,999 INFO L93 Difference]: Finished difference Result 442 states and 1003 transitions. [2022-11-23 16:08:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 16:08:58,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) 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-23 16:08:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:58,000 INFO L225 Difference]: With dead ends: 442 [2022-11-23 16:08:58,001 INFO L226 Difference]: Without dead ends: 442 [2022-11-23 16:08:58,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-23 16:08:58,001 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:58,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 16:08:58,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-11-23 16:08:58,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 262. [2022-11-23 16:08:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 260 states have (on average 2.3423076923076924) internal successors, (609), 261 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 609 transitions. [2022-11-23 16:08:58,008 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 609 transitions. Word has length 23 [2022-11-23 16:08:58,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:58,009 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 609 transitions. [2022-11-23 16:08:58,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) 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-23 16:08:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 609 transitions. [2022-11-23 16:08:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 16:08:58,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:58,010 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-23 16:08:58,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/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-23 16:08:58,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:58,222 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2022-11-23 16:08:58,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:58,223 INFO L85 PathProgramCache]: Analyzing trace with hash 448989766, now seen corresponding path program 4 times [2022-11-23 16:08:58,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:08:58,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430153649] [2022-11-23 16:08:58,224 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 16:08:58,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:58,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:08:58,225 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:08:58,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/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-23 16:08:58,581 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 16:08:58,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-23 16:08:58,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 16:08:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 16:08:58,832 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-23 16:08:58,832 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 16:08:58,833 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (74 of 75 remaining) [2022-11-23 16:08:58,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (73 of 75 remaining) [2022-11-23 16:08:58,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2022-11-23 16:08:58,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2022-11-23 16:08:58,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2022-11-23 16:08:58,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2022-11-23 16:08:58,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2022-11-23 16:08:58,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2022-11-23 16:08:58,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2022-11-23 16:08:58,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2022-11-23 16:08:58,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2022-11-23 16:08:58,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2022-11-23 16:08:58,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2022-11-23 16:08:58,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2022-11-23 16:08:58,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2022-11-23 16:08:58,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2022-11-23 16:08:58,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2022-11-23 16:08:58,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2022-11-23 16:08:58,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2022-11-23 16:08:58,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2022-11-23 16:08:58,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2022-11-23 16:08:58,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2022-11-23 16:08:58,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2022-11-23 16:08:58,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2022-11-23 16:08:58,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2022-11-23 16:08:58,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2022-11-23 16:08:58,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2022-11-23 16:08:58,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2022-11-23 16:08:58,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2022-11-23 16:08:58,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2022-11-23 16:08:58,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2022-11-23 16:08:58,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2022-11-23 16:08:58,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2022-11-23 16:08:58,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2022-11-23 16:08:58,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2022-11-23 16:08:58,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2022-11-23 16:08:58,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2022-11-23 16:08:58,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2022-11-23 16:08:58,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2022-11-23 16:08:58,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2022-11-23 16:08:58,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2022-11-23 16:08:58,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2022-11-23 16:08:58,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (32 of 75 remaining) [2022-11-23 16:08:58,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2022-11-23 16:08:58,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2022-11-23 16:08:58,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 75 remaining) [2022-11-23 16:08:58,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 75 remaining) [2022-11-23 16:08:58,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2022-11-23 16:08:58,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2022-11-23 16:08:58,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2022-11-23 16:08:58,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2022-11-23 16:08:58,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2022-11-23 16:08:58,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2022-11-23 16:08:58,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2022-11-23 16:08:58,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2022-11-23 16:08:58,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2022-11-23 16:08:58,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2022-11-23 16:08:58,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2022-11-23 16:08:58,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2022-11-23 16:08:58,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2022-11-23 16:08:58,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2022-11-23 16:08:58,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2022-11-23 16:08:58,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2022-11-23 16:08:58,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2022-11-23 16:08:58,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2022-11-23 16:08:58,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2022-11-23 16:08:58,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2022-11-23 16:08:58,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2022-11-23 16:08:58,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2022-11-23 16:08:58,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2022-11-23 16:08:58,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2022-11-23 16:08:58,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2022-11-23 16:08:58,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2022-11-23 16:08:58,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2022-11-23 16:08:58,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2022-11-23 16:08:58,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/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)] Ended with exit code 0 [2022-11-23 16:08:59,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:08:59,069 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:59,075 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 16:08:59,075 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 16:08:59,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:08:59 BasicIcfg [2022-11-23 16:08:59,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 16:08:59,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 16:08:59,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 16:08:59,195 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 16:08:59,195 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:07:50" (3/4) ... [2022-11-23 16:08:59,208 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 16:08:59,208 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 16:08:59,209 INFO L158 Benchmark]: Toolchain (without parser) took 71664.37ms. Allocated memory was 71.3MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 46.5MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2022-11-23 16:08:59,209 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 71.3MB. Free memory is still 50.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 16:08:59,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 765.68ms. Allocated memory was 71.3MB in the beginning and 98.6MB in the end (delta: 27.3MB). Free memory was 46.3MB in the beginning and 68.8MB in the end (delta: -22.5MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2022-11-23 16:08:59,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.83ms. Allocated memory is still 98.6MB. Free memory was 68.8MB in the beginning and 66.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 16:08:59,210 INFO L158 Benchmark]: Boogie Preprocessor took 52.58ms. Allocated memory is still 98.6MB. Free memory was 65.9MB in the beginning and 63.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 16:08:59,210 INFO L158 Benchmark]: RCFGBuilder took 1824.83ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 63.5MB in the beginning and 60.4MB in the end (delta: 3.1MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. [2022-11-23 16:08:59,213 INFO L158 Benchmark]: TraceAbstraction took 68920.17ms. Allocated memory was 119.5MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 59.2MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-11-23 16:08:59,214 INFO L158 Benchmark]: Witness Printer took 13.54ms. Allocated memory is still 4.0GB. Free memory is still 2.3GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 16:08:59,220 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.35ms. Allocated memory is still 71.3MB. Free memory is still 50.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 765.68ms. Allocated memory was 71.3MB in the beginning and 98.6MB in the end (delta: 27.3MB). Free memory was 46.3MB in the beginning and 68.8MB in the end (delta: -22.5MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.83ms. Allocated memory is still 98.6MB. Free memory was 68.8MB in the beginning and 66.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.58ms. Allocated memory is still 98.6MB. Free memory was 65.9MB in the beginning and 63.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1824.83ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 63.5MB in the beginning and 60.4MB in the end (delta: 3.1MB). Peak memory consumption was 43.2MB. Max. memory is 16.1GB. * TraceAbstraction took 68920.17ms. Allocated memory was 119.5MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 59.2MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 13.54ms. Allocated memory is still 4.0GB. Free memory is still 2.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.7s, 187 PlacesBefore, 82 PlacesAfterwards, 179 TransitionsBefore, 73 TransitionsAfterwards, 6624 CoEnabledTransitionPairs, 8 FixpointIterations, 74 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 159 TotalNumberOfCompositions, 34156 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8483, independent: 7873, independent conditional: 0, independent unconditional: 7873, dependent: 550, dependent conditional: 0, dependent unconditional: 550, unknown: 60, unknown conditional: 0, unknown unconditional: 60] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3365, independent: 3271, independent conditional: 0, independent unconditional: 3271, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3365, independent: 3116, independent conditional: 0, independent unconditional: 3116, dependent: 249, dependent conditional: 0, dependent unconditional: 249, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 249, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4194, independent: 827, independent conditional: 0, independent unconditional: 827, dependent: 1061, dependent conditional: 0, dependent unconditional: 1061, unknown: 2306, unknown conditional: 0, unknown unconditional: 2306] ], Cache Queries: [ total: 8483, independent: 4602, independent conditional: 0, independent unconditional: 4602, dependent: 465, dependent conditional: 0, dependent unconditional: 465, unknown: 3416, unknown conditional: 0, unknown unconditional: 3416] , Statistics on independence cache: Total cache size (in pairs): 470, Positive cache size: 420, Positive conditional cache size: 0, Positive unconditional cache size: 420, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Unknown cache size: 7, Unknown conditional cache size: 0, Unknown unconditional cache size: 7 - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L712] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L713] 0 int __unbuffered_p1_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L722] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L723] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L724] 0 int __unbuffered_p1_EAX$w_buff0; [L725] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L726] 0 int __unbuffered_p1_EAX$w_buff1; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L729] 0 int __unbuffered_p2_EAX = 0; [L731] 0 int __unbuffered_p2_EBX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1852; [L854] FCALL, FORK 0 pthread_create(&t1852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1852, ((void *)0), P0, ((void *)0))=0, t1852={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L855] 0 pthread_t t1853; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1852={7:0}, t1853={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L856] FCALL, FORK 0 pthread_create(&t1853, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1853, ((void *)0), P1, ((void *)0))=1, t1852={7:0}, t1853={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] EXPR 2 \read(x) [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L808] 2 y = 1 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L857] 0 pthread_t t1854; [L858] FCALL, FORK 0 pthread_create(&t1854, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1854, ((void *)0), P2, ((void *)0))=2, t1852={7:0}, t1853={14:0}, t1854={15:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L825] 3 __unbuffered_p2_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L828] 3 __unbuffered_p2_EBX = y VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] 1 y = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1852={7:0}, t1853={14:0}, t1854={15:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=2, weak$$choice1=2, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 234 locations, 75 error locations. Started 1 CEGAR loops. OverallTime: 68.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 41.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 406 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 406 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1206 IncrementalHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 40 mSDtfsCounter, 1206 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35046occurred in iteration=0, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 3219 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 942 SizeOfPredicates, 55 NumberOfNonLiveVariables, 1793 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-23 16:08:59,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97359072-666a-4dd1-a7b0-b1ffd32f1d3b/bin/utaipan-Q6hlc19bkW/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