./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af --- 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 13:52:15,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 13:52:15,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 13:52:15,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 13:52:15,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 13:52:15,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 13:52:15,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 13:52:15,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 13:52:15,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 13:52:15,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 13:52:15,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 13:52:15,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 13:52:15,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 13:52:15,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 13:52:15,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 13:52:15,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 13:52:15,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 13:52:15,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 13:52:15,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 13:52:15,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 13:52:15,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 13:52:15,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 13:52:15,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 13:52:15,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 13:52:15,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 13:52:15,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 13:52:15,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 13:52:15,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 13:52:15,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 13:52:15,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 13:52:15,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 13:52:15,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 13:52:15,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 13:52:15,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 13:52:15,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 13:52:15,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 13:52:15,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 13:52:15,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 13:52:15,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 13:52:15,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 13:52:15,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 13:52:15,569 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-23 13:52:15,612 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 13:52:15,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 13:52:15,616 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 13:52:15,616 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 13:52:15,618 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 13:52:15,618 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 13:52:15,618 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 13:52:15,618 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 13:52:15,619 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 13:52:15,619 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 13:52:15,620 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 13:52:15,621 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 13:52:15,621 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 13:52:15,621 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 13:52:15,621 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 13:52:15,622 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 13:52:15,622 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 13:52:15,622 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 13:52:15,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 13:52:15,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 13:52:15,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 13:52:15,624 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 13:52:15,624 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 13:52:15,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 13:52:15,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 13:52:15,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 13:52:15,625 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 13:52:15,625 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 13:52:15,626 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 13:52:15,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 13:52:15,626 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 13:52:15,626 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 13:52:15,627 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 13:52:15,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 13:52:15,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 13:52:15,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:52:15,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 13:52:15,628 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 13:52:15,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 13:52:15,628 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 13:52:15,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 13:52:15,629 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 13:52:15,629 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_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 -> 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af [2022-11-23 13:52:16,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 13:52:16,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 13:52:16,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 13:52:16,060 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 13:52:16,061 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 13:52:16,062 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2022-11-23 13:52:19,836 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 13:52:20,291 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 13:52:20,297 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2022-11-23 13:52:20,322 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/data/016512c14/eea28456d07949bdaec4cbdb55ce0c9f/FLAG80da3c074 [2022-11-23 13:52:20,348 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/data/016512c14/eea28456d07949bdaec4cbdb55ce0c9f [2022-11-23 13:52:20,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 13:52:20,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 13:52:20,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 13:52:20,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 13:52:20,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 13:52:20,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:20" (1/1) ... [2022-11-23 13:52:20,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d472227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:20, skipping insertion in model container [2022-11-23 13:52:20,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:20" (1/1) ... [2022-11-23 13:52:20,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 13:52:20,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 13:52:20,617 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_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2022-11-23 13:52:21,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:52:21,030 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 13:52:21,050 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_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2022-11-23 13:52:21,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:52:21,195 INFO L208 MainTranslator]: Completed translation [2022-11-23 13:52:21,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:21 WrapperNode [2022-11-23 13:52:21,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 13:52:21,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 13:52:21,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 13:52:21,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 13:52:21,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:21" (1/1) ... [2022-11-23 13:52:21,238 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:21" (1/1) ... [2022-11-23 13:52:21,302 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-11-23 13:52:21,304 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 13:52:21,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 13:52:21,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 13:52:21,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 13:52:21,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:21" (1/1) ... [2022-11-23 13:52:21,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:21" (1/1) ... [2022-11-23 13:52:21,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:21" (1/1) ... [2022-11-23 13:52:21,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:21" (1/1) ... [2022-11-23 13:52:21,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:21" (1/1) ... [2022-11-23 13:52:21,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:21" (1/1) ... [2022-11-23 13:52:21,349 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:21" (1/1) ... [2022-11-23 13:52:21,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:21" (1/1) ... [2022-11-23 13:52:21,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 13:52:21,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 13:52:21,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 13:52:21,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 13:52:21,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:21" (1/1) ... [2022-11-23 13:52:21,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:52:21,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:52:21,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 13:52:21,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 13:52:21,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 13:52:21,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 13:52:21,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 13:52:21,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 13:52:21,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 13:52:21,536 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 13:52:21,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 13:52:21,536 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 13:52:21,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 13:52:21,537 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 13:52:21,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 13:52:21,537 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 13:52:21,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 13:52:21,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 13:52:21,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 13:52:21,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 13:52:21,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 13:52:21,539 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 13:52:21,694 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 13:52:21,696 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 13:52:22,271 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 13:52:22,482 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 13:52:22,483 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 13:52:22,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:22 BoogieIcfgContainer [2022-11-23 13:52:22,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 13:52:22,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 13:52:22,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 13:52:22,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 13:52:22,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:52:20" (1/3) ... [2022-11-23 13:52:22,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcb173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:22, skipping insertion in model container [2022-11-23 13:52:22,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:21" (2/3) ... [2022-11-23 13:52:22,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcb173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:22, skipping insertion in model container [2022-11-23 13:52:22,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:22" (3/3) ... [2022-11-23 13:52:22,508 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2022-11-23 13:52:22,534 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 13:52:22,534 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-23 13:52:22,534 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 13:52:22,665 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 13:52:22,737 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 13:52:22,757 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 148 transitions, 316 flow [2022-11-23 13:52:22,761 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 148 transitions, 316 flow [2022-11-23 13:52:22,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 316 flow [2022-11-23 13:52:22,870 INFO L130 PetriNetUnfolder]: 2/144 cut-off events. [2022-11-23 13:52:22,870 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 13:52:22,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 2/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-23 13:52:22,889 INFO L119 LiptonReduction]: Number of co-enabled transitions 3552 [2022-11-23 13:52:31,672 INFO L134 LiptonReduction]: Checked pairs total: 10130 [2022-11-23 13:52:31,672 INFO L136 LiptonReduction]: Total number of compositions: 141 [2022-11-23 13:52:31,682 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 44 transitions, 108 flow [2022-11-23 13:52:31,985 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 0 states have call successors, (0), 0 states 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 13:52:32,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 13:52:32,025 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;@22561be5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 13:52:32,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-23 13:52:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 0 states have call successors, (0), 0 states 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 13:52:32,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 13:52:32,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:32,055 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 13:52:32,056 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:32,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:32,067 INFO L85 PathProgramCache]: Analyzing trace with hash 611, now seen corresponding path program 1 times [2022-11-23 13:52:32,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:32,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784145345] [2022-11-23 13:52:32,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:32,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:32,230 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 13:52:32,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:32,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784145345] [2022-11-23 13:52:32,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784145345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:32,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:32,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 13:52:32,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100619071] [2022-11-23 13:52:32,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:32,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 13:52:32,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:32,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 13:52:32,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 13:52:32,287 INFO L87 Difference]: Start difference. First operand has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 0 states have call successors, (0), 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 13:52:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:32,463 INFO L93 Difference]: Finished difference Result 4850 states and 19358 transitions. [2022-11-23 13:52:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 13:52:32,466 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 13:52:32,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:32,532 INFO L225 Difference]: With dead ends: 4850 [2022-11-23 13:52:32,532 INFO L226 Difference]: Without dead ends: 4850 [2022-11-23 13:52:32,533 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 13:52:32,537 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:32,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:52:32,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4850 states. [2022-11-23 13:52:32,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4850 to 4850. [2022-11-23 13:52:32,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4850 states, 4845 states have (on average 3.995459236326109) internal successors, (19358), 4849 states have internal predecessors, (19358), 0 states have call successors, (0), 0 states 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 13:52:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4850 states to 4850 states and 19358 transitions. [2022-11-23 13:52:32,991 INFO L78 Accepts]: Start accepts. Automaton has 4850 states and 19358 transitions. Word has length 1 [2022-11-23 13:52:32,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:32,992 INFO L495 AbstractCegarLoop]: Abstraction has 4850 states and 19358 transitions. [2022-11-23 13:52:32,997 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 13:52:32,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4850 states and 19358 transitions. [2022-11-23 13:52:32,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 13:52:33,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:33,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:33,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 13:52:33,001 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:33,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:33,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1303940140, now seen corresponding path program 1 times [2022-11-23 13:52:33,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:33,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914579398] [2022-11-23 13:52:33,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:33,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:33,607 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 13:52:33,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:33,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914579398] [2022-11-23 13:52:33,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914579398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:33,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:33,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 13:52:33,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292929548] [2022-11-23 13:52:33,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:33,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:52:33,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:33,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:52:33,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:52:33,612 INFO L87 Difference]: Start difference. First operand 4850 states and 19358 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 13:52:33,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:33,800 INFO L93 Difference]: Finished difference Result 3970 states and 15654 transitions. [2022-11-23 13:52:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:52:33,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-23 13:52:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:33,843 INFO L225 Difference]: With dead ends: 3970 [2022-11-23 13:52:33,843 INFO L226 Difference]: Without dead ends: 3850 [2022-11-23 13:52:33,844 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 13:52:33,845 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:33,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 10 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:52:33,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2022-11-23 13:52:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3850. [2022-11-23 13:52:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3850 states, 3848 states have (on average 3.9625779625779627) internal successors, (15248), 3849 states have internal predecessors, (15248), 0 states have call successors, (0), 0 states 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 13:52:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 15248 transitions. [2022-11-23 13:52:34,076 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 15248 transitions. Word has length 7 [2022-11-23 13:52:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:34,077 INFO L495 AbstractCegarLoop]: Abstraction has 3850 states and 15248 transitions. [2022-11-23 13:52:34,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 13:52:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 15248 transitions. [2022-11-23 13:52:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 13:52:34,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:34,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:34,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 13:52:34,086 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:34,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:34,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1652670574, now seen corresponding path program 1 times [2022-11-23 13:52:34,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:34,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189456139] [2022-11-23 13:52:34,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:34,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:36,252 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 13:52:36,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:36,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189456139] [2022-11-23 13:52:36,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189456139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:36,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:36,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 13:52:36,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045694521] [2022-11-23 13:52:36,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:36,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:52:36,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:36,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:52:36,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:52:36,255 INFO L87 Difference]: Start difference. First operand 3850 states and 15248 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 13:52:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:36,559 INFO L93 Difference]: Finished difference Result 5394 states and 21055 transitions. [2022-11-23 13:52:36,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:52:36,560 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 13:52:36,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:36,615 INFO L225 Difference]: With dead ends: 5394 [2022-11-23 13:52:36,616 INFO L226 Difference]: Without dead ends: 5394 [2022-11-23 13:52:36,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:52:36,617 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:36,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 7 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:52:36,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5394 states. [2022-11-23 13:52:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5394 to 3930. [2022-11-23 13:52:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3930 states, 3928 states have (on average 3.9694501018329937) internal successors, (15592), 3929 states have internal predecessors, (15592), 0 states have call successors, (0), 0 states 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 13:52:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3930 states to 3930 states and 15592 transitions. [2022-11-23 13:52:36,840 INFO L78 Accepts]: Start accepts. Automaton has 3930 states and 15592 transitions. Word has length 11 [2022-11-23 13:52:36,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:36,841 INFO L495 AbstractCegarLoop]: Abstraction has 3930 states and 15592 transitions. [2022-11-23 13:52:36,842 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 13:52:36,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3930 states and 15592 transitions. [2022-11-23 13:52:36,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 13:52:36,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:36,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:36,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 13:52:36,852 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:36,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:36,853 INFO L85 PathProgramCache]: Analyzing trace with hash 304970304, now seen corresponding path program 1 times [2022-11-23 13:52:36,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:36,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426812456] [2022-11-23 13:52:36,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:36,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:38,610 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 13:52:38,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:38,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426812456] [2022-11-23 13:52:38,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426812456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:38,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:38,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 13:52:38,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552076709] [2022-11-23 13:52:38,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:38,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:52:38,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:38,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:52:38,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:52:38,613 INFO L87 Difference]: Start difference. First operand 3930 states and 15592 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:38,927 INFO L93 Difference]: Finished difference Result 4810 states and 18736 transitions. [2022-11-23 13:52:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:52:38,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 13:52:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:38,968 INFO L225 Difference]: With dead ends: 4810 [2022-11-23 13:52:38,968 INFO L226 Difference]: Without dead ends: 4810 [2022-11-23 13:52:38,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:52:38,973 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:38,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 14 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:52:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2022-11-23 13:52:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 3730. [2022-11-23 13:52:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3730 states, 3728 states have (on average 3.9490343347639487) internal successors, (14722), 3729 states have internal predecessors, (14722), 0 states have call successors, (0), 0 states 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 13:52:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3730 states to 3730 states and 14722 transitions. [2022-11-23 13:52:39,140 INFO L78 Accepts]: Start accepts. Automaton has 3730 states and 14722 transitions. Word has length 12 [2022-11-23 13:52:39,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:39,142 INFO L495 AbstractCegarLoop]: Abstraction has 3730 states and 14722 transitions. [2022-11-23 13:52:39,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3730 states and 14722 transitions. [2022-11-23 13:52:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 13:52:39,144 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:39,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:39,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 13:52:39,145 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:39,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:39,150 INFO L85 PathProgramCache]: Analyzing trace with hash 306820720, now seen corresponding path program 1 times [2022-11-23 13:52:39,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:39,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121437463] [2022-11-23 13:52:39,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:39,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:39,990 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 13:52:39,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:39,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121437463] [2022-11-23 13:52:39,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121437463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:39,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:39,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:52:39,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548296198] [2022-11-23 13:52:39,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:39,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:52:39,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:39,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:52:39,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:52:39,993 INFO L87 Difference]: Start difference. First operand 3730 states and 14722 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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 13:52:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:40,361 INFO L93 Difference]: Finished difference Result 3130 states and 12212 transitions. [2022-11-23 13:52:40,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:52:40,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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 13:52:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:40,375 INFO L225 Difference]: With dead ends: 3130 [2022-11-23 13:52:40,375 INFO L226 Difference]: Without dead ends: 2530 [2022-11-23 13:52:40,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:52:40,376 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:40,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 80 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:52:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2022-11-23 13:52:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2530. [2022-11-23 13:52:40,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2530 states, 2529 states have (on average 3.804665875840253) internal successors, (9622), 2529 states have internal predecessors, (9622), 0 states have call successors, (0), 0 states 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 13:52:40,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 9622 transitions. [2022-11-23 13:52:40,531 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 9622 transitions. Word has length 12 [2022-11-23 13:52:40,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:40,531 INFO L495 AbstractCegarLoop]: Abstraction has 2530 states and 9622 transitions. [2022-11-23 13:52:40,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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 13:52:40,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 9622 transitions. [2022-11-23 13:52:40,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 13:52:40,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:40,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:40,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 13:52:40,535 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:40,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:40,536 INFO L85 PathProgramCache]: Analyzing trace with hash 860299381, now seen corresponding path program 1 times [2022-11-23 13:52:40,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:40,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653549546] [2022-11-23 13:52:40,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:40,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:41,262 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 13:52:41,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:41,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653549546] [2022-11-23 13:52:41,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653549546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:41,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:41,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 13:52:41,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861710717] [2022-11-23 13:52:41,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:41,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:52:41,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:41,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:52:41,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:52:41,266 INFO L87 Difference]: Start difference. First operand 2530 states and 9622 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:41,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:41,365 INFO L93 Difference]: Finished difference Result 2450 states and 9278 transitions. [2022-11-23 13:52:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:52:41,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 13:52:41,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:41,382 INFO L225 Difference]: With dead ends: 2450 [2022-11-23 13:52:41,382 INFO L226 Difference]: Without dead ends: 2450 [2022-11-23 13:52:41,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:52:41,383 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 24 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:41,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 9 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:52:41,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2022-11-23 13:52:41,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2022-11-23 13:52:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 2449 states have (on average 3.7884850959575336) internal successors, (9278), 2449 states have internal predecessors, (9278), 0 states have call successors, (0), 0 states 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 13:52:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 9278 transitions. [2022-11-23 13:52:41,495 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 9278 transitions. Word has length 13 [2022-11-23 13:52:41,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:41,495 INFO L495 AbstractCegarLoop]: Abstraction has 2450 states and 9278 transitions. [2022-11-23 13:52:41,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 9278 transitions. [2022-11-23 13:52:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 13:52:41,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:41,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:41,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 13:52:41,499 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:41,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:41,500 INFO L85 PathProgramCache]: Analyzing trace with hash 129710129, now seen corresponding path program 1 times [2022-11-23 13:52:41,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:41,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571733930] [2022-11-23 13:52:41,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:41,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:42,098 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 13:52:42,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:42,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571733930] [2022-11-23 13:52:42,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571733930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:42,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:42,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 13:52:42,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845106609] [2022-11-23 13:52:42,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:42,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:52:42,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:42,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:52:42,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:52:42,101 INFO L87 Difference]: Start difference. First operand 2450 states and 9278 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) 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 13:52:42,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:42,307 INFO L93 Difference]: Finished difference Result 2922 states and 10972 transitions. [2022-11-23 13:52:42,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:52:42,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) 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 13:52:42,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:42,326 INFO L225 Difference]: With dead ends: 2922 [2022-11-23 13:52:42,326 INFO L226 Difference]: Without dead ends: 2922 [2022-11-23 13:52:42,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 13:52:42,327 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 32 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:42,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 13 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:52:42,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2022-11-23 13:52:42,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2818. [2022-11-23 13:52:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2817 states have (on average 3.777067802626908) internal successors, (10640), 2817 states have internal predecessors, (10640), 0 states have call successors, (0), 0 states 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 13:52:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 10640 transitions. [2022-11-23 13:52:42,478 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 10640 transitions. Word has length 14 [2022-11-23 13:52:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:42,479 INFO L495 AbstractCegarLoop]: Abstraction has 2818 states and 10640 transitions. [2022-11-23 13:52:42,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) 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 13:52:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 10640 transitions. [2022-11-23 13:52:42,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 13:52:42,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:42,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:42,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 13:52:42,485 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:42,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:42,485 INFO L85 PathProgramCache]: Analyzing trace with hash 751100304, now seen corresponding path program 1 times [2022-11-23 13:52:42,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:42,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588507163] [2022-11-23 13:52:42,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:42,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:42,802 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 13:52:42,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:42,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588507163] [2022-11-23 13:52:42,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588507163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:42,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:42,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:52:42,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140115168] [2022-11-23 13:52:42,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:42,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:52:42,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:42,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:52:42,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:52:42,807 INFO L87 Difference]: Start difference. First operand 2818 states and 10640 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:42,998 INFO L93 Difference]: Finished difference Result 2901 states and 9998 transitions. [2022-11-23 13:52:42,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:52:42,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 13:52:42,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:43,010 INFO L225 Difference]: With dead ends: 2901 [2022-11-23 13:52:43,011 INFO L226 Difference]: Without dead ends: 2157 [2022-11-23 13:52:43,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 13:52:43,014 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:43,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 25 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:52:43,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2022-11-23 13:52:43,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 2157. [2022-11-23 13:52:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2157 states, 2156 states have (on average 3.4081632653061225) internal successors, (7348), 2156 states have internal predecessors, (7348), 0 states have call successors, (0), 0 states 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 13:52:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 7348 transitions. [2022-11-23 13:52:43,095 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 7348 transitions. Word has length 16 [2022-11-23 13:52:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:43,095 INFO L495 AbstractCegarLoop]: Abstraction has 2157 states and 7348 transitions. [2022-11-23 13:52:43,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:43,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 7348 transitions. [2022-11-23 13:52:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 13:52:43,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:43,100 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 13:52:43,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 13:52:43,101 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:43,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:43,102 INFO L85 PathProgramCache]: Analyzing trace with hash 786100699, now seen corresponding path program 1 times [2022-11-23 13:52:43,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:43,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110796632] [2022-11-23 13:52:43,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:43,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:43,422 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 13:52:43,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:43,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110796632] [2022-11-23 13:52:43,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110796632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:43,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:43,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:52:43,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981570859] [2022-11-23 13:52:43,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:43,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:52:43,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:43,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:52:43,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:52:43,426 INFO L87 Difference]: Start difference. First operand 2157 states and 7348 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:43,649 INFO L93 Difference]: Finished difference Result 1838 states and 5792 transitions. [2022-11-23 13:52:43,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:52:43,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-23 13:52:43,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:43,657 INFO L225 Difference]: With dead ends: 1838 [2022-11-23 13:52:43,657 INFO L226 Difference]: Without dead ends: 1382 [2022-11-23 13:52:43,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:52:43,660 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 73 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:43,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 35 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:52:43,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2022-11-23 13:52:43,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1382. [2022-11-23 13:52:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1381 states have (on average 3.0876176683562635) internal successors, (4264), 1381 states have internal predecessors, (4264), 0 states have call successors, (0), 0 states 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 13:52:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 4264 transitions. [2022-11-23 13:52:43,706 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 4264 transitions. Word has length 17 [2022-11-23 13:52:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:43,707 INFO L495 AbstractCegarLoop]: Abstraction has 1382 states and 4264 transitions. [2022-11-23 13:52:43,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:43,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 4264 transitions. [2022-11-23 13:52:43,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 13:52:43,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:43,714 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 13:52:43,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 13:52:43,714 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:43,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:43,715 INFO L85 PathProgramCache]: Analyzing trace with hash 561037650, now seen corresponding path program 1 times [2022-11-23 13:52:43,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:43,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088170671] [2022-11-23 13:52:43,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:43,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:44,007 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:44,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088170671] [2022-11-23 13:52:44,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088170671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:44,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:44,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:52:44,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13633546] [2022-11-23 13:52:44,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:44,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:52:44,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:44,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:52:44,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:52:44,012 INFO L87 Difference]: Start difference. First operand 1382 states and 4264 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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 13:52:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:44,232 INFO L93 Difference]: Finished difference Result 1216 states and 3730 transitions. [2022-11-23 13:52:44,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:52:44,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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 13:52:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:44,238 INFO L225 Difference]: With dead ends: 1216 [2022-11-23 13:52:44,239 INFO L226 Difference]: Without dead ends: 1078 [2022-11-23 13:52:44,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:52:44,240 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 91 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:44,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 40 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:52:44,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2022-11-23 13:52:44,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 934. [2022-11-23 13:52:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 933 states have (on average 3.0943193997856375) internal successors, (2887), 933 states have internal predecessors, (2887), 0 states have call successors, (0), 0 states 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 13:52:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 2887 transitions. [2022-11-23 13:52:44,280 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 2887 transitions. Word has length 20 [2022-11-23 13:52:44,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:44,281 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 2887 transitions. [2022-11-23 13:52:44,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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 13:52:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 2887 transitions. [2022-11-23 13:52:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 13:52:44,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:44,285 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 13:52:44,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 13:52:44,285 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:44,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:44,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1630731374, now seen corresponding path program 1 times [2022-11-23 13:52:44,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:44,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339886826] [2022-11-23 13:52:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:44,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:45,763 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 13:52:45,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:45,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339886826] [2022-11-23 13:52:45,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339886826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:45,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:45,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:52:45,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096713555] [2022-11-23 13:52:45,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:45,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:52:45,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:45,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:52:45,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:52:45,765 INFO L87 Difference]: Start difference. First operand 934 states and 2887 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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 13:52:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:46,230 INFO L93 Difference]: Finished difference Result 1370 states and 4175 transitions. [2022-11-23 13:52:46,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:52:46,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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 13:52:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:46,236 INFO L225 Difference]: With dead ends: 1370 [2022-11-23 13:52:46,236 INFO L226 Difference]: Without dead ends: 1091 [2022-11-23 13:52:46,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:52:46,237 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 68 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:46,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 19 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:52:46,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2022-11-23 13:52:46,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 934. [2022-11-23 13:52:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 933 states have (on average 3.0117899249732045) internal successors, (2810), 933 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states 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 13:52:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 2810 transitions. [2022-11-23 13:52:46,269 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 2810 transitions. Word has length 23 [2022-11-23 13:52:46,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:46,269 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 2810 transitions. [2022-11-23 13:52:46,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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 13:52:46,270 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 2810 transitions. [2022-11-23 13:52:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 13:52:46,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:46,273 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 13:52:46,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 13:52:46,279 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:46,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:46,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1373706012, now seen corresponding path program 2 times [2022-11-23 13:52:46,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:46,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460561882] [2022-11-23 13:52:46,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:46,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:46,599 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 13:52:46,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:46,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460561882] [2022-11-23 13:52:46,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460561882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:46,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:46,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:52:46,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630863093] [2022-11-23 13:52:46,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:46,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:52:46,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:46,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:52:46,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:52:46,602 INFO L87 Difference]: Start difference. First operand 934 states and 2810 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 13:52:46,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:46,829 INFO L93 Difference]: Finished difference Result 904 states and 2749 transitions. [2022-11-23 13:52:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 13:52:46,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 13:52:46,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:46,833 INFO L225 Difference]: With dead ends: 904 [2022-11-23 13:52:46,833 INFO L226 Difference]: Without dead ends: 474 [2022-11-23 13:52:46,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-23 13:52:46,834 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 115 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:46,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 36 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:52:46,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-11-23 13:52:46,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 442. [2022-11-23 13:52:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 2.8458049886621315) internal successors, (1255), 441 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states 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 13:52:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1255 transitions. [2022-11-23 13:52:46,847 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1255 transitions. Word has length 23 [2022-11-23 13:52:46,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:46,847 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 1255 transitions. [2022-11-23 13:52:46,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 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 13:52:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1255 transitions. [2022-11-23 13:52:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:52:46,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:46,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:46,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 13:52:46,850 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:46,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:46,850 INFO L85 PathProgramCache]: Analyzing trace with hash 380741021, now seen corresponding path program 1 times [2022-11-23 13:52:46,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:46,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640908161] [2022-11-23 13:52:46,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:46,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:48,299 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 13:52:48,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:48,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640908161] [2022-11-23 13:52:48,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640908161] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:48,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:48,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:52:48,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583325617] [2022-11-23 13:52:48,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:48,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 13:52:48,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:48,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 13:52:48,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-23 13:52:48,304 INFO L87 Difference]: Start difference. First operand 442 states and 1255 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 13:52:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:48,665 INFO L93 Difference]: Finished difference Result 668 states and 1836 transitions. [2022-11-23 13:52:48,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:52:48,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:52:48,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:48,668 INFO L225 Difference]: With dead ends: 668 [2022-11-23 13:52:48,669 INFO L226 Difference]: Without dead ends: 446 [2022-11-23 13:52:48,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-11-23 13:52:48,670 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 87 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:48,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 28 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:52:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-11-23 13:52:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 374. [2022-11-23 13:52:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 2.7640750670241285) internal successors, (1031), 373 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states 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 13:52:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1031 transitions. [2022-11-23 13:52:48,683 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1031 transitions. Word has length 27 [2022-11-23 13:52:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:48,683 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 1031 transitions. [2022-11-23 13:52:48,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 13:52:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1031 transitions. [2022-11-23 13:52:48,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:52:48,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:48,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:48,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 13:52:48,686 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:52:48,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:48,687 INFO L85 PathProgramCache]: Analyzing trace with hash -205357731, now seen corresponding path program 2 times [2022-11-23 13:52:48,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:48,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755912229] [2022-11-23 13:52:48,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:48,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:52:48,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 13:52:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:52:48,899 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 13:52:48,899 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 13:52:48,901 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-23 13:52:48,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-23 13:52:48,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-23 13:52:48,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-23 13:52:48,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-23 13:52:48,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-23 13:52:48,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-23 13:52:48,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-23 13:52:48,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-23 13:52:48,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-23 13:52:48,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-23 13:52:48,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-23 13:52:48,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-23 13:52:48,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-23 13:52:48,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-23 13:52:48,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-23 13:52:48,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 13:52:48,911 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:48,917 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 13:52:48,918 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 13:52:49,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:52:49 BasicIcfg [2022-11-23 13:52:49,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 13:52:49,006 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 13:52:49,007 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 13:52:49,007 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 13:52:49,008 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:22" (3/4) ... [2022-11-23 13:52:49,011 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 13:52:49,011 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 13:52:49,011 INFO L158 Benchmark]: Toolchain (without parser) took 28658.95ms. Allocated memory was 138.4MB in the beginning and 838.9MB in the end (delta: 700.4MB). Free memory was 108.9MB in the beginning and 381.0MB in the end (delta: -272.1MB). Peak memory consumption was 428.0MB. Max. memory is 16.1GB. [2022-11-23 13:52:49,012 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 138.4MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 13:52:49,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 842.32ms. Allocated memory is still 138.4MB. Free memory was 108.9MB in the beginning and 85.1MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 13:52:49,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.14ms. Allocated memory is still 138.4MB. Free memory was 85.1MB in the beginning and 82.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:52:49,013 INFO L158 Benchmark]: Boogie Preprocessor took 50.28ms. Allocated memory is still 138.4MB. Free memory was 82.3MB in the beginning and 80.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:52:49,013 INFO L158 Benchmark]: RCFGBuilder took 1129.94ms. Allocated memory is still 138.4MB. Free memory was 80.2MB in the beginning and 74.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-23 13:52:49,014 INFO L158 Benchmark]: TraceAbstraction took 26516.81ms. Allocated memory was 138.4MB in the beginning and 838.9MB in the end (delta: 700.4MB). Free memory was 72.7MB in the beginning and 382.0MB in the end (delta: -309.3MB). Peak memory consumption was 392.0MB. Max. memory is 16.1GB. [2022-11-23 13:52:49,014 INFO L158 Benchmark]: Witness Printer took 4.41ms. Allocated memory is still 838.9MB. Free memory is still 381.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 13:52:49,016 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 138.4MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 842.32ms. Allocated memory is still 138.4MB. Free memory was 108.9MB in the beginning and 85.1MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.14ms. Allocated memory is still 138.4MB. Free memory was 85.1MB in the beginning and 82.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.28ms. Allocated memory is still 138.4MB. Free memory was 82.3MB in the beginning and 80.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1129.94ms. Allocated memory is still 138.4MB. Free memory was 80.2MB in the beginning and 74.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 26516.81ms. Allocated memory was 138.4MB in the beginning and 838.9MB in the end (delta: 700.4MB). Free memory was 72.7MB in the beginning and 382.0MB in the end (delta: -309.3MB). Peak memory consumption was 392.0MB. Max. memory is 16.1GB. * Witness Printer took 4.41ms. Allocated memory is still 838.9MB. Free memory is still 381.0MB. 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: 8.9s, 159 PlacesBefore, 56 PlacesAfterwards, 148 TransitionsBefore, 44 TransitionsAfterwards, 3552 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 141 TotalNumberOfCompositions, 10130 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5004, independent: 4775, independent conditional: 0, independent unconditional: 4775, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2585, independent: 2503, independent conditional: 0, independent unconditional: 2503, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2585, independent: 2467, independent conditional: 0, independent unconditional: 2467, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 118, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 800, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 717, dependent conditional: 0, dependent unconditional: 717, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5004, independent: 2272, independent conditional: 0, independent unconditional: 2272, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 2585, unknown conditional: 0, unknown unconditional: 2585] , Statistics on independence cache: Total cache size (in pairs): 347, Positive cache size: 320, Positive conditional cache size: 0, Positive unconditional cache size: 320, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t773, ((void *)0), P0, ((void *)0))=-3, t773={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t774, ((void *)0), P1, ((void *)0))=-2, t773={5:0}, t774={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t775, ((void *)0), P2, ((void *)0))=-1, t773={5:0}, t774={6:0}, t775={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] 0 pthread_t t776; [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t776, ((void *)0), P3, ((void *)0))=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] 4 z = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 1 a = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L765] 2 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=1, unknown-#in~expression-unknown=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 847]: 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: 851]: 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 26.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 669 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 669 mSDsluCounter, 321 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1273 IncrementalHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 108 mSDtfsCounter, 1273 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5140occurred in iteration=0, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 3053 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 2111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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 13:52:49,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af --- 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 13:52:51,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 13:52:51,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 13:52:51,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 13:52:51,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 13:52:51,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 13:52:51,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 13:52:51,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 13:52:51,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 13:52:51,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 13:52:51,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 13:52:51,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 13:52:51,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 13:52:51,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 13:52:51,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 13:52:51,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 13:52:51,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 13:52:51,777 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 13:52:51,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 13:52:51,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 13:52:51,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 13:52:51,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 13:52:51,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 13:52:51,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 13:52:51,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 13:52:51,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 13:52:51,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 13:52:51,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 13:52:51,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 13:52:51,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 13:52:51,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 13:52:51,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 13:52:51,810 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 13:52:51,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 13:52:51,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 13:52:51,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 13:52:51,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 13:52:51,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 13:52:51,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 13:52:51,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 13:52:51,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 13:52:51,821 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-23 13:52:51,867 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 13:52:51,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 13:52:51,868 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 13:52:51,868 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 13:52:51,869 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 13:52:51,869 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 13:52:51,870 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 13:52:51,870 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 13:52:51,870 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 13:52:51,870 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 13:52:51,871 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 13:52:51,872 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 13:52:51,872 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 13:52:51,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 13:52:51,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 13:52:51,873 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 13:52:51,873 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 13:52:51,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 13:52:51,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 13:52:51,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 13:52:51,874 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 13:52:51,875 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 13:52:51,875 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 13:52:51,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 13:52:51,875 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 13:52:51,876 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 13:52:51,876 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 13:52:51,876 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 13:52:51,876 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 13:52:51,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 13:52:51,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 13:52:51,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 13:52:51,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:52:51,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 13:52:51,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 13:52:51,878 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-23 13:52:51,878 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 13:52:51,879 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 13:52:51,879 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 13:52:51,879 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_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 -> 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af [2022-11-23 13:52:52,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 13:52:52,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 13:52:52,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 13:52:52,349 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 13:52:52,350 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 13:52:52,352 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2022-11-23 13:52:55,752 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 13:52:56,126 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 13:52:56,127 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2022-11-23 13:52:56,142 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/data/efeb9756d/9765691279f346939818f0c5b5b35783/FLAG24d15a6a6 [2022-11-23 13:52:56,165 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/data/efeb9756d/9765691279f346939818f0c5b5b35783 [2022-11-23 13:52:56,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 13:52:56,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 13:52:56,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 13:52:56,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 13:52:56,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 13:52:56,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:56" (1/1) ... [2022-11-23 13:52:56,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34edbfc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:56, skipping insertion in model container [2022-11-23 13:52:56,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:56" (1/1) ... [2022-11-23 13:52:56,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 13:52:56,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 13:52:56,585 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_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2022-11-23 13:52:56,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:52:56,923 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 13:52:56,943 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2022-11-23 13:52:57,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:52:57,132 INFO L208 MainTranslator]: Completed translation [2022-11-23 13:52:57,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:57 WrapperNode [2022-11-23 13:52:57,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 13:52:57,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 13:52:57,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 13:52:57,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 13:52:57,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:57" (1/1) ... [2022-11-23 13:52:57,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:57" (1/1) ... [2022-11-23 13:52:57,251 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2022-11-23 13:52:57,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 13:52:57,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 13:52:57,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 13:52:57,255 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 13:52:57,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:57" (1/1) ... [2022-11-23 13:52:57,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:57" (1/1) ... [2022-11-23 13:52:57,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:57" (1/1) ... [2022-11-23 13:52:57,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:57" (1/1) ... [2022-11-23 13:52:57,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:57" (1/1) ... [2022-11-23 13:52:57,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:57" (1/1) ... [2022-11-23 13:52:57,327 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:57" (1/1) ... [2022-11-23 13:52:57,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:57" (1/1) ... [2022-11-23 13:52:57,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 13:52:57,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 13:52:57,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 13:52:57,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 13:52:57,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:57" (1/1) ... [2022-11-23 13:52:57,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:52:57,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:52:57,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 13:52:57,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 13:52:57,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 13:52:57,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 13:52:57,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 13:52:57,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 13:52:57,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 13:52:57,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 13:52:57,437 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 13:52:57,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 13:52:57,438 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 13:52:57,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 13:52:57,438 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 13:52:57,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 13:52:57,439 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 13:52:57,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 13:52:57,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 13:52:57,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 13:52:57,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 13:52:57,441 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 13:52:57,721 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 13:52:57,725 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 13:52:58,250 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 13:52:58,494 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 13:52:58,495 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 13:52:58,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:58 BoogieIcfgContainer [2022-11-23 13:52:58,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 13:52:58,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 13:52:58,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 13:52:58,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 13:52:58,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:52:56" (1/3) ... [2022-11-23 13:52:58,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d911b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:58, skipping insertion in model container [2022-11-23 13:52:58,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:57" (2/3) ... [2022-11-23 13:52:58,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d911b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:58, skipping insertion in model container [2022-11-23 13:52:58,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:58" (3/3) ... [2022-11-23 13:52:58,514 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2022-11-23 13:52:58,539 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 13:52:58,540 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-23 13:52:58,540 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 13:52:58,664 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 13:52:58,727 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 13:52:58,752 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 149 transitions, 318 flow [2022-11-23 13:52:58,785 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 149 transitions, 318 flow [2022-11-23 13:52:58,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-11-23 13:52:58,940 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-11-23 13:52:58,941 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 13:52:58,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-23 13:52:58,957 INFO L119 LiptonReduction]: Number of co-enabled transitions 3552 [2022-11-23 13:53:12,419 INFO L134 LiptonReduction]: Checked pairs total: 10106 [2022-11-23 13:53:12,420 INFO L136 LiptonReduction]: Total number of compositions: 142 [2022-11-23 13:53:12,434 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 44 transitions, 108 flow [2022-11-23 13:53:12,862 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 0 states have call successors, (0), 0 states 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 13:53:12,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 13:53:12,901 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;@1b33bf04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 13:53:12,902 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-23 13:53:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 0 states have call successors, (0), 0 states 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 13:53:12,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 13:53:12,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:12,934 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 13:53:12,935 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:12,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:12,945 INFO L85 PathProgramCache]: Analyzing trace with hash 614, now seen corresponding path program 1 times [2022-11-23 13:53:12,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:12,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833976394] [2022-11-23 13:53:12,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:12,968 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 13:53:12,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:12,979 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:12,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:13,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 13:53:13,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:13,113 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 13:53:13,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:13,114 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:13,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833976394] [2022-11-23 13:53:13,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833976394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:13,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:13,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 13:53:13,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163532337] [2022-11-23 13:53:13,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:13,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 13:53:13,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:13,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 13:53:13,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 13:53:13,193 INFO L87 Difference]: Start difference. First operand has 5140 states, 5125 states have (on average 4.099121951219512) internal successors, (21008), 5139 states have internal predecessors, (21008), 0 states have call successors, (0), 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 13:53:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:13,745 INFO L93 Difference]: Finished difference Result 4850 states and 19358 transitions. [2022-11-23 13:53:13,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 13:53:13,749 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 13:53:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:13,811 INFO L225 Difference]: With dead ends: 4850 [2022-11-23 13:53:13,811 INFO L226 Difference]: Without dead ends: 4850 [2022-11-23 13:53:13,812 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 13:53:13,815 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:13,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:53:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4850 states. [2022-11-23 13:53:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4850 to 4850. [2022-11-23 13:53:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4850 states, 4845 states have (on average 3.995459236326109) internal successors, (19358), 4849 states have internal predecessors, (19358), 0 states have call successors, (0), 0 states 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 13:53:14,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4850 states to 4850 states and 19358 transitions. [2022-11-23 13:53:14,363 INFO L78 Accepts]: Start accepts. Automaton has 4850 states and 19358 transitions. Word has length 1 [2022-11-23 13:53:14,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:14,364 INFO L495 AbstractCegarLoop]: Abstraction has 4850 states and 19358 transitions. [2022-11-23 13:53:14,368 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 13:53:14,370 INFO L276 IsEmpty]: Start isEmpty. Operand 4850 states and 19358 transitions. [2022-11-23 13:53:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 13:53:14,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:14,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:14,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:14,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:14,593 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:14,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:14,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1419585818, now seen corresponding path program 1 times [2022-11-23 13:53:14,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:14,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806735858] [2022-11-23 13:53:14,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:14,596 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 13:53:14,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:14,600 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:14,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:14,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 13:53:14,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:14,887 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 13:53:14,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:14,888 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:14,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806735858] [2022-11-23 13:53:14,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806735858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:14,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:14,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 13:53:14,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327091932] [2022-11-23 13:53:14,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:14,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:53:14,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:14,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:53:14,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:53:14,898 INFO L87 Difference]: Start difference. First operand 4850 states and 19358 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 13:53:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:15,174 INFO L93 Difference]: Finished difference Result 3970 states and 15654 transitions. [2022-11-23 13:53:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:53:15,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-23 13:53:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:15,251 INFO L225 Difference]: With dead ends: 3970 [2022-11-23 13:53:15,251 INFO L226 Difference]: Without dead ends: 3850 [2022-11-23 13:53:15,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 13:53:15,252 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:15,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 10 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:53:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2022-11-23 13:53:15,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3850. [2022-11-23 13:53:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3850 states, 3848 states have (on average 3.9625779625779627) internal successors, (15248), 3849 states have internal predecessors, (15248), 0 states have call successors, (0), 0 states 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 13:53:15,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 15248 transitions. [2022-11-23 13:53:15,558 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 15248 transitions. Word has length 7 [2022-11-23 13:53:15,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:15,559 INFO L495 AbstractCegarLoop]: Abstraction has 3850 states and 15248 transitions. [2022-11-23 13:53:15,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 13:53:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 15248 transitions. [2022-11-23 13:53:15,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 13:53:15,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:15,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:15,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:15,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:15,765 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:15,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:15,766 INFO L85 PathProgramCache]: Analyzing trace with hash 121628495, now seen corresponding path program 1 times [2022-11-23 13:53:15,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:15,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390042997] [2022-11-23 13:53:15,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:15,768 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 13:53:15,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:15,770 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:15,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:15,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 13:53:15,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:15,997 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 13:53:15,997 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:15,998 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:15,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390042997] [2022-11-23 13:53:15,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390042997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:15,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:15,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:53:16,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221531594] [2022-11-23 13:53:16,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:16,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:53:16,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:16,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:53:16,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:53:16,002 INFO L87 Difference]: Start difference. First operand 3850 states and 15248 transitions. Second operand has 4 states, 4 states have (on average 2.75) 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 13:53:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:16,332 INFO L93 Difference]: Finished difference Result 3250 states and 11398 transitions. [2022-11-23 13:53:16,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:53:16,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) 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 13:53:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:16,352 INFO L225 Difference]: With dead ends: 3250 [2022-11-23 13:53:16,352 INFO L226 Difference]: Without dead ends: 2650 [2022-11-23 13:53:16,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 13:53:16,354 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:16,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 25 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:53:16,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2022-11-23 13:53:16,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2022-11-23 13:53:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2650 states, 2648 states have (on average 3.4924471299093653) internal successors, (9248), 2649 states have internal predecessors, (9248), 0 states have call successors, (0), 0 states 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 13:53:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 9248 transitions. [2022-11-23 13:53:16,514 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 9248 transitions. Word has length 11 [2022-11-23 13:53:16,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:16,514 INFO L495 AbstractCegarLoop]: Abstraction has 2650 states and 9248 transitions. [2022-11-23 13:53:16,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) 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 13:53:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 9248 transitions. [2022-11-23 13:53:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 13:53:16,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:16,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:16,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:16,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:16,741 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:16,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:16,741 INFO L85 PathProgramCache]: Analyzing trace with hash 773877537, now seen corresponding path program 1 times [2022-11-23 13:53:16,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:16,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394739274] [2022-11-23 13:53:16,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:16,742 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 13:53:16,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:16,744 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:16,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:16,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 13:53:16,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:16,967 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 13:53:16,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:16,968 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:16,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394739274] [2022-11-23 13:53:16,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394739274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:16,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:16,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:53:16,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333381564] [2022-11-23 13:53:16,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:16,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:53:16,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:16,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:53:16,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:53:16,971 INFO L87 Difference]: Start difference. First operand 2650 states and 9248 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:17,318 INFO L93 Difference]: Finished difference Result 1770 states and 5486 transitions. [2022-11-23 13:53:17,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:53:17,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 13:53:17,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:17,330 INFO L225 Difference]: With dead ends: 1770 [2022-11-23 13:53:17,330 INFO L226 Difference]: Without dead ends: 1410 [2022-11-23 13:53:17,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:53:17,332 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 61 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:17,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 45 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:53:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2022-11-23 13:53:17,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2022-11-23 13:53:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1408 states have (on average 3.0454545454545454) internal successors, (4288), 1409 states have internal predecessors, (4288), 0 states have call successors, (0), 0 states 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 13:53:17,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 4288 transitions. [2022-11-23 13:53:17,460 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 4288 transitions. Word has length 14 [2022-11-23 13:53:17,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:17,461 INFO L495 AbstractCegarLoop]: Abstraction has 1410 states and 4288 transitions. [2022-11-23 13:53:17,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:17,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 4288 transitions. [2022-11-23 13:53:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 13:53:17,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:17,467 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 13:53:17,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:17,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:17,681 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:17,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:17,682 INFO L85 PathProgramCache]: Analyzing trace with hash -792573294, now seen corresponding path program 1 times [2022-11-23 13:53:17,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:17,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220996439] [2022-11-23 13:53:17,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:17,683 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 13:53:17,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:17,684 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:17,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:17,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 13:53:17,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:17,951 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 13:53:17,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:17,951 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:17,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220996439] [2022-11-23 13:53:17,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220996439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:17,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:17,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:53:17,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544977739] [2022-11-23 13:53:17,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:17,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:53:17,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:17,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:53:17,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:53:17,955 INFO L87 Difference]: Start difference. First operand 1410 states and 4288 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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 13:53:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:18,430 INFO L93 Difference]: Finished difference Result 1047 states and 3164 transitions. [2022-11-23 13:53:18,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:53:18,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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 13:53:18,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:18,438 INFO L225 Difference]: With dead ends: 1047 [2022-11-23 13:53:18,438 INFO L226 Difference]: Without dead ends: 935 [2022-11-23 13:53:18,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:53:18,440 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 74 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:18,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 80 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 13:53:18,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2022-11-23 13:53:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 935. [2022-11-23 13:53:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 933 states have (on average 3.0685959271168275) internal successors, (2863), 934 states have internal predecessors, (2863), 0 states have call successors, (0), 0 states 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 13:53:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 2863 transitions. [2022-11-23 13:53:18,510 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 2863 transitions. Word has length 18 [2022-11-23 13:53:18,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:18,511 INFO L495 AbstractCegarLoop]: Abstraction has 935 states and 2863 transitions. [2022-11-23 13:53:18,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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 13:53:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 2863 transitions. [2022-11-23 13:53:18,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 13:53:18,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:18,515 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 13:53:18,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:18,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:18,729 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:18,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:18,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1731843369, now seen corresponding path program 1 times [2022-11-23 13:53:18,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:18,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458644566] [2022-11-23 13:53:18,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:18,731 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 13:53:18,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:18,733 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:18,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:18,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 13:53:18,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:19,025 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 13:53:19,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:19,026 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:19,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458644566] [2022-11-23 13:53:19,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458644566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:19,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:19,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:53:19,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873352074] [2022-11-23 13:53:19,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:19,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:53:19,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:19,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:53:19,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:53:19,030 INFO L87 Difference]: Start difference. First operand 935 states and 2863 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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 13:53:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:19,558 INFO L93 Difference]: Finished difference Result 872 states and 2735 transitions. [2022-11-23 13:53:19,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 13:53:19,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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 13:53:19,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:19,563 INFO L225 Difference]: With dead ends: 872 [2022-11-23 13:53:19,564 INFO L226 Difference]: Without dead ends: 855 [2022-11-23 13:53:19,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 13:53:19,565 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 69 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:19,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 120 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 13:53:19,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-11-23 13:53:19,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2022-11-23 13:53:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 853 states have (on average 3.168815943728019) internal successors, (2703), 854 states have internal predecessors, (2703), 0 states have call successors, (0), 0 states 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 13:53:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 2703 transitions. [2022-11-23 13:53:19,601 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 2703 transitions. Word has length 22 [2022-11-23 13:53:19,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:19,602 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 2703 transitions. [2022-11-23 13:53:19,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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 13:53:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 2703 transitions. [2022-11-23 13:53:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:53:19,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:19,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:19,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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)] Ended with exit code 0 [2022-11-23 13:53:19,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:19,821 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:19,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:19,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1211425915, now seen corresponding path program 1 times [2022-11-23 13:53:19,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:19,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140121893] [2022-11-23 13:53:19,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:19,822 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 13:53:19,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:19,824 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:19,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:19,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 13:53:19,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:20,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:20,058 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:20,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140121893] [2022-11-23 13:53:20,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140121893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:20,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:20,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:53:20,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050298246] [2022-11-23 13:53:20,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:20,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:53:20,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:20,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:53:20,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:53:20,061 INFO L87 Difference]: Start difference. First operand 855 states and 2703 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 13:53:20,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:20,282 INFO L93 Difference]: Finished difference Result 1195 states and 3679 transitions. [2022-11-23 13:53:20,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:53:20,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:53:20,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:20,290 INFO L225 Difference]: With dead ends: 1195 [2022-11-23 13:53:20,290 INFO L226 Difference]: Without dead ends: 1195 [2022-11-23 13:53:20,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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 13:53:20,291 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:20,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 22 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:53:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2022-11-23 13:53:20,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1193. [2022-11-23 13:53:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1191 states have (on average 3.08816120906801) internal successors, (3678), 1192 states have internal predecessors, (3678), 0 states have call successors, (0), 0 states 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 13:53:20,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 3678 transitions. [2022-11-23 13:53:20,358 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 3678 transitions. Word has length 27 [2022-11-23 13:53:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:20,358 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 3678 transitions. [2022-11-23 13:53:20,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 13:53:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 3678 transitions. [2022-11-23 13:53:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:53:20,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:20,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:20,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:20,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:20,584 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:20,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:20,585 INFO L85 PathProgramCache]: Analyzing trace with hash -62386329, now seen corresponding path program 2 times [2022-11-23 13:53:20,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:20,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343885054] [2022-11-23 13:53:20,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 13:53:20,586 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 13:53:20,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:20,588 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:20,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:20,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 13:53:20,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:53:20,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 13:53:20,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:21,344 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 13:53:21,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:21,344 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:21,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343885054] [2022-11-23 13:53:21,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1343885054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:21,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:21,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 13:53:21,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844209106] [2022-11-23 13:53:21,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:21,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 13:53:21,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:21,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 13:53:21,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-23 13:53:21,347 INFO L87 Difference]: Start difference. First operand 1193 states and 3678 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 13:53:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:21,680 INFO L93 Difference]: Finished difference Result 1523 states and 4567 transitions. [2022-11-23 13:53:21,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:53:21,681 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:53:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:21,689 INFO L225 Difference]: With dead ends: 1523 [2022-11-23 13:53:21,690 INFO L226 Difference]: Without dead ends: 1523 [2022-11-23 13:53:21,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-23 13:53:21,691 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 116 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:21,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 31 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:53:21,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2022-11-23 13:53:21,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1185. [2022-11-23 13:53:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1183 states have (on average 3.0921386306001692) internal successors, (3658), 1184 states have internal predecessors, (3658), 0 states have call successors, (0), 0 states 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 13:53:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 3658 transitions. [2022-11-23 13:53:21,745 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 3658 transitions. Word has length 27 [2022-11-23 13:53:21,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:21,745 INFO L495 AbstractCegarLoop]: Abstraction has 1185 states and 3658 transitions. [2022-11-23 13:53:21,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 13:53:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 3658 transitions. [2022-11-23 13:53:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:53:21,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:21,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:21,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:21,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:21,972 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:21,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:21,973 INFO L85 PathProgramCache]: Analyzing trace with hash -634401275, now seen corresponding path program 3 times [2022-11-23 13:53:21,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:21,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713955450] [2022-11-23 13:53:21,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:53:21,974 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 13:53:21,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:21,975 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:21,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:22,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 13:53:22,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:53:22,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-23 13:53:22,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:22,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 13:53:22,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:22,753 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 13:53:22,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713955450] [2022-11-23 13:53:22,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713955450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:22,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:22,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 13:53:22,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657014172] [2022-11-23 13:53:22,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:22,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 13:53:22,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 13:53:22,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 13:53:22,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-23 13:53:22,757 INFO L87 Difference]: Start difference. First operand 1185 states and 3658 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 13:53:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:23,047 INFO L93 Difference]: Finished difference Result 1479 states and 4445 transitions. [2022-11-23 13:53:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:53:23,048 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:53:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:23,056 INFO L225 Difference]: With dead ends: 1479 [2022-11-23 13:53:23,056 INFO L226 Difference]: Without dead ends: 1479 [2022-11-23 13:53:23,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-23 13:53:23,057 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 92 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:23,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 31 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:53:23,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2022-11-23 13:53:23,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1161. [2022-11-23 13:53:23,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1159 states have (on average 3.09404659188956) internal successors, (3586), 1160 states have internal predecessors, (3586), 0 states have call successors, (0), 0 states 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 13:53:23,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 3586 transitions. [2022-11-23 13:53:23,121 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 3586 transitions. Word has length 27 [2022-11-23 13:53:23,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:23,122 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 3586 transitions. [2022-11-23 13:53:23,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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 13:53:23,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 3586 transitions. [2022-11-23 13:53:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:53:23,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:23,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:23,147 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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)] Ended with exit code 0 [2022-11-23 13:53:23,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:23,342 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-23 13:53:23,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:23,343 INFO L85 PathProgramCache]: Analyzing trace with hash 702752849, now seen corresponding path program 4 times [2022-11-23 13:53:23,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 13:53:23,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810449482] [2022-11-23 13:53:23,344 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:53:23,344 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 13:53:23,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 13:53:23,346 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:23,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:23,549 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:53:23,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-23 13:53:23,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 13:53:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 13:53:23,762 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-23 13:53:23,762 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 13:53:23,764 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-23 13:53:23,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-23 13:53:23,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-23 13:53:23,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-23 13:53:23,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-23 13:53:23,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-23 13:53:23,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-23 13:53:23,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-23 13:53:23,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-23 13:53:23,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-23 13:53:23,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-23 13:53:23,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-23 13:53:23,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-23 13:53:23,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-23 13:53:23,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-23 13:53:23,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-23 13:53:23,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:23,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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 13:53:23,995 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:24,002 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 13:53:24,002 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 13:53:24,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:53:24 BasicIcfg [2022-11-23 13:53:24,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 13:53:24,207 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 13:53:24,207 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 13:53:24,208 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 13:53:24,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:58" (3/4) ... [2022-11-23 13:53:24,211 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 13:53:24,212 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 13:53:24,212 INFO L158 Benchmark]: Toolchain (without parser) took 28042.25ms. Allocated memory was 71.3MB in the beginning and 419.4MB in the end (delta: 348.1MB). Free memory was 50.4MB in the beginning and 336.2MB in the end (delta: -285.8MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2022-11-23 13:53:24,213 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 71.3MB. Free memory was 49.7MB in the beginning and 49.6MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 13:53:24,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 955.15ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 50.1MB in the beginning and 72.5MB in the end (delta: -22.5MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2022-11-23 13:53:24,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.58ms. Allocated memory is still 96.5MB. Free memory was 72.5MB in the beginning and 69.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:53:24,214 INFO L158 Benchmark]: Boogie Preprocessor took 79.83ms. Allocated memory is still 96.5MB. Free memory was 69.4MB in the beginning and 67.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:53:24,215 INFO L158 Benchmark]: RCFGBuilder took 1165.95ms. Allocated memory is still 96.5MB. Free memory was 67.5MB in the beginning and 54.9MB in the end (delta: 12.5MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2022-11-23 13:53:24,216 INFO L158 Benchmark]: TraceAbstraction took 25704.89ms. Allocated memory was 96.5MB in the beginning and 419.4MB in the end (delta: 323.0MB). Free memory was 54.4MB in the beginning and 337.3MB in the end (delta: -282.9MB). Peak memory consumption was 242.7MB. Max. memory is 16.1GB. [2022-11-23 13:53:24,216 INFO L158 Benchmark]: Witness Printer took 4.62ms. Allocated memory is still 419.4MB. Free memory was 337.3MB in the beginning and 336.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:53:24,219 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.32ms. Allocated memory is still 71.3MB. Free memory was 49.7MB in the beginning and 49.6MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 955.15ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 50.1MB in the beginning and 72.5MB in the end (delta: -22.5MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.58ms. Allocated memory is still 96.5MB. Free memory was 72.5MB in the beginning and 69.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.83ms. Allocated memory is still 96.5MB. Free memory was 69.4MB in the beginning and 67.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1165.95ms. Allocated memory is still 96.5MB. Free memory was 67.5MB in the beginning and 54.9MB in the end (delta: 12.5MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * TraceAbstraction took 25704.89ms. Allocated memory was 96.5MB in the beginning and 419.4MB in the end (delta: 323.0MB). Free memory was 54.4MB in the beginning and 337.3MB in the end (delta: -282.9MB). Peak memory consumption was 242.7MB. Max. memory is 16.1GB. * Witness Printer took 4.62ms. Allocated memory is still 419.4MB. Free memory was 337.3MB in the beginning and 336.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: 13.6s, 160 PlacesBefore, 56 PlacesAfterwards, 149 TransitionsBefore, 44 TransitionsAfterwards, 3552 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 142 TotalNumberOfCompositions, 10106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5163, independent: 4934, independent conditional: 0, independent unconditional: 4934, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2634, independent: 2554, independent conditional: 0, independent unconditional: 2554, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2634, independent: 2506, independent conditional: 0, independent unconditional: 2506, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 128, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 837, independent: 141, independent conditional: 0, independent unconditional: 141, dependent: 696, dependent conditional: 0, dependent unconditional: 696, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5163, independent: 2380, independent conditional: 0, independent unconditional: 2380, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 2634, unknown conditional: 0, unknown unconditional: 2634] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 335, Positive conditional cache size: 0, Positive unconditional cache size: 335, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t773, ((void *)0), P0, ((void *)0))=-1, t773={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t774, ((void *)0), P1, ((void *)0))=0, t773={3:0}, t774={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t775, ((void *)0), P2, ((void *)0))=1, t773={3:0}, t774={7:0}, t775={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t776; [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t776, ((void *)0), P3, ((void *)0))=2, t773={3:0}, t774={7:0}, t775={11:0}, t776={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] 4 z = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L750] 1 a = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={3:0}, t774={7:0}, t775={11:0}, t776={15:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=2, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 849]: 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: 847]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 185 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 25.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 502 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 502 mSDsluCounter, 369 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 253 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1377 IncrementalHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 116 mSDtfsCounter, 1377 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5140occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 658 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 1083 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1318 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 13:53:24,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c63c4aba-91e0-4e71-b6e1-2e4b4f549023/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