./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_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_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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_0d58a210-8579-4cbd-a919-2c666a04d584/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 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3 --- 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 14:36:27,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:36:27,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:36:27,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:36:27,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:36:27,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:36:27,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:36:27,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:36:27,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:36:27,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:36:27,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:36:27,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:36:27,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:36:27,524 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:36:27,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:36:27,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:36:27,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:36:27,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:36:27,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:36:27,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:36:27,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:36:27,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:36:27,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:36:27,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:36:27,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:36:27,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:36:27,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:36:27,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:36:27,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:36:27,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:36:27,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:36:27,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:36:27,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:36:27,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:36:27,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:36:27,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:36:27,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:36:27,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:36:27,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:36:27,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:36:27,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:36:27,577 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-23 14:36:27,617 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:36:27,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:36:27,618 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:36:27,618 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:36:27,619 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:36:27,619 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:36:27,619 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:36:27,620 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:36:27,620 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:36:27,620 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:36:27,621 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:36:27,621 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:36:27,622 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:36:27,622 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:36:27,622 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:36:27,622 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:36:27,623 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:36:27,623 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:36:27,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 14:36:27,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 14:36:27,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:36:27,625 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:36:27,625 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:36:27,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:36:27,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:36:27,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:36:27,626 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 14:36:27,627 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 14:36:27,627 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 14:36:27,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:36:27,627 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 14:36:27,628 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:36:27,628 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:36:27,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:36:27,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:36:27,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:36:27,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:36:27,629 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:36:27,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:36:27,630 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:36:27,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:36:27,630 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:36:27,630 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_0d58a210-8579-4cbd-a919-2c666a04d584/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_0d58a210-8579-4cbd-a919-2c666a04d584/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 -> 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3 [2022-11-23 14:36:27,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:36:27,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:36:27,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:36:27,939 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:36:27,939 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:36:27,941 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2022-11-23 14:36:30,944 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:36:31,255 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:36:31,256 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2022-11-23 14:36:31,269 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/data/7494b511c/3e2c487272d7433991af3d184d9d9d06/FLAG9ed256827 [2022-11-23 14:36:31,284 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/data/7494b511c/3e2c487272d7433991af3d184d9d9d06 [2022-11-23 14:36:31,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:36:31,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:36:31,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:36:31,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:36:31,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:36:31,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:36:31" (1/1) ... [2022-11-23 14:36:31,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68327e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:31, skipping insertion in model container [2022-11-23 14:36:31,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:36:31" (1/1) ... [2022-11-23 14:36:31,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:36:31,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:36:31,547 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_0d58a210-8579-4cbd-a919-2c666a04d584/sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] [2022-11-23 14:36:31,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:36:31,877 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:36:31,892 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_0d58a210-8579-4cbd-a919-2c666a04d584/sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] [2022-11-23 14:36:31,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:36:32,010 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:36:32,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:32 WrapperNode [2022-11-23 14:36:32,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:36:32,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:36:32,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:36:32,013 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:36:32,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:32" (1/1) ... [2022-11-23 14:36:32,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:32" (1/1) ... [2022-11-23 14:36:32,097 INFO L138 Inliner]: procedures = 175, calls = 54, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 120 [2022-11-23 14:36:32,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:36:32,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:36:32,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:36:32,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:36:32,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:32" (1/1) ... [2022-11-23 14:36:32,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:32" (1/1) ... [2022-11-23 14:36:32,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:32" (1/1) ... [2022-11-23 14:36:32,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:32" (1/1) ... [2022-11-23 14:36:32,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:32" (1/1) ... [2022-11-23 14:36:32,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:32" (1/1) ... [2022-11-23 14:36:32,145 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:32" (1/1) ... [2022-11-23 14:36:32,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:32" (1/1) ... [2022-11-23 14:36:32,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:36:32,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:36:32,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:36:32,150 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:36:32,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:32" (1/1) ... [2022-11-23 14:36:32,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:36:32,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:36:32,204 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:36:32,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:36:32,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 14:36:32,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 14:36:32,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 14:36:32,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:36:32,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 14:36:32,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:36:32,248 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 14:36:32,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 14:36:32,248 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 14:36:32,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 14:36:32,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 14:36:32,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 14:36:32,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:36:32,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:36:32,250 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 14:36:32,446 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:36:32,448 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:36:32,948 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:36:33,491 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:36:33,492 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 14:36:33,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:33 BoogieIcfgContainer [2022-11-23 14:36:33,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:36:33,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:36:33,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:36:33,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:36:33,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:36:31" (1/3) ... [2022-11-23 14:36:33,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135a4c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:36:33, skipping insertion in model container [2022-11-23 14:36:33,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:32" (2/3) ... [2022-11-23 14:36:33,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135a4c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:36:33, skipping insertion in model container [2022-11-23 14:36:33,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:33" (3/3) ... [2022-11-23 14:36:33,511 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2022-11-23 14:36:33,530 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:36:33,531 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-23 14:36:33,532 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 14:36:33,637 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 14:36:33,690 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 14:36:33,711 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 142 transitions, 294 flow [2022-11-23 14:36:33,716 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 142 transitions, 294 flow [2022-11-23 14:36:33,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 142 transitions, 294 flow [2022-11-23 14:36:33,830 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2022-11-23 14:36:33,831 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 14:36:33,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 159 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-23 14:36:33,840 INFO L119 LiptonReduction]: Number of co-enabled transitions 3272 [2022-11-23 14:36:52,641 INFO L134 LiptonReduction]: Checked pairs total: 11087 [2022-11-23 14:36:52,642 INFO L136 LiptonReduction]: Total number of compositions: 146 [2022-11-23 14:36:52,650 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 50 transitions, 110 flow [2022-11-23 14:36:52,773 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2542 states, 1696 states have (on average 4.21875) internal successors, (7155), 2541 states have internal predecessors, (7155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:52,793 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:36:52,799 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;@5d0c8b76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:36:52,800 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-11-23 14:36:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 2542 states, 1696 states have (on average 4.21875) internal successors, (7155), 2541 states have internal predecessors, (7155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 14:36:52,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:36:52,814 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 14:36:52,814 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:36:52,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:36:52,819 INFO L85 PathProgramCache]: Analyzing trace with hash 802, now seen corresponding path program 1 times [2022-11-23 14:36:52,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:36:52,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887839135] [2022-11-23 14:36:52,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:36:52,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:36:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:36:52,985 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 14:36:52,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:36:52,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887839135] [2022-11-23 14:36:52,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887839135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:36:52,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:36:52,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 14:36:52,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5090981] [2022-11-23 14:36:52,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:36:52,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 14:36:52,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:36:53,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 14:36:53,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 14:36:53,040 INFO L87 Difference]: Start difference. First operand has 2542 states, 1696 states have (on average 4.21875) internal successors, (7155), 2541 states have internal predecessors, (7155), 0 states have call successors, (0), 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 14:36:53,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:36:53,181 INFO L93 Difference]: Finished difference Result 770 states and 2021 transitions. [2022-11-23 14:36:53,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 14:36:53,189 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 14:36:53,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:36:53,215 INFO L225 Difference]: With dead ends: 770 [2022-11-23 14:36:53,215 INFO L226 Difference]: Without dead ends: 770 [2022-11-23 14:36:53,216 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 14:36:53,221 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:36:53,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:36:53,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-11-23 14:36:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2022-11-23 14:36:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 636 states have (on average 3.1776729559748427) internal successors, (2021), 769 states have internal predecessors, (2021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 2021 transitions. [2022-11-23 14:36:53,334 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 2021 transitions. Word has length 1 [2022-11-23 14:36:53,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:36:53,336 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 2021 transitions. [2022-11-23 14:36:53,343 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 14:36:53,345 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 2021 transitions. [2022-11-23 14:36:53,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 14:36:53,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:36:53,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 14:36:53,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 14:36:53,346 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:36:53,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:36:53,347 INFO L85 PathProgramCache]: Analyzing trace with hash 791796, now seen corresponding path program 1 times [2022-11-23 14:36:53,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:36:53,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139478165] [2022-11-23 14:36:53,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:36:53,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:36:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:36:53,629 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 14:36:53,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:36:53,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139478165] [2022-11-23 14:36:53,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139478165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:36:53,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:36:53,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:36:53,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565813606] [2022-11-23 14:36:53,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:36:53,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:36:53,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:36:53,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:36:53,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:36:53,633 INFO L87 Difference]: Start difference. First operand 770 states and 2021 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:53,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:36:53,751 INFO L93 Difference]: Finished difference Result 545 states and 1298 transitions. [2022-11-23 14:36:53,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:36:53,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 14:36:53,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:36:53,756 INFO L225 Difference]: With dead ends: 545 [2022-11-23 14:36:53,756 INFO L226 Difference]: Without dead ends: 539 [2022-11-23 14:36:53,758 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 14:36:53,759 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:36:53,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:36:53,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-11-23 14:36:53,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 479. [2022-11-23 14:36:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 430 states have (on average 2.7906976744186047) internal successors, (1200), 478 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1200 transitions. [2022-11-23 14:36:53,788 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1200 transitions. Word has length 3 [2022-11-23 14:36:53,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:36:53,788 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 1200 transitions. [2022-11-23 14:36:53,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1200 transitions. [2022-11-23 14:36:53,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 14:36:53,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:36:53,789 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 14:36:53,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 14:36:53,790 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:36:53,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:36:53,791 INFO L85 PathProgramCache]: Analyzing trace with hash 791797, now seen corresponding path program 1 times [2022-11-23 14:36:53,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:36:53,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878858758] [2022-11-23 14:36:53,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:36:53,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:36:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:36:53,998 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 14:36:53,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:36:53,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878858758] [2022-11-23 14:36:53,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878858758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:36:53,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:36:53,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:36:53,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275605966] [2022-11-23 14:36:53,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:36:54,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:36:54,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:36:54,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:36:54,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:36:54,001 INFO L87 Difference]: Start difference. First operand 479 states and 1200 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:36:54,065 INFO L93 Difference]: Finished difference Result 301 states and 711 transitions. [2022-11-23 14:36:54,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:36:54,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 14:36:54,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:36:54,067 INFO L225 Difference]: With dead ends: 301 [2022-11-23 14:36:54,068 INFO L226 Difference]: Without dead ends: 295 [2022-11-23 14:36:54,068 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 14:36:54,069 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:36:54,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:36:54,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-23 14:36:54,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-11-23 14:36:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 277 states have (on average 2.5415162454873648) internal successors, (704), 294 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 704 transitions. [2022-11-23 14:36:54,080 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 704 transitions. Word has length 3 [2022-11-23 14:36:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:36:54,081 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 704 transitions. [2022-11-23 14:36:54,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 704 transitions. [2022-11-23 14:36:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 14:36:54,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:36:54,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:36:54,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 14:36:54,082 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:36:54,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:36:54,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1167171338, now seen corresponding path program 1 times [2022-11-23 14:36:54,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:36:54,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246308593] [2022-11-23 14:36:54,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:36:54,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:36:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:36:54,202 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 14:36:54,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:36:54,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246308593] [2022-11-23 14:36:54,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246308593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:36:54,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:36:54,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:36:54,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79537906] [2022-11-23 14:36:54,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:36:54,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:36:54,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:36:54,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:36:54,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:36:54,205 INFO L87 Difference]: Start difference. First operand 295 states and 704 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 14:36:54,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:36:54,340 INFO L93 Difference]: Finished difference Result 285 states and 676 transitions. [2022-11-23 14:36:54,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:36:54,340 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 14:36:54,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:36:54,342 INFO L225 Difference]: With dead ends: 285 [2022-11-23 14:36:54,342 INFO L226 Difference]: Without dead ends: 285 [2022-11-23 14:36:54,343 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 14:36:54,344 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:36:54,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:36:54,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-23 14:36:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-11-23 14:36:54,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 267 states have (on average 2.5318352059925093) internal successors, (676), 284 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 676 transitions. [2022-11-23 14:36:54,354 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 676 transitions. Word has length 7 [2022-11-23 14:36:54,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:36:54,354 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 676 transitions. [2022-11-23 14:36:54,355 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 14:36:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 676 transitions. [2022-11-23 14:36:54,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 14:36:54,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:36:54,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:36:54,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 14:36:54,356 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:36:54,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:36:54,356 INFO L85 PathProgramCache]: Analyzing trace with hash 276905895, now seen corresponding path program 1 times [2022-11-23 14:36:54,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:36:54,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033886170] [2022-11-23 14:36:54,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:36:54,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:36:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:36:54,587 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 14:36:54,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:36:54,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033886170] [2022-11-23 14:36:54,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033886170] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:36:54,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:36:54,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:36:54,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942040981] [2022-11-23 14:36:54,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:36:54,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:36:54,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:36:54,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:36:54,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:36:54,597 INFO L87 Difference]: Start difference. First operand 285 states and 676 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:54,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:36:54,721 INFO L93 Difference]: Finished difference Result 270 states and 639 transitions. [2022-11-23 14:36:54,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:36:54,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-23 14:36:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:36:54,723 INFO L225 Difference]: With dead ends: 270 [2022-11-23 14:36:54,723 INFO L226 Difference]: Without dead ends: 270 [2022-11-23 14:36:54,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:36:54,724 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:36:54,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:36:54,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-23 14:36:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-11-23 14:36:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 253 states have (on average 2.525691699604743) internal successors, (639), 269 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 639 transitions. [2022-11-23 14:36:54,735 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 639 transitions. Word has length 8 [2022-11-23 14:36:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:36:54,736 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 639 transitions. [2022-11-23 14:36:54,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 639 transitions. [2022-11-23 14:36:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 14:36:54,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:36:54,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:36:54,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 14:36:54,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:36:54,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:36:54,738 INFO L85 PathProgramCache]: Analyzing trace with hash 276905889, now seen corresponding path program 1 times [2022-11-23 14:36:54,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:36:54,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069564772] [2022-11-23 14:36:54,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:36:54,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:36:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:36:55,218 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 14:36:55,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:36:55,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069564772] [2022-11-23 14:36:55,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069564772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:36:55,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:36:55,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:36:55,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982329314] [2022-11-23 14:36:55,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:36:55,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:36:55,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:36:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:36:55,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:36:55,222 INFO L87 Difference]: Start difference. First operand 270 states and 639 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:55,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:36:55,356 INFO L93 Difference]: Finished difference Result 255 states and 602 transitions. [2022-11-23 14:36:55,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:36:55,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-23 14:36:55,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:36:55,359 INFO L225 Difference]: With dead ends: 255 [2022-11-23 14:36:55,359 INFO L226 Difference]: Without dead ends: 255 [2022-11-23 14:36:55,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:36:55,360 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:36:55,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 2 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:36:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-23 14:36:55,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-11-23 14:36:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 239 states have (on average 2.518828451882845) internal successors, (602), 254 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 602 transitions. [2022-11-23 14:36:55,373 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 602 transitions. Word has length 8 [2022-11-23 14:36:55,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:36:55,373 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 602 transitions. [2022-11-23 14:36:55,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 602 transitions. [2022-11-23 14:36:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 14:36:55,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:36:55,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:36:55,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 14:36:55,376 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:36:55,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:36:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1822573824, now seen corresponding path program 1 times [2022-11-23 14:36:55,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:36:55,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432393612] [2022-11-23 14:36:55,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:36:55,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:36:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:36:55,699 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 14:36:55,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:36:55,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432393612] [2022-11-23 14:36:55,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432393612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:36:55,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:36:55,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:36:55,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190696875] [2022-11-23 14:36:55,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:36:55,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:36:55,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:36:55,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:36:55,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:36:55,701 INFO L87 Difference]: Start difference. First operand 255 states and 602 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:36:55,790 INFO L93 Difference]: Finished difference Result 254 states and 599 transitions. [2022-11-23 14:36:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:36:55,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-23 14:36:55,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:36:55,792 INFO L225 Difference]: With dead ends: 254 [2022-11-23 14:36:55,792 INFO L226 Difference]: Without dead ends: 254 [2022-11-23 14:36:55,793 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 14:36:55,793 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:36:55,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:36:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-23 14:36:55,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2022-11-23 14:36:55,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 238 states have (on average 2.5168067226890756) internal successors, (599), 253 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:55,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 599 transitions. [2022-11-23 14:36:55,802 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 599 transitions. Word has length 8 [2022-11-23 14:36:55,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:36:55,802 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 599 transitions. [2022-11-23 14:36:55,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:55,803 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 599 transitions. [2022-11-23 14:36:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 14:36:55,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:36:55,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:36:55,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 14:36:55,804 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:36:55,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:36:55,804 INFO L85 PathProgramCache]: Analyzing trace with hash -5851133, now seen corresponding path program 1 times [2022-11-23 14:36:55,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:36:55,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453063753] [2022-11-23 14:36:55,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:36:55,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:36:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:36:56,024 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 14:36:56,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:36:56,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453063753] [2022-11-23 14:36:56,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453063753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:36:56,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:36:56,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:36:56,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490130433] [2022-11-23 14:36:56,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:36:56,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:36:56,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:36:56,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:36:56,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:36:56,028 INFO L87 Difference]: Start difference. First operand 254 states and 599 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:36:56,097 INFO L93 Difference]: Finished difference Result 251 states and 591 transitions. [2022-11-23 14:36:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:36:56,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 14:36:56,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:36:56,099 INFO L225 Difference]: With dead ends: 251 [2022-11-23 14:36:56,100 INFO L226 Difference]: Without dead ends: 251 [2022-11-23 14:36:56,100 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 14:36:56,104 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:36:56,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 6 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:36:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-23 14:36:56,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-11-23 14:36:56,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 235 states have (on average 2.5148936170212766) internal successors, (591), 250 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 591 transitions. [2022-11-23 14:36:56,114 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 591 transitions. Word has length 9 [2022-11-23 14:36:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:36:56,114 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 591 transitions. [2022-11-23 14:36:56,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 591 transitions. [2022-11-23 14:36:56,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 14:36:56,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:36:56,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:36:56,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 14:36:56,117 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:36:56,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:36:56,117 INFO L85 PathProgramCache]: Analyzing trace with hash 665132942, now seen corresponding path program 1 times [2022-11-23 14:36:56,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:36:56,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536588907] [2022-11-23 14:36:56,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:36:56,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:36:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:36:56,402 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 14:36:56,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:36:56,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536588907] [2022-11-23 14:36:56,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536588907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:36:56,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:36:56,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:36:56,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519904286] [2022-11-23 14:36:56,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:36:56,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:36:56,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:36:56,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:36:56,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:36:56,405 INFO L87 Difference]: Start difference. First operand 251 states and 591 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:36:56,520 INFO L93 Difference]: Finished difference Result 247 states and 580 transitions. [2022-11-23 14:36:56,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:36:56,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 14:36:56,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:36:56,523 INFO L225 Difference]: With dead ends: 247 [2022-11-23 14:36:56,523 INFO L226 Difference]: Without dead ends: 247 [2022-11-23 14:36:56,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:36:56,524 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 36 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:36:56,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 2 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:36:56,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-11-23 14:36:56,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2022-11-23 14:36:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 231 states have (on average 2.5108225108225106) internal successors, (580), 246 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:56,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 580 transitions. [2022-11-23 14:36:56,533 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 580 transitions. Word has length 9 [2022-11-23 14:36:56,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:36:56,533 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 580 transitions. [2022-11-23 14:36:56,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:56,533 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 580 transitions. [2022-11-23 14:36:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 14:36:56,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:36:56,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:36:56,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 14:36:56,535 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:36:56,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:36:56,535 INFO L85 PathProgramCache]: Analyzing trace with hash -181465877, now seen corresponding path program 1 times [2022-11-23 14:36:56,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:36:56,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551297786] [2022-11-23 14:36:56,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:36:56,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:36:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:36:56,728 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 14:36:56,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:36:56,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551297786] [2022-11-23 14:36:56,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551297786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:36:56,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:36:56,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:36:56,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496510207] [2022-11-23 14:36:56,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:36:56,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:36:56,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:36:56,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:36:56,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:36:56,731 INFO L87 Difference]: Start difference. First operand 247 states and 580 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:56,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:36:56,828 INFO L93 Difference]: Finished difference Result 321 states and 734 transitions. [2022-11-23 14:36:56,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:36:56,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 14:36:56,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:36:56,830 INFO L225 Difference]: With dead ends: 321 [2022-11-23 14:36:56,831 INFO L226 Difference]: Without dead ends: 321 [2022-11-23 14:36:56,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:36:56,831 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 46 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:36:56,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 7 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:36:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-11-23 14:36:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 267. [2022-11-23 14:36:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 251 states have (on average 2.4820717131474104) internal successors, (623), 266 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 623 transitions. [2022-11-23 14:36:56,841 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 623 transitions. Word has length 10 [2022-11-23 14:36:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:36:56,841 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 623 transitions. [2022-11-23 14:36:56,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 623 transitions. [2022-11-23 14:36:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 14:36:56,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:36:56,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:36:56,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 14:36:56,843 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:36:56,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:36:56,844 INFO L85 PathProgramCache]: Analyzing trace with hash -853182243, now seen corresponding path program 1 times [2022-11-23 14:36:56,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:36:56,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933521588] [2022-11-23 14:36:56,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:36:56,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:36:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:36:57,046 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 14:36:57,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:36:57,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933521588] [2022-11-23 14:36:57,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933521588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:36:57,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:36:57,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:36:57,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262195408] [2022-11-23 14:36:57,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:36:57,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:36:57,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:36:57,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:36:57,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:36:57,049 INFO L87 Difference]: Start difference. First operand 267 states and 623 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:57,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:36:57,139 INFO L93 Difference]: Finished difference Result 274 states and 565 transitions. [2022-11-23 14:36:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:36:57,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 14:36:57,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:36:57,141 INFO L225 Difference]: With dead ends: 274 [2022-11-23 14:36:57,141 INFO L226 Difference]: Without dead ends: 274 [2022-11-23 14:36:57,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:36:57,142 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:36:57,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 5 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:36:57,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-23 14:36:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 234. [2022-11-23 14:36:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 218 states have (on average 2.293577981651376) internal successors, (500), 233 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 500 transitions. [2022-11-23 14:36:57,150 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 500 transitions. Word has length 10 [2022-11-23 14:36:57,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:36:57,150 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 500 transitions. [2022-11-23 14:36:57,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:57,151 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 500 transitions. [2022-11-23 14:36:57,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 14:36:57,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:36:57,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:36:57,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 14:36:57,152 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:36:57,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:36:57,153 INFO L85 PathProgramCache]: Analyzing trace with hash -853182202, now seen corresponding path program 1 times [2022-11-23 14:36:57,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:36:57,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292014281] [2022-11-23 14:36:57,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:36:57,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:36:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:36:57,342 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 14:36:57,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:36:57,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292014281] [2022-11-23 14:36:57,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292014281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:36:57,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:36:57,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:36:57,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795652524] [2022-11-23 14:36:57,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:36:57,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:36:57,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:36:57,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:36:57,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:36:57,346 INFO L87 Difference]: Start difference. First operand 234 states and 500 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:36:57,467 INFO L93 Difference]: Finished difference Result 181 states and 392 transitions. [2022-11-23 14:36:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:36:57,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 14:36:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:36:57,469 INFO L225 Difference]: With dead ends: 181 [2022-11-23 14:36:57,469 INFO L226 Difference]: Without dead ends: 151 [2022-11-23 14:36:57,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:36:57,470 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:36:57,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 10 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:36:57,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-23 14:36:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-23 14:36:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 143 states have (on average 2.125874125874126) internal successors, (304), 150 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 304 transitions. [2022-11-23 14:36:57,475 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 304 transitions. Word has length 10 [2022-11-23 14:36:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:36:57,475 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 304 transitions. [2022-11-23 14:36:57,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 304 transitions. [2022-11-23 14:36:57,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 14:36:57,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:36:57,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:36:57,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 14:36:57,476 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:36:57,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:36:57,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1332313314, now seen corresponding path program 1 times [2022-11-23 14:36:57,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:36:57,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343852315] [2022-11-23 14:36:57,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:36:57,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:36:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:36:58,388 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 14:36:58,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:36:58,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343852315] [2022-11-23 14:36:58,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343852315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:36:58,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:36:58,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:36:58,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892192895] [2022-11-23 14:36:58,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:36:58,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 14:36:58,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:36:58,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 14:36:58,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:36:58,392 INFO L87 Difference]: Start difference. First operand 151 states and 304 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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 14:36:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:36:58,712 INFO L93 Difference]: Finished difference Result 202 states and 421 transitions. [2022-11-23 14:36:58,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:36:58,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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 14:36:58,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:36:58,715 INFO L225 Difference]: With dead ends: 202 [2022-11-23 14:36:58,715 INFO L226 Difference]: Without dead ends: 202 [2022-11-23 14:36:58,715 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 14:36:58,716 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:36:58,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 10 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:36:58,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-23 14:36:58,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 172. [2022-11-23 14:36:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 164 states have (on average 2.152439024390244) internal successors, (353), 171 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:36:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 353 transitions. [2022-11-23 14:36:58,725 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 353 transitions. Word has length 11 [2022-11-23 14:36:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:36:58,725 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 353 transitions. [2022-11-23 14:36:58,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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 14:36:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 353 transitions. [2022-11-23 14:36:58,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 14:36:58,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:36:58,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:36:58,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 14:36:58,727 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:36:58,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:36:58,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1716320910, now seen corresponding path program 2 times [2022-11-23 14:36:58,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:36:58,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301024544] [2022-11-23 14:36:58,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:36:58,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:36:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:36:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:36:59,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:36:59,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301024544] [2022-11-23 14:36:59,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301024544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:36:59,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:36:59,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:36:59,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328629710] [2022-11-23 14:36:59,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:36:59,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 14:36:59,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:36:59,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 14:36:59,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:36:59,767 INFO L87 Difference]: Start difference. First operand 172 states and 353 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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 14:37:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:37:00,094 INFO L93 Difference]: Finished difference Result 173 states and 350 transitions. [2022-11-23 14:37:00,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 14:37:00,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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 14:37:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:37:00,096 INFO L225 Difference]: With dead ends: 173 [2022-11-23 14:37:00,096 INFO L226 Difference]: Without dead ends: 173 [2022-11-23 14:37:00,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-23 14:37:00,097 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 44 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:37:00,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 9 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:37:00,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-11-23 14:37:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 149. [2022-11-23 14:37:00,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 141 states have (on average 2.120567375886525) internal successors, (299), 148 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 299 transitions. [2022-11-23 14:37:00,102 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 299 transitions. Word has length 11 [2022-11-23 14:37:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:37:00,102 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 299 transitions. [2022-11-23 14:37:00,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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 14:37:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 299 transitions. [2022-11-23 14:37:00,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 14:37:00,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:37:00,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:37:00,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 14:37:00,105 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:37:00,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:37:00,106 INFO L85 PathProgramCache]: Analyzing trace with hash -678842632, now seen corresponding path program 1 times [2022-11-23 14:37:00,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:37:00,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554266527] [2022-11-23 14:37:00,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:00,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:37:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:37:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:37:00,179 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:37:00,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554266527] [2022-11-23 14:37:00,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554266527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:37:00,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:37:00,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:37:00,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098116861] [2022-11-23 14:37:00,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:37:00,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:37:00,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:37:00,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:37:00,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:37:00,181 INFO L87 Difference]: Start difference. First operand 149 states and 299 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 14:37:00,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:37:00,247 INFO L93 Difference]: Finished difference Result 140 states and 289 transitions. [2022-11-23 14:37:00,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:37:00,248 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 14:37:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:37:00,248 INFO L225 Difference]: With dead ends: 140 [2022-11-23 14:37:00,248 INFO L226 Difference]: Without dead ends: 56 [2022-11-23 14:37:00,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:37:00,249 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:37:00,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:37:00,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-23 14:37:00,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-23 14:37:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 55 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 105 transitions. [2022-11-23 14:37:00,252 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 105 transitions. Word has length 11 [2022-11-23 14:37:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:37:00,252 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 105 transitions. [2022-11-23 14:37:00,252 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 14:37:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 105 transitions. [2022-11-23 14:37:00,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 14:37:00,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:37:00,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:37:00,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 14:37:00,253 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:37:00,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:37:00,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1647828539, now seen corresponding path program 1 times [2022-11-23 14:37:00,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:37:00,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030075964] [2022-11-23 14:37:00,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:00,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:37:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:37:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:37:00,479 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:37:00,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030075964] [2022-11-23 14:37:00,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030075964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:37:00,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:37:00,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:37:00,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856232112] [2022-11-23 14:37:00,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:37:00,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:37:00,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:37:00,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:37:00,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:37:00,485 INFO L87 Difference]: Start difference. First operand 56 states and 105 transitions. Second operand has 4 states, 4 states have (on average 3.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 14:37:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:37:00,562 INFO L93 Difference]: Finished difference Result 54 states and 88 transitions. [2022-11-23 14:37:00,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:37:00,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.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 14:37:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:37:00,563 INFO L225 Difference]: With dead ends: 54 [2022-11-23 14:37:00,563 INFO L226 Difference]: Without dead ends: 42 [2022-11-23 14:37:00,563 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 14:37:00,564 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:37:00,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:37:00,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-23 14:37:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-23 14:37:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 41 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 67 transitions. [2022-11-23 14:37:00,566 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 67 transitions. Word has length 12 [2022-11-23 14:37:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:37:00,566 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 67 transitions. [2022-11-23 14:37:00,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.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 14:37:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 67 transitions. [2022-11-23 14:37:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 14:37:00,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:37:00,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:37:00,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 14:37:00,567 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:37:00,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:37:00,567 INFO L85 PathProgramCache]: Analyzing trace with hash 859973882, now seen corresponding path program 1 times [2022-11-23 14:37:00,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:37:00,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311995077] [2022-11-23 14:37:00,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:00,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:37:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:37:00,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 14:37:00,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:37:00,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311995077] [2022-11-23 14:37:00,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311995077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:37:00,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:37:00,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:37:00,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46423435] [2022-11-23 14:37:00,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:37:00,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:37:00,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:37:00,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:37:00,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:37:00,805 INFO L87 Difference]: Start difference. First operand 42 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:37:00,881 INFO L93 Difference]: Finished difference Result 35 states and 51 transitions. [2022-11-23 14:37:00,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:37:00,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 14:37:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:37:00,882 INFO L225 Difference]: With dead ends: 35 [2022-11-23 14:37:00,882 INFO L226 Difference]: Without dead ends: 29 [2022-11-23 14:37:00,883 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 14:37:00,883 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:37:00,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 7 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:37:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-23 14:37:00,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-23 14:37:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:00,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-11-23 14:37:00,885 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 13 [2022-11-23 14:37:00,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:37:00,885 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2022-11-23 14:37:00,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2022-11-23 14:37:00,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 14:37:00,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:37:00,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:37:00,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-23 14:37:00,886 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:37:00,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:37:00,886 INFO L85 PathProgramCache]: Analyzing trace with hash -961606168, now seen corresponding path program 1 times [2022-11-23 14:37:00,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:37:00,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061623567] [2022-11-23 14:37:00,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:00,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:37:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 14:37:00,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 14:37:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 14:37:01,066 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 14:37:01,066 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 14:37:01,067 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (49 of 50 remaining) [2022-11-23 14:37:01,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2022-11-23 14:37:01,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2022-11-23 14:37:01,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2022-11-23 14:37:01,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2022-11-23 14:37:01,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2022-11-23 14:37:01,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2022-11-23 14:37:01,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2022-11-23 14:37:01,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2022-11-23 14:37:01,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2022-11-23 14:37:01,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2022-11-23 14:37:01,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2022-11-23 14:37:01,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2022-11-23 14:37:01,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2022-11-23 14:37:01,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2022-11-23 14:37:01,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2022-11-23 14:37:01,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2022-11-23 14:37:01,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2022-11-23 14:37:01,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2022-11-23 14:37:01,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2022-11-23 14:37:01,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2022-11-23 14:37:01,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2022-11-23 14:37:01,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2022-11-23 14:37:01,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2022-11-23 14:37:01,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2022-11-23 14:37:01,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 50 remaining) [2022-11-23 14:37:01,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 50 remaining) [2022-11-23 14:37:01,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2022-11-23 14:37:01,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2022-11-23 14:37:01,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (20 of 50 remaining) [2022-11-23 14:37:01,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2022-11-23 14:37:01,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2022-11-23 14:37:01,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2022-11-23 14:37:01,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2022-11-23 14:37:01,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2022-11-23 14:37:01,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2022-11-23 14:37:01,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2022-11-23 14:37:01,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2022-11-23 14:37:01,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2022-11-23 14:37:01,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2022-11-23 14:37:01,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2022-11-23 14:37:01,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2022-11-23 14:37:01,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2022-11-23 14:37:01,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2022-11-23 14:37:01,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2022-11-23 14:37:01,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2022-11-23 14:37:01,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2022-11-23 14:37:01,083 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2022-11-23 14:37:01,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2022-11-23 14:37:01,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2022-11-23 14:37:01,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 14:37:01,087 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:37:01,094 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 14:37:01,094 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 14:37:01,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:37:01 BasicIcfg [2022-11-23 14:37:01,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 14:37:01,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 14:37:01,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 14:37:01,189 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 14:37:01,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:33" (3/4) ... [2022-11-23 14:37:01,193 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 14:37:01,193 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 14:37:01,194 INFO L158 Benchmark]: Toolchain (without parser) took 29905.59ms. Allocated memory was 157.3MB in the beginning and 337.6MB in the end (delta: 180.4MB). Free memory was 122.2MB in the beginning and 205.8MB in the end (delta: -83.6MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. [2022-11-23 14:37:01,195 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory was 97.9MB in the beginning and 97.8MB in the end (delta: 141.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:37:01,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 722.13ms. Allocated memory is still 157.3MB. Free memory was 121.7MB in the beginning and 99.8MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-23 14:37:01,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.87ms. Allocated memory is still 157.3MB. Free memory was 99.3MB in the beginning and 97.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:37:01,197 INFO L158 Benchmark]: Boogie Preprocessor took 51.69ms. Allocated memory is still 157.3MB. Free memory was 97.1MB in the beginning and 95.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:37:01,197 INFO L158 Benchmark]: RCFGBuilder took 1347.79ms. Allocated memory is still 157.3MB. Free memory was 95.0MB in the beginning and 66.4MB in the end (delta: 28.7MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2022-11-23 14:37:01,198 INFO L158 Benchmark]: TraceAbstraction took 27687.61ms. Allocated memory was 157.3MB in the beginning and 337.6MB in the end (delta: 180.4MB). Free memory was 65.4MB in the beginning and 205.8MB in the end (delta: -140.4MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2022-11-23 14:37:01,198 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 337.6MB. Free memory is still 205.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:37:01,205 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.17ms. Allocated memory is still 130.0MB. Free memory was 97.9MB in the beginning and 97.8MB in the end (delta: 141.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 722.13ms. Allocated memory is still 157.3MB. Free memory was 121.7MB in the beginning and 99.8MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.87ms. Allocated memory is still 157.3MB. Free memory was 99.3MB in the beginning and 97.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.69ms. Allocated memory is still 157.3MB. Free memory was 97.1MB in the beginning and 95.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1347.79ms. Allocated memory is still 157.3MB. Free memory was 95.0MB in the beginning and 66.4MB in the end (delta: 28.7MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * TraceAbstraction took 27687.61ms. Allocated memory was 157.3MB in the beginning and 337.6MB in the end (delta: 180.4MB). Free memory was 65.4MB in the beginning and 205.8MB in the end (delta: -140.4MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 337.6MB. Free memory is still 205.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.9s, 147 PlacesBefore, 56 PlacesAfterwards, 142 TransitionsBefore, 50 TransitionsAfterwards, 3272 CoEnabledTransitionPairs, 8 FixpointIterations, 64 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 146 TotalNumberOfCompositions, 11087 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4417, independent: 4140, independent conditional: 0, independent unconditional: 4140, dependent: 270, dependent conditional: 0, dependent unconditional: 270, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2035, independent: 1977, independent conditional: 0, independent unconditional: 1977, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2035, independent: 1832, independent conditional: 0, independent unconditional: 1832, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 203, independent: 145, independent conditional: 0, independent unconditional: 145, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1068, independent: 632, independent conditional: 0, independent unconditional: 632, dependent: 342, dependent conditional: 0, dependent unconditional: 342, unknown: 95, unknown conditional: 0, unknown unconditional: 95] ], Cache Queries: [ total: 4417, independent: 2163, independent conditional: 0, independent unconditional: 2163, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 2039, unknown conditional: 0, unknown unconditional: 2039] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 190, Positive conditional cache size: 0, Positive unconditional cache size: 190, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1929; [L813] FCALL, FORK 0 pthread_create(&t1929, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1929, ((void *)0), P0, ((void *)0))=-1, t1929={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] EXPR 1 \read(y) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] EXPR 1 \read(y) [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L814] 0 pthread_t t1930; [L815] FCALL, FORK 0 pthread_create(&t1930, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1930, ((void *)0), P1, ((void *)0))=0, t1929={6:0}, t1930={5:0}, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L772] 1 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L784] 2 __unbuffered_p1_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L787] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 \read(y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] 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) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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 [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 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}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 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) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929={6:0}, t1930={5:0}, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L832] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, weak$$choice0=1, weak$$choice1=255, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 815]: 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: 813]: 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 5 procedures, 176 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 27.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 19.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 963 IncrementalHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 45 mSDtfsCounter, 963 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2542occurred in iteration=0, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 208 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 1219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 14:37:01,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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_0d58a210-8579-4cbd-a919-2c666a04d584/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 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3 --- 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 14:37:03,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:37:03,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:37:03,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:37:03,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:37:03,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:37:03,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:37:03,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:37:03,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:37:03,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:37:03,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:37:03,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:37:03,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:37:03,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:37:03,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:37:03,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:37:03,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:37:03,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:37:03,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:37:03,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:37:03,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:37:03,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:37:03,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:37:03,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:37:03,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:37:03,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:37:03,739 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:37:03,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:37:03,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:37:03,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:37:03,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:37:03,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:37:03,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:37:03,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:37:03,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:37:03,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:37:03,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:37:03,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:37:03,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:37:03,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:37:03,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:37:03,758 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-23 14:37:03,806 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:37:03,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:37:03,808 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:37:03,808 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:37:03,809 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:37:03,810 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:37:03,810 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:37:03,810 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:37:03,810 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:37:03,811 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:37:03,812 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:37:03,812 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:37:03,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 14:37:03,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 14:37:03,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:37:03,814 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:37:03,815 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:37:03,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:37:03,815 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:37:03,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:37:03,816 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 14:37:03,816 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 14:37:03,816 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 14:37:03,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:37:03,817 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 14:37:03,817 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 14:37:03,817 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 14:37:03,818 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:37:03,818 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:37:03,818 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:37:03,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 14:37:03,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:37:03,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:37:03,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:37:03,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:37:03,820 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-23 14:37:03,820 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 14:37:03,821 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:37:03,821 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 14:37:03,821 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_0d58a210-8579-4cbd-a919-2c666a04d584/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_0d58a210-8579-4cbd-a919-2c666a04d584/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 -> 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3 [2022-11-23 14:37:04,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:37:04,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:37:04,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:37:04,248 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:37:04,249 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:37:04,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2022-11-23 14:37:07,473 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:37:07,847 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:37:07,857 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2022-11-23 14:37:07,882 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/data/38965e4ac/d58859f3dbd94e89b363f21723e97674/FLAG3abca86e3 [2022-11-23 14:37:07,901 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/data/38965e4ac/d58859f3dbd94e89b363f21723e97674 [2022-11-23 14:37:07,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:37:07,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:37:07,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:37:07,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:37:07,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:37:07,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:37:07" (1/1) ... [2022-11-23 14:37:07,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25aac083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:07, skipping insertion in model container [2022-11-23 14:37:07,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:37:07" (1/1) ... [2022-11-23 14:37:07,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:37:07,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:37:08,159 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_0d58a210-8579-4cbd-a919-2c666a04d584/sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] [2022-11-23 14:37:08,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:37:08,387 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:37:08,400 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_0d58a210-8579-4cbd-a919-2c666a04d584/sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] [2022-11-23 14:37:08,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:37:08,477 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:37:08,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:08 WrapperNode [2022-11-23 14:37:08,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:37:08,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:37:08,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:37:08,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:37:08,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:08" (1/1) ... [2022-11-23 14:37:08,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:08" (1/1) ... [2022-11-23 14:37:08,556 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2022-11-23 14:37:08,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:37:08,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:37:08,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:37:08,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:37:08,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:08" (1/1) ... [2022-11-23 14:37:08,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:08" (1/1) ... [2022-11-23 14:37:08,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:08" (1/1) ... [2022-11-23 14:37:08,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:08" (1/1) ... [2022-11-23 14:37:08,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:08" (1/1) ... [2022-11-23 14:37:08,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:08" (1/1) ... [2022-11-23 14:37:08,619 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:08" (1/1) ... [2022-11-23 14:37:08,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:08" (1/1) ... [2022-11-23 14:37:08,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:37:08,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:37:08,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:37:08,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:37:08,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:08" (1/1) ... [2022-11-23 14:37:08,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:37:08,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:37:08,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:37:08,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:37:08,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-23 14:37:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 14:37:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:37:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 14:37:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:37:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 14:37:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 14:37:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-23 14:37:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 14:37:08,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 14:37:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 14:37:08,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 14:37:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 14:37:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:37:08,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:37:08,728 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 14:37:09,027 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:37:09,029 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:37:09,615 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:37:10,255 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:37:10,256 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 14:37:10,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:37:10 BoogieIcfgContainer [2022-11-23 14:37:10,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:37:10,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:37:10,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:37:10,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:37:10,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:37:07" (1/3) ... [2022-11-23 14:37:10,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d6a0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:37:10, skipping insertion in model container [2022-11-23 14:37:10,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:08" (2/3) ... [2022-11-23 14:37:10,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d6a0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:37:10, skipping insertion in model container [2022-11-23 14:37:10,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:37:10" (3/3) ... [2022-11-23 14:37:10,271 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2022-11-23 14:37:10,292 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:37:10,292 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-23 14:37:10,293 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 14:37:10,409 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 14:37:10,456 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 14:37:10,483 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 143 transitions, 296 flow [2022-11-23 14:37:10,488 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 143 transitions, 296 flow [2022-11-23 14:37:10,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 143 transitions, 296 flow [2022-11-23 14:37:10,590 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2022-11-23 14:37:10,590 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 14:37:10,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 159 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-23 14:37:10,600 INFO L119 LiptonReduction]: Number of co-enabled transitions 3272 [2022-11-23 14:37:39,565 INFO L134 LiptonReduction]: Checked pairs total: 10940 [2022-11-23 14:37:39,565 INFO L136 LiptonReduction]: Total number of compositions: 143 [2022-11-23 14:37:39,573 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 50 transitions, 110 flow [2022-11-23 14:37:39,703 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2542 states, 1696 states have (on average 4.21875) internal successors, (7155), 2541 states have internal predecessors, (7155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:39,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:37:39,729 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;@1dc156b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:37:39,729 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-11-23 14:37:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 2542 states, 1696 states have (on average 4.21875) internal successors, (7155), 2541 states have internal predecessors, (7155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 14:37:39,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:37:39,743 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 14:37:39,743 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:37:39,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:37:39,748 INFO L85 PathProgramCache]: Analyzing trace with hash 801, now seen corresponding path program 1 times [2022-11-23 14:37:39,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:37:39,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783210456] [2022-11-23 14:37:39,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:39,763 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 14:37:39,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:37:39,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:39,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:37:39,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 14:37:39,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:37:39,893 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 14:37:39,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:37:39,894 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:37:39,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783210456] [2022-11-23 14:37:39,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783210456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:37:39,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:37:39,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 14:37:39,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571975162] [2022-11-23 14:37:39,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:37:39,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 14:37:39,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:37:39,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 14:37:39,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 14:37:39,935 INFO L87 Difference]: Start difference. First operand has 2542 states, 1696 states have (on average 4.21875) internal successors, (7155), 2541 states have internal predecessors, (7155), 0 states have call successors, (0), 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 14:37:40,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:37:40,205 INFO L93 Difference]: Finished difference Result 770 states and 2021 transitions. [2022-11-23 14:37:40,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 14:37:40,207 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 14:37:40,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:37:40,228 INFO L225 Difference]: With dead ends: 770 [2022-11-23 14:37:40,229 INFO L226 Difference]: Without dead ends: 770 [2022-11-23 14:37:40,230 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 14:37:40,233 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:37:40,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:37:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-11-23 14:37:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2022-11-23 14:37:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 636 states have (on average 3.1776729559748427) internal successors, (2021), 769 states have internal predecessors, (2021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:40,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 2021 transitions. [2022-11-23 14:37:40,490 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 2021 transitions. Word has length 1 [2022-11-23 14:37:40,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:37:40,507 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 2021 transitions. [2022-11-23 14:37:40,507 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 14:37:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 2021 transitions. [2022-11-23 14:37:40,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 14:37:40,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:37:40,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 14:37:40,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:40,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:40,709 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:37:40,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:37:40,709 INFO L85 PathProgramCache]: Analyzing trace with hash 790899, now seen corresponding path program 1 times [2022-11-23 14:37:40,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:37:40,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18336204] [2022-11-23 14:37:40,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:40,711 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 14:37:40,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:37:40,715 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:40,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:37:40,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:37:40,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:37:40,977 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 14:37:40,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-23 14:37:41,018 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 14:37:41,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:37:41,019 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:37:41,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18336204] [2022-11-23 14:37:41,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18336204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:37:41,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:37:41,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:37:41,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641540414] [2022-11-23 14:37:41,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:37:41,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:37:41,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:37:41,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:37:41,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:37:41,025 INFO L87 Difference]: Start difference. First operand 770 states and 2021 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:41,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:37:41,236 INFO L93 Difference]: Finished difference Result 443 states and 1109 transitions. [2022-11-23 14:37:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:37:41,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 14:37:41,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:37:41,242 INFO L225 Difference]: With dead ends: 443 [2022-11-23 14:37:41,242 INFO L226 Difference]: Without dead ends: 443 [2022-11-23 14:37:41,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:37:41,244 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:37:41,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:37:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-11-23 14:37:41,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2022-11-23 14:37:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 394 states have (on average 2.814720812182741) internal successors, (1109), 442 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1109 transitions. [2022-11-23 14:37:41,270 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1109 transitions. Word has length 3 [2022-11-23 14:37:41,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:37:41,271 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 1109 transitions. [2022-11-23 14:37:41,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1109 transitions. [2022-11-23 14:37:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 14:37:41,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:37:41,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 14:37:41,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:41,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:41,484 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:37:41,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:37:41,485 INFO L85 PathProgramCache]: Analyzing trace with hash 790900, now seen corresponding path program 1 times [2022-11-23 14:37:41,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:37:41,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481062403] [2022-11-23 14:37:41,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:41,486 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 14:37:41,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:37:41,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:41,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:37:41,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 14:37:41,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:37:41,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:37:41,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 14:37:41,674 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 14:37:41,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:37:41,675 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:37:41,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481062403] [2022-11-23 14:37:41,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481062403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:37:41,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:37:41,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:37:41,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070435832] [2022-11-23 14:37:41,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:37:41,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:37:41,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:37:41,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:37:41,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:37:41,680 INFO L87 Difference]: Start difference. First operand 443 states and 1109 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:41,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:37:41,803 INFO L93 Difference]: Finished difference Result 268 states and 643 transitions. [2022-11-23 14:37:41,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:37:41,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-23 14:37:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:37:41,807 INFO L225 Difference]: With dead ends: 268 [2022-11-23 14:37:41,807 INFO L226 Difference]: Without dead ends: 268 [2022-11-23 14:37:41,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:37:41,809 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:37:41,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:37:41,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-11-23 14:37:41,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-11-23 14:37:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 250 states have (on average 2.572) internal successors, (643), 267 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 643 transitions. [2022-11-23 14:37:41,825 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 643 transitions. Word has length 3 [2022-11-23 14:37:41,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:37:41,825 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 643 transitions. [2022-11-23 14:37:41,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:41,826 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 643 transitions. [2022-11-23 14:37:41,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 14:37:41,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:37:41,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:37:41,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:42,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:42,040 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:37:42,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:37:42,040 INFO L85 PathProgramCache]: Analyzing trace with hash 348040191, now seen corresponding path program 1 times [2022-11-23 14:37:42,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:37:42,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138190141] [2022-11-23 14:37:42,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:42,041 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 14:37:42,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:37:42,043 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:42,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:37:42,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:37:42,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:37:42,224 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 14:37:42,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:37:42,224 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:37:42,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138190141] [2022-11-23 14:37:42,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138190141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:37:42,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:37:42,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:37:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820933897] [2022-11-23 14:37:42,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:37:42,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:37:42,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:37:42,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:37:42,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:37:42,229 INFO L87 Difference]: Start difference. First operand 268 states and 643 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) 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 14:37:42,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:37:42,415 INFO L93 Difference]: Finished difference Result 114 states and 200 transitions. [2022-11-23 14:37:42,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:37:42,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) 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 14:37:42,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:37:42,417 INFO L225 Difference]: With dead ends: 114 [2022-11-23 14:37:42,417 INFO L226 Difference]: Without dead ends: 114 [2022-11-23 14:37:42,418 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 14:37:42,419 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:37:42,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:37:42,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-23 14:37:42,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-23 14:37:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 102 states have (on average 1.9607843137254901) internal successors, (200), 113 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 200 transitions. [2022-11-23 14:37:42,429 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 200 transitions. Word has length 7 [2022-11-23 14:37:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:37:42,430 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 200 transitions. [2022-11-23 14:37:42,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) 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 14:37:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 200 transitions. [2022-11-23 14:37:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 14:37:42,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:37:42,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:37:42,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:42,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:42,654 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:37:42,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:37:42,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1158215041, now seen corresponding path program 1 times [2022-11-23 14:37:42,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:37:42,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634725907] [2022-11-23 14:37:42,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:42,655 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 14:37:42,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:37:42,657 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:42,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:37:42,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:37:42,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:37:42,867 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 14:37:42,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:37:42,868 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:37:42,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634725907] [2022-11-23 14:37:42,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634725907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:37:42,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:37:42,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:37:42,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562600132] [2022-11-23 14:37:42,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:37:42,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:37:42,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:37:42,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:37:42,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:37:42,871 INFO L87 Difference]: Start difference. First operand 114 states and 200 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:37:43,043 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2022-11-23 14:37:43,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:37:43,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 14:37:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:37:43,044 INFO L225 Difference]: With dead ends: 42 [2022-11-23 14:37:43,044 INFO L226 Difference]: Without dead ends: 42 [2022-11-23 14:37:43,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:37:43,045 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:37:43,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 8 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:37:43,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-23 14:37:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-23 14:37:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.631578947368421) internal successors, (62), 41 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2022-11-23 14:37:43,048 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 10 [2022-11-23 14:37:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:37:43,048 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2022-11-23 14:37:43,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:43,049 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2022-11-23 14:37:43,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 14:37:43,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:37:43,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:37:43,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:43,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:43,250 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:37:43,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:37:43,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1928796046, now seen corresponding path program 1 times [2022-11-23 14:37:43,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:37:43,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382662525] [2022-11-23 14:37:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:43,252 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 14:37:43,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:37:43,254 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:43,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:37:43,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:37:43,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:37:43,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-23 14:37:43,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-23 14:37:43,647 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 14:37:43,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:37:43,647 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:37:43,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382662525] [2022-11-23 14:37:43,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382662525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:37:43,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:37:43,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:37:43,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751681895] [2022-11-23 14:37:43,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:37:43,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:37:43,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:37:43,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:37:43,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:37:43,650 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:43,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:37:43,819 INFO L93 Difference]: Finished difference Result 41 states and 61 transitions. [2022-11-23 14:37:43,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:37:43,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 14:37:43,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:37:43,821 INFO L225 Difference]: With dead ends: 41 [2022-11-23 14:37:43,821 INFO L226 Difference]: Without dead ends: 41 [2022-11-23 14:37:43,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:37:43,822 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:37:43,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 2 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:37:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-23 14:37:43,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-23 14:37:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.605263157894737) internal successors, (61), 40 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:43,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2022-11-23 14:37:43,824 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 14 [2022-11-23 14:37:43,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:37:43,826 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2022-11-23 14:37:43,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:43,826 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2022-11-23 14:37:43,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 14:37:43,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:37:43,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:37:43,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-23 14:37:44,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:44,048 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:37:44,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:37:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1928796047, now seen corresponding path program 1 times [2022-11-23 14:37:44,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:37:44,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652476805] [2022-11-23 14:37:44,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:44,049 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 14:37:44,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:37:44,050 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:44,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:37:44,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:37:44,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:37:44,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-23 14:37:44,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-23 14:37:44,569 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 14:37:44,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:37:44,570 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:37:44,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652476805] [2022-11-23 14:37:44,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652476805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:37:44,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:37:44,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:37:44,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604895966] [2022-11-23 14:37:44,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:37:44,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:37:44,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:37:44,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:37:44,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:37:44,571 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:37:44,752 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2022-11-23 14:37:44,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:37:44,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 14:37:44,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:37:44,753 INFO L225 Difference]: With dead ends: 40 [2022-11-23 14:37:44,753 INFO L226 Difference]: Without dead ends: 40 [2022-11-23 14:37:44,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:37:44,754 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:37:44,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:37:44,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-23 14:37:44,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-23 14:37:44,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 39 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2022-11-23 14:37:44,757 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 60 transitions. Word has length 14 [2022-11-23 14:37:44,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:37:44,757 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 60 transitions. [2022-11-23 14:37:44,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:44,758 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 60 transitions. [2022-11-23 14:37:44,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 14:37:44,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:37:44,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:37:44,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:44,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:44,968 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-23 14:37:44,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:37:44,968 INFO L85 PathProgramCache]: Analyzing trace with hash -336868526, now seen corresponding path program 1 times [2022-11-23 14:37:44,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:37:44,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761774536] [2022-11-23 14:37:44,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:44,969 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 14:37:44,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:37:44,970 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:44,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 14:37:45,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 14:37:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 14:37:45,360 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-23 14:37:45,361 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 14:37:45,362 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (49 of 50 remaining) [2022-11-23 14:37:45,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2022-11-23 14:37:45,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2022-11-23 14:37:45,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2022-11-23 14:37:45,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2022-11-23 14:37:45,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2022-11-23 14:37:45,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2022-11-23 14:37:45,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2022-11-23 14:37:45,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2022-11-23 14:37:45,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2022-11-23 14:37:45,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2022-11-23 14:37:45,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2022-11-23 14:37:45,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2022-11-23 14:37:45,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2022-11-23 14:37:45,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2022-11-23 14:37:45,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2022-11-23 14:37:45,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2022-11-23 14:37:45,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2022-11-23 14:37:45,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2022-11-23 14:37:45,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2022-11-23 14:37:45,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2022-11-23 14:37:45,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2022-11-23 14:37:45,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2022-11-23 14:37:45,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2022-11-23 14:37:45,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2022-11-23 14:37:45,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 50 remaining) [2022-11-23 14:37:45,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 50 remaining) [2022-11-23 14:37:45,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2022-11-23 14:37:45,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2022-11-23 14:37:45,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (20 of 50 remaining) [2022-11-23 14:37:45,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2022-11-23 14:37:45,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2022-11-23 14:37:45,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2022-11-23 14:37:45,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2022-11-23 14:37:45,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2022-11-23 14:37:45,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2022-11-23 14:37:45,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2022-11-23 14:37:45,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2022-11-23 14:37:45,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2022-11-23 14:37:45,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2022-11-23 14:37:45,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2022-11-23 14:37:45,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2022-11-23 14:37:45,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2022-11-23 14:37:45,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2022-11-23 14:37:45,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2022-11-23 14:37:45,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2022-11-23 14:37:45,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2022-11-23 14:37:45,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2022-11-23 14:37:45,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2022-11-23 14:37:45,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2022-11-23 14:37:45,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:45,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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 14:37:45,598 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:37:45,603 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 14:37:45,604 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 14:37:45,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:37:45 BasicIcfg [2022-11-23 14:37:45,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 14:37:45,691 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 14:37:45,691 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 14:37:45,692 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 14:37:45,692 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:37:10" (3/4) ... [2022-11-23 14:37:45,695 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 14:37:45,695 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 14:37:45,696 INFO L158 Benchmark]: Toolchain (without parser) took 37787.89ms. Allocated memory was 69.2MB in the beginning and 146.8MB in the end (delta: 77.6MB). Free memory was 46.4MB in the beginning and 49.8MB in the end (delta: -3.4MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. [2022-11-23 14:37:45,696 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 52.4MB. Free memory is still 30.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:37:45,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.73ms. Allocated memory is still 69.2MB. Free memory was 46.2MB in the beginning and 39.8MB in the end (delta: 6.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 14:37:45,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.35ms. Allocated memory is still 69.2MB. Free memory was 39.5MB in the beginning and 37.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:37:45,697 INFO L158 Benchmark]: Boogie Preprocessor took 65.93ms. Allocated memory is still 69.2MB. Free memory was 37.2MB in the beginning and 35.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:37:45,697 INFO L158 Benchmark]: RCFGBuilder took 1633.18ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 35.1MB in the beginning and 39.3MB in the end (delta: -4.3MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2022-11-23 14:37:45,698 INFO L158 Benchmark]: TraceAbstraction took 35428.65ms. Allocated memory was 83.9MB in the beginning and 146.8MB in the end (delta: 62.9MB). Free memory was 38.7MB in the beginning and 49.8MB in the end (delta: -11.1MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2022-11-23 14:37:45,698 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 146.8MB. Free memory is still 49.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:37:45,699 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.30ms. Allocated memory is still 52.4MB. Free memory is still 30.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 567.73ms. Allocated memory is still 69.2MB. Free memory was 46.2MB in the beginning and 39.8MB in the end (delta: 6.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.35ms. Allocated memory is still 69.2MB. Free memory was 39.5MB in the beginning and 37.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.93ms. Allocated memory is still 69.2MB. Free memory was 37.2MB in the beginning and 35.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1633.18ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 35.1MB in the beginning and 39.3MB in the end (delta: -4.3MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * TraceAbstraction took 35428.65ms. Allocated memory was 83.9MB in the beginning and 146.8MB in the end (delta: 62.9MB). Free memory was 38.7MB in the beginning and 49.8MB in the end (delta: -11.1MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 146.8MB. Free memory is still 49.8MB. 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: 29.1s, 148 PlacesBefore, 56 PlacesAfterwards, 143 TransitionsBefore, 50 TransitionsAfterwards, 3272 CoEnabledTransitionPairs, 8 FixpointIterations, 65 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 143 TotalNumberOfCompositions, 10940 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4684, independent: 4412, independent conditional: 0, independent unconditional: 4412, dependent: 212, dependent conditional: 0, dependent unconditional: 212, unknown: 60, unknown conditional: 0, unknown unconditional: 60] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2092, independent: 2038, independent conditional: 0, independent unconditional: 2038, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2092, independent: 1872, independent conditional: 0, independent unconditional: 1872, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 220, independent: 166, independent conditional: 0, independent unconditional: 166, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1770, independent: 873, independent conditional: 0, independent unconditional: 873, dependent: 678, dependent conditional: 0, dependent unconditional: 678, unknown: 219, unknown conditional: 0, unknown unconditional: 219] ], Cache Queries: [ total: 4684, independent: 2374, independent conditional: 0, independent unconditional: 2374, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 2147, unknown conditional: 0, unknown unconditional: 2147] , Statistics on independence cache: Total cache size (in pairs): 269, Positive cache size: 252, Positive conditional cache size: 0, Positive unconditional cache size: 252, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 4, Unknown conditional cache size: 0, Unknown unconditional cache size: 4 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1929; [L813] FCALL, FORK 0 pthread_create(&t1929, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1929, ((void *)0), P0, ((void *)0))=-1, t1929={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] EXPR 1 \read(y) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L772] 1 x = 1 VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L814] 0 pthread_t t1930; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L815] FCALL, FORK 0 pthread_create(&t1930, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1930, ((void *)0), P1, ((void *)0))=0, t1929={15:0}, t1930={7:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L784] 2 __unbuffered_p1_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L787] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 \read(y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] 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) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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 [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 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}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 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) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929={15:0}, t1930={7:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L832] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, weak$$choice0=3, weak$$choice1=128, weak$$choice2=2, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 815]: 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: 813]: 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 5 procedures, 177 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 35.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 29.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 126 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 126 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 284 IncrementalHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 16 mSDtfsCounter, 284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2542occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 45 ConstructedInterpolants, 0 QuantifiedInterpolants, 284 SizeOfPredicates, 37 NumberOfNonLiveVariables, 672 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 14:37:45,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d58a210-8579-4cbd-a919-2c666a04d584/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