./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da --- 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-e04fb08 [2022-11-16 11:57:05,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:57:05,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:57:05,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:57:05,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:57:05,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:57:05,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:57:05,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:57:05,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:57:05,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:57:05,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:57:05,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:57:05,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:57:05,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:57:05,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:57:05,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:57:05,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:57:05,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:57:05,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:57:05,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:57:05,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:57:05,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:57:05,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:57:05,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:57:05,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:57:05,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:57:05,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:57:05,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:57:05,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:57:05,479 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:57:05,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:57:05,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:57:05,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:57:05,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:57:05,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:57:05,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:57:05,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:57:05,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:57:05,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:57:05,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:57:05,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:57:05,489 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:57:05,510 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:57:05,511 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:57:05,511 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:57:05,511 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:57:05,512 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:57:05,512 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:57:05,513 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:57:05,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:57:05,513 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:57:05,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:57:05,514 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:57:05,514 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:57:05,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:57:05,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:57:05,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:57:05,515 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:57:05,515 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:57:05,516 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:57:05,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:57:05,516 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:57:05,516 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:57:05,516 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:57:05,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:57:05,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:57:05,517 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:57:05,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:57:05,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:57:05,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:57:05,518 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:57:05,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:57:05,518 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_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/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_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da [2022-11-16 11:57:05,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:57:05,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:57:05,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:57:05,836 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:57:05,837 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:57:05,839 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2022-11-16 11:57:05,917 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/data/6d691bc5a/7014d1a6de6440fba1494bc84aa0ba1d/FLAG9bc5b7164 [2022-11-16 11:57:06,659 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:57:06,660 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2022-11-16 11:57:06,680 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/data/6d691bc5a/7014d1a6de6440fba1494bc84aa0ba1d/FLAG9bc5b7164 [2022-11-16 11:57:06,914 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/data/6d691bc5a/7014d1a6de6440fba1494bc84aa0ba1d [2022-11-16 11:57:06,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:57:06,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:57:06,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:57:06,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:57:06,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:57:06,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:06" (1/1) ... [2022-11-16 11:57:06,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d97cbe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:06, skipping insertion in model container [2022-11-16 11:57:06,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:06" (1/1) ... [2022-11-16 11:57:06,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:57:07,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:57:07,305 WARN L229 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_1a9b72d6-f895-4248-bbc7-8d8728e988e8/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i[951,964] [2022-11-16 11:57:07,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:57:07,630 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:57:07,643 WARN L229 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_1a9b72d6-f895-4248-bbc7-8d8728e988e8/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i[951,964] [2022-11-16 11:57:07,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:57:07,746 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:57:07,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:07 WrapperNode [2022-11-16 11:57:07,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:57:07,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:57:07,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:57:07,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:57:07,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:07" (1/1) ... [2022-11-16 11:57:07,800 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:07" (1/1) ... [2022-11-16 11:57:07,844 INFO L138 Inliner]: procedures = 176, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 181 [2022-11-16 11:57:07,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:57:07,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:57:07,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:57:07,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:57:07,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:07" (1/1) ... [2022-11-16 11:57:07,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:07" (1/1) ... [2022-11-16 11:57:07,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:07" (1/1) ... [2022-11-16 11:57:07,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:07" (1/1) ... [2022-11-16 11:57:07,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:07" (1/1) ... [2022-11-16 11:57:07,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:07" (1/1) ... [2022-11-16 11:57:07,878 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:07" (1/1) ... [2022-11-16 11:57:07,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:07" (1/1) ... [2022-11-16 11:57:07,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:57:07,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:57:07,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:57:07,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:57:07,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:07" (1/1) ... [2022-11-16 11:57:07,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:57:07,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:07,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:57:07,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:57:08,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:57:08,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:57:08,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:57:08,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:57:08,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:57:08,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:57:08,021 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:57:08,021 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:57:08,021 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:57:08,021 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:57:08,022 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:57:08,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:57:08,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:57:08,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:57:08,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:57:08,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:57:08,026 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:57:08,255 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:57:08,258 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:57:08,970 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:57:09,712 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:57:09,713 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:57:09,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:57:09 BoogieIcfgContainer [2022-11-16 11:57:09,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:57:09,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:57:09,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:57:09,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:57:09,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:57:06" (1/3) ... [2022-11-16 11:57:09,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b632f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:57:09, skipping insertion in model container [2022-11-16 11:57:09,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:07" (2/3) ... [2022-11-16 11:57:09,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b632f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:57:09, skipping insertion in model container [2022-11-16 11:57:09,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:57:09" (3/3) ... [2022-11-16 11:57:09,729 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2022-11-16 11:57:09,752 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:57:09,752 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-16 11:57:09,753 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:57:09,920 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:57:09,978 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:57:09,996 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 174 transitions, 363 flow [2022-11-16 11:57:10,001 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 174 transitions, 363 flow [2022-11-16 11:57:10,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 174 transitions, 363 flow [2022-11-16 11:57:10,127 INFO L130 PetriNetUnfolder]: 2/171 cut-off events. [2022-11-16 11:57:10,127 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:57:10,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 171 events. 2/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 220 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2022-11-16 11:57:10,139 INFO L119 LiptonReduction]: Number of co-enabled transitions 5328 [2022-11-16 11:57:31,300 INFO L134 LiptonReduction]: Checked pairs total: 21266 [2022-11-16 11:57:31,300 INFO L136 LiptonReduction]: Total number of compositions: 155 [2022-11-16 11:57:31,311 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 66 transitions, 147 flow [2022-11-16 11:57:31,818 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 15204 states, 14055 states have (on average 3.817289220917823) internal successors, (53652), 15203 states have internal predecessors, (53652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:31,842 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:57:31,853 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;@3aefc357, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:57:31,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2022-11-16 11:57:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 15204 states, 14055 states have (on average 3.817289220917823) internal successors, (53652), 15203 states have internal predecessors, (53652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:31,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 11:57:31,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:31,955 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 11:57:31,957 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:31,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:31,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1063, now seen corresponding path program 1 times [2022-11-16 11:57:31,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:31,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070516542] [2022-11-16 11:57:31,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:31,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:32,141 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-16 11:57:32,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:32,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070516542] [2022-11-16 11:57:32,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070516542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:32,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:32,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 11:57:32,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105352957] [2022-11-16 11:57:32,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:32,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:57:32,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:32,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:57:32,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:57:32,206 INFO L87 Difference]: Start difference. First operand has 15204 states, 14055 states have (on average 3.817289220917823) internal successors, (53652), 15203 states have internal predecessors, (53652), 0 states have call successors, (0), 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-16 11:57:32,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:32,484 INFO L93 Difference]: Finished difference Result 6714 states and 23324 transitions. [2022-11-16 11:57:32,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:57:32,487 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-16 11:57:32,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:32,577 INFO L225 Difference]: With dead ends: 6714 [2022-11-16 11:57:32,577 INFO L226 Difference]: Without dead ends: 6714 [2022-11-16 11:57:32,578 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-16 11:57:32,581 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:32,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:57:32,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6714 states. [2022-11-16 11:57:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6714 to 6714. [2022-11-16 11:57:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6714 states, 6337 states have (on average 3.68060596496765) internal successors, (23324), 6713 states have internal predecessors, (23324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:33,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6714 states to 6714 states and 23324 transitions. [2022-11-16 11:57:33,002 INFO L78 Accepts]: Start accepts. Automaton has 6714 states and 23324 transitions. Word has length 1 [2022-11-16 11:57:33,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:33,003 INFO L495 AbstractCegarLoop]: Abstraction has 6714 states and 23324 transitions. [2022-11-16 11:57:33,008 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-16 11:57:33,010 INFO L276 IsEmpty]: Start isEmpty. Operand 6714 states and 23324 transitions. [2022-11-16 11:57:33,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:57:33,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:33,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:57:33,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:57:33,012 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:33,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:33,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1263961546, now seen corresponding path program 1 times [2022-11-16 11:57:33,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:33,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443262716] [2022-11-16 11:57:33,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:33,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:33,502 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-16 11:57:33,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:33,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443262716] [2022-11-16 11:57:33,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443262716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:33,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:33,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:57:33,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181713270] [2022-11-16 11:57:33,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:33,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:57:33,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:33,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:57:33,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:57:33,510 INFO L87 Difference]: Start difference. First operand 6714 states and 23324 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:33,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:33,898 INFO L93 Difference]: Finished difference Result 6042 states and 20920 transitions. [2022-11-16 11:57:33,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:57:33,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-16 11:57:33,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:33,958 INFO L225 Difference]: With dead ends: 6042 [2022-11-16 11:57:33,958 INFO L226 Difference]: Without dead ends: 6042 [2022-11-16 11:57:33,958 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-16 11:57:33,959 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:33,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 4 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:57:33,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2022-11-16 11:57:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2022-11-16 11:57:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6042 states, 5728 states have (on average 3.6522346368715084) internal successors, (20920), 6041 states have internal predecessors, (20920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20920 transitions. [2022-11-16 11:57:34,187 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20920 transitions. Word has length 6 [2022-11-16 11:57:34,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:34,188 INFO L495 AbstractCegarLoop]: Abstraction has 6042 states and 20920 transitions. [2022-11-16 11:57:34,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20920 transitions. [2022-11-16 11:57:34,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:57:34,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:34,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:34,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:57:34,261 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:34,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:34,262 INFO L85 PathProgramCache]: Analyzing trace with hash 528103132, now seen corresponding path program 1 times [2022-11-16 11:57:34,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:34,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628910166] [2022-11-16 11:57:34,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:34,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:34,420 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-16 11:57:34,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:34,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628910166] [2022-11-16 11:57:34,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628910166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:34,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:34,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:57:34,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309519528] [2022-11-16 11:57:34,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:34,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:57:34,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:34,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:57:34,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:57:34,423 INFO L87 Difference]: Start difference. First operand 6042 states and 20920 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-16 11:57:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:34,732 INFO L93 Difference]: Finished difference Result 7638 states and 26489 transitions. [2022-11-16 11:57:34,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:57:34,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-16 11:57:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:34,807 INFO L225 Difference]: With dead ends: 7638 [2022-11-16 11:57:34,808 INFO L226 Difference]: Without dead ends: 7638 [2022-11-16 11:57:34,809 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-16 11:57:34,812 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 27 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:34,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:57:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7638 states. [2022-11-16 11:57:35,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7638 to 6462. [2022-11-16 11:57:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6462 states, 6164 states have (on average 3.814243997404283) internal successors, (23511), 6461 states have internal predecessors, (23511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6462 states to 6462 states and 23511 transitions. [2022-11-16 11:57:35,195 INFO L78 Accepts]: Start accepts. Automaton has 6462 states and 23511 transitions. Word has length 7 [2022-11-16 11:57:35,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:35,196 INFO L495 AbstractCegarLoop]: Abstraction has 6462 states and 23511 transitions. [2022-11-16 11:57:35,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-16 11:57:35,196 INFO L276 IsEmpty]: Start isEmpty. Operand 6462 states and 23511 transitions. [2022-11-16 11:57:35,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:57:35,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:35,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:35,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:57:35,198 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:35,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:35,199 INFO L85 PathProgramCache]: Analyzing trace with hash 528103134, now seen corresponding path program 1 times [2022-11-16 11:57:35,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:35,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707931565] [2022-11-16 11:57:35,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:35,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:35,528 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-16 11:57:35,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:35,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707931565] [2022-11-16 11:57:35,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707931565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:35,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:35,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:57:35,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019814239] [2022-11-16 11:57:35,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:35,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:57:35,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:35,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:57:35,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:57:35,532 INFO L87 Difference]: Start difference. First operand 6462 states and 23511 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-16 11:57:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:35,865 INFO L93 Difference]: Finished difference Result 4066 states and 14358 transitions. [2022-11-16 11:57:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:57:35,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-16 11:57:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:35,888 INFO L225 Difference]: With dead ends: 4066 [2022-11-16 11:57:35,888 INFO L226 Difference]: Without dead ends: 4066 [2022-11-16 11:57:35,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:57:35,890 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 66 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:35,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 6 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:57:35,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4066 states. [2022-11-16 11:57:35,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4066 to 4066. [2022-11-16 11:57:36,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4066 states, 3939 states have (on average 3.645087585681645) internal successors, (14358), 4065 states have internal predecessors, (14358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 14358 transitions. [2022-11-16 11:57:36,027 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 14358 transitions. Word has length 7 [2022-11-16 11:57:36,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:36,027 INFO L495 AbstractCegarLoop]: Abstraction has 4066 states and 14358 transitions. [2022-11-16 11:57:36,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-16 11:57:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 14358 transitions. [2022-11-16 11:57:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:57:36,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:36,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:36,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:57:36,029 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:36,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:36,030 INFO L85 PathProgramCache]: Analyzing trace with hash 528103135, now seen corresponding path program 1 times [2022-11-16 11:57:36,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:36,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885149073] [2022-11-16 11:57:36,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:36,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:36,308 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-16 11:57:36,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:36,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885149073] [2022-11-16 11:57:36,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885149073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:36,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:36,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:57:36,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775822718] [2022-11-16 11:57:36,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:36,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:57:36,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:36,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:57:36,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:57:36,317 INFO L87 Difference]: Start difference. First operand 4066 states and 14358 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-16 11:57:36,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:36,422 INFO L93 Difference]: Finished difference Result 1910 states and 6361 transitions. [2022-11-16 11:57:36,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:57:36,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-16 11:57:36,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:36,438 INFO L225 Difference]: With dead ends: 1910 [2022-11-16 11:57:36,438 INFO L226 Difference]: Without dead ends: 1910 [2022-11-16 11:57:36,438 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-16 11:57:36,439 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:36,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:57:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2022-11-16 11:57:36,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1818. [2022-11-16 11:57:36,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1792 states have (on average 3.3839285714285716) internal successors, (6064), 1817 states have internal predecessors, (6064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 6064 transitions. [2022-11-16 11:57:36,585 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 6064 transitions. Word has length 7 [2022-11-16 11:57:36,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:36,585 INFO L495 AbstractCegarLoop]: Abstraction has 1818 states and 6064 transitions. [2022-11-16 11:57:36,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-16 11:57:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 6064 transitions. [2022-11-16 11:57:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 11:57:36,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:36,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:36,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:57:36,588 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:36,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:36,589 INFO L85 PathProgramCache]: Analyzing trace with hash 734314777, now seen corresponding path program 1 times [2022-11-16 11:57:36,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:36,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055112640] [2022-11-16 11:57:36,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:36,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:36,710 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-16 11:57:36,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:36,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055112640] [2022-11-16 11:57:36,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055112640] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:36,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:36,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:57:36,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156808420] [2022-11-16 11:57:36,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:36,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:57:36,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:36,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:57:36,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:57:36,712 INFO L87 Difference]: Start difference. First operand 1818 states and 6064 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-16 11:57:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:36,832 INFO L93 Difference]: Finished difference Result 1778 states and 5922 transitions. [2022-11-16 11:57:36,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:57:36,832 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-16 11:57:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:36,841 INFO L225 Difference]: With dead ends: 1778 [2022-11-16 11:57:36,841 INFO L226 Difference]: Without dead ends: 1778 [2022-11-16 11:57:36,842 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-16 11:57:36,843 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:36,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:57:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2022-11-16 11:57:36,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1778. [2022-11-16 11:57:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1752 states have (on average 3.3801369863013697) internal successors, (5922), 1777 states have internal predecessors, (5922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 5922 transitions. [2022-11-16 11:57:36,904 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 5922 transitions. Word has length 9 [2022-11-16 11:57:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:36,905 INFO L495 AbstractCegarLoop]: Abstraction has 1778 states and 5922 transitions. [2022-11-16 11:57:36,905 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-16 11:57:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 5922 transitions. [2022-11-16 11:57:36,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 11:57:36,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:36,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:36,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:57:36,907 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:36,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:36,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1288918041, now seen corresponding path program 1 times [2022-11-16 11:57:36,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:36,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912174676] [2022-11-16 11:57:36,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:36,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:37,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-16 11:57:37,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:37,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912174676] [2022-11-16 11:57:37,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912174676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:37,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:37,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:57:37,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090854031] [2022-11-16 11:57:37,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:37,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:57:37,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:37,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:57:37,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:57:37,183 INFO L87 Difference]: Start difference. First operand 1778 states and 5922 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:37,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:37,296 INFO L93 Difference]: Finished difference Result 1758 states and 5847 transitions. [2022-11-16 11:57:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:57:37,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 11:57:37,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:37,306 INFO L225 Difference]: With dead ends: 1758 [2022-11-16 11:57:37,306 INFO L226 Difference]: Without dead ends: 1758 [2022-11-16 11:57:37,307 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-16 11:57:37,307 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:37,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:57:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2022-11-16 11:57:37,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1758. [2022-11-16 11:57:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1732 states have (on average 3.3758660508083143) internal successors, (5847), 1757 states have internal predecessors, (5847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 5847 transitions. [2022-11-16 11:57:37,406 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 5847 transitions. Word has length 10 [2022-11-16 11:57:37,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:37,407 INFO L495 AbstractCegarLoop]: Abstraction has 1758 states and 5847 transitions. [2022-11-16 11:57:37,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:37,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 5847 transitions. [2022-11-16 11:57:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 11:57:37,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:37,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:37,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:57:37,408 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:37,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:37,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1288921101, now seen corresponding path program 1 times [2022-11-16 11:57:37,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:37,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227914970] [2022-11-16 11:57:37,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:37,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:37,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:57:37,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:37,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227914970] [2022-11-16 11:57:37,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227914970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:37,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:37,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:57:37,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839503438] [2022-11-16 11:57:37,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:37,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:57:37,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:37,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:57:37,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:57:37,611 INFO L87 Difference]: Start difference. First operand 1758 states and 5847 transitions. Second operand has 3 states, 2 states have (on average 5.0) 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-16 11:57:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:37,741 INFO L93 Difference]: Finished difference Result 2174 states and 6987 transitions. [2022-11-16 11:57:37,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:57:37,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) 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-16 11:57:37,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:37,751 INFO L225 Difference]: With dead ends: 2174 [2022-11-16 11:57:37,751 INFO L226 Difference]: Without dead ends: 2094 [2022-11-16 11:57:37,751 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-16 11:57:37,753 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:37,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:57:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2022-11-16 11:57:37,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1966. [2022-11-16 11:57:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1941 states have (on average 3.3523956723338486) internal successors, (6507), 1965 states have internal predecessors, (6507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 6507 transitions. [2022-11-16 11:57:37,826 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 6507 transitions. Word has length 10 [2022-11-16 11:57:37,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:37,826 INFO L495 AbstractCegarLoop]: Abstraction has 1966 states and 6507 transitions. [2022-11-16 11:57:37,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) 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-16 11:57:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 6507 transitions. [2022-11-16 11:57:37,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 11:57:37,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:37,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:37,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:57:37,831 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:37,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:37,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1288921102, now seen corresponding path program 1 times [2022-11-16 11:57:37,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:37,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19853225] [2022-11-16 11:57:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:37,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:38,271 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-16 11:57:38,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:38,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19853225] [2022-11-16 11:57:38,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19853225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:38,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:38,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:57:38,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546074282] [2022-11-16 11:57:38,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:38,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:57:38,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:38,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:57:38,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:57:38,275 INFO L87 Difference]: Start difference. First operand 1966 states and 6507 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-16 11:57:38,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:38,493 INFO L93 Difference]: Finished difference Result 1886 states and 6243 transitions. [2022-11-16 11:57:38,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:57:38,494 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-16 11:57:38,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:38,504 INFO L225 Difference]: With dead ends: 1886 [2022-11-16 11:57:38,504 INFO L226 Difference]: Without dead ends: 1886 [2022-11-16 11:57:38,504 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-16 11:57:38,505 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 53 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:38,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 7 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:57:38,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2022-11-16 11:57:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1886. [2022-11-16 11:57:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1862 states have (on average 3.352846401718582) internal successors, (6243), 1885 states have internal predecessors, (6243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 6243 transitions. [2022-11-16 11:57:38,579 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 6243 transitions. Word has length 10 [2022-11-16 11:57:38,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:38,580 INFO L495 AbstractCegarLoop]: Abstraction has 1886 states and 6243 transitions. [2022-11-16 11:57:38,581 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-16 11:57:38,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 6243 transitions. [2022-11-16 11:57:38,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:57:38,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:38,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:38,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:57:38,583 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:38,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:38,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1301750971, now seen corresponding path program 1 times [2022-11-16 11:57:38,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:38,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44411806] [2022-11-16 11:57:38,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:38,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:38,930 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-16 11:57:38,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:38,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44411806] [2022-11-16 11:57:38,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44411806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:38,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:38,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:57:38,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879857760] [2022-11-16 11:57:38,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:38,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:57:38,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:38,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:57:38,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:57:38,933 INFO L87 Difference]: Start difference. First operand 1886 states and 6243 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:39,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:39,058 INFO L93 Difference]: Finished difference Result 1866 states and 6168 transitions. [2022-11-16 11:57:39,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:57:39,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 11:57:39,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:39,068 INFO L225 Difference]: With dead ends: 1866 [2022-11-16 11:57:39,069 INFO L226 Difference]: Without dead ends: 1866 [2022-11-16 11:57:39,069 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-16 11:57:39,070 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:39,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:57:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2022-11-16 11:57:39,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1866. [2022-11-16 11:57:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1842 states have (on average 3.3485342019543975) internal successors, (6168), 1865 states have internal predecessors, (6168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 6168 transitions. [2022-11-16 11:57:39,145 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 6168 transitions. Word has length 11 [2022-11-16 11:57:39,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:39,145 INFO L495 AbstractCegarLoop]: Abstraction has 1866 states and 6168 transitions. [2022-11-16 11:57:39,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:39,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 6168 transitions. [2022-11-16 11:57:39,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:57:39,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:39,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:39,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:57:39,147 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:39,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:39,148 INFO L85 PathProgramCache]: Analyzing trace with hash 488982636, now seen corresponding path program 1 times [2022-11-16 11:57:39,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:39,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137677991] [2022-11-16 11:57:39,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:39,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:39,432 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-16 11:57:39,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:39,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137677991] [2022-11-16 11:57:39,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137677991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:39,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:39,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:57:39,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536793066] [2022-11-16 11:57:39,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:39,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:57:39,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:39,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:57:39,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:57:39,436 INFO L87 Difference]: Start difference. First operand 1866 states and 6168 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:39,584 INFO L93 Difference]: Finished difference Result 2658 states and 8685 transitions. [2022-11-16 11:57:39,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:57:39,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 11:57:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:39,599 INFO L225 Difference]: With dead ends: 2658 [2022-11-16 11:57:39,599 INFO L226 Difference]: Without dead ends: 2658 [2022-11-16 11:57:39,599 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-16 11:57:39,601 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 56 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:39,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:57:39,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2022-11-16 11:57:39,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 1995. [2022-11-16 11:57:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1995 states, 1971 states have (on average 3.3313039066463723) internal successors, (6566), 1994 states have internal predecessors, (6566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 6566 transitions. [2022-11-16 11:57:39,705 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 6566 transitions. Word has length 12 [2022-11-16 11:57:39,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:39,705 INFO L495 AbstractCegarLoop]: Abstraction has 1995 states and 6566 transitions. [2022-11-16 11:57:39,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 6566 transitions. [2022-11-16 11:57:39,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:57:39,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:39,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:39,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:57:39,707 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:39,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1699659552, now seen corresponding path program 1 times [2022-11-16 11:57:39,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:39,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045090662] [2022-11-16 11:57:39,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:39,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:39,982 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-16 11:57:39,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:39,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045090662] [2022-11-16 11:57:39,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045090662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:39,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:39,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:57:39,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964365336] [2022-11-16 11:57:39,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:39,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:57:39,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:39,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:57:39,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:57:39,984 INFO L87 Difference]: Start difference. First operand 1995 states and 6566 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:40,116 INFO L93 Difference]: Finished difference Result 1843 states and 6000 transitions. [2022-11-16 11:57:40,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:57:40,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 11:57:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:40,125 INFO L225 Difference]: With dead ends: 1843 [2022-11-16 11:57:40,125 INFO L226 Difference]: Without dead ends: 1843 [2022-11-16 11:57:40,125 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-16 11:57:40,126 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 33 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:40,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 8 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:57:40,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2022-11-16 11:57:40,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1763. [2022-11-16 11:57:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1739 states have (on average 3.291546866014951) internal successors, (5724), 1762 states have internal predecessors, (5724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 5724 transitions. [2022-11-16 11:57:40,176 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 5724 transitions. Word has length 12 [2022-11-16 11:57:40,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:40,176 INFO L495 AbstractCegarLoop]: Abstraction has 1763 states and 5724 transitions. [2022-11-16 11:57:40,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:40,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 5724 transitions. [2022-11-16 11:57:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:57:40,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:40,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:40,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:57:40,178 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:40,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:40,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1149841060, now seen corresponding path program 1 times [2022-11-16 11:57:40,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:40,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897741127] [2022-11-16 11:57:40,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:40,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:40,602 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-16 11:57:40,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:40,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897741127] [2022-11-16 11:57:40,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897741127] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:40,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:40,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:57:40,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490679802] [2022-11-16 11:57:40,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:40,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:57:40,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:40,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:57:40,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:57:40,606 INFO L87 Difference]: Start difference. First operand 1763 states and 5724 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-16 11:57:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:40,820 INFO L93 Difference]: Finished difference Result 1819 states and 5354 transitions. [2022-11-16 11:57:40,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:57:40,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-16 11:57:40,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:40,829 INFO L225 Difference]: With dead ends: 1819 [2022-11-16 11:57:40,830 INFO L226 Difference]: Without dead ends: 1763 [2022-11-16 11:57:40,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:57:40,831 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 85 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:40,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 15 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:57:40,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2022-11-16 11:57:40,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1539. [2022-11-16 11:57:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1515 states have (on average 3.054785478547855) internal successors, (4628), 1538 states have internal predecessors, (4628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 4628 transitions. [2022-11-16 11:57:40,878 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 4628 transitions. Word has length 13 [2022-11-16 11:57:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:40,878 INFO L495 AbstractCegarLoop]: Abstraction has 1539 states and 4628 transitions. [2022-11-16 11:57:40,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-16 11:57:40,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 4628 transitions. [2022-11-16 11:57:40,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:57:40,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:40,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:40,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:57:40,881 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:40,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:40,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1149841160, now seen corresponding path program 1 times [2022-11-16 11:57:40,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:40,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233640305] [2022-11-16 11:57:40,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:40,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:41,514 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-16 11:57:41,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:41,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233640305] [2022-11-16 11:57:41,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233640305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:41,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:41,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:57:41,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102495351] [2022-11-16 11:57:41,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:41,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:57:41,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:41,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:57:41,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:57:41,518 INFO L87 Difference]: Start difference. First operand 1539 states and 4628 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-16 11:57:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:42,182 INFO L93 Difference]: Finished difference Result 1195 states and 3634 transitions. [2022-11-16 11:57:42,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:57:42,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-16 11:57:42,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:42,189 INFO L225 Difference]: With dead ends: 1195 [2022-11-16 11:57:42,190 INFO L226 Difference]: Without dead ends: 1111 [2022-11-16 11:57:42,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:57:42,191 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 55 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:42,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 36 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 11:57:42,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2022-11-16 11:57:42,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2022-11-16 11:57:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1099 states have (on average 2.9954504094631482) internal successors, (3292), 1110 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:42,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 3292 transitions. [2022-11-16 11:57:42,237 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 3292 transitions. Word has length 13 [2022-11-16 11:57:42,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:42,240 INFO L495 AbstractCegarLoop]: Abstraction has 1111 states and 3292 transitions. [2022-11-16 11:57:42,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-16 11:57:42,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 3292 transitions. [2022-11-16 11:57:42,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:57:42,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:42,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:42,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:57:42,244 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:42,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:42,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1147079683, now seen corresponding path program 1 times [2022-11-16 11:57:42,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:42,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393800577] [2022-11-16 11:57:42,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:42,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:57:44,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:44,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393800577] [2022-11-16 11:57:44,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393800577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:44,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:44,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:57:44,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897204125] [2022-11-16 11:57:44,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:44,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:57:44,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:44,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:57:44,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:57:44,576 INFO L87 Difference]: Start difference. First operand 1111 states and 3292 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-16 11:57:45,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:45,068 INFO L93 Difference]: Finished difference Result 1159 states and 3399 transitions. [2022-11-16 11:57:45,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:57:45,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-16 11:57:45,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:45,073 INFO L225 Difference]: With dead ends: 1159 [2022-11-16 11:57:45,074 INFO L226 Difference]: Without dead ends: 1159 [2022-11-16 11:57:45,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:57:45,074 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 90 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:45,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 17 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:57:45,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-11-16 11:57:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1085. [2022-11-16 11:57:45,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 1073 states have (on average 2.983224603914259) internal successors, (3201), 1084 states have internal predecessors, (3201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 3201 transitions. [2022-11-16 11:57:45,105 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 3201 transitions. Word has length 13 [2022-11-16 11:57:45,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:45,106 INFO L495 AbstractCegarLoop]: Abstraction has 1085 states and 3201 transitions. [2022-11-16 11:57:45,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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-16 11:57:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 3201 transitions. [2022-11-16 11:57:45,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:57:45,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:45,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:45,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:57:45,109 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:45,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:45,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1285339410, now seen corresponding path program 1 times [2022-11-16 11:57:45,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:45,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131756101] [2022-11-16 11:57:45,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:45,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:57:45,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:45,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131756101] [2022-11-16 11:57:45,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131756101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:45,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:45,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:57:45,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449721988] [2022-11-16 11:57:45,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:45,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:57:45,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:45,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:57:45,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:57:45,266 INFO L87 Difference]: Start difference. First operand 1085 states and 3201 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:45,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:45,376 INFO L93 Difference]: Finished difference Result 1117 states and 3365 transitions. [2022-11-16 11:57:45,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:57:45,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 11:57:45,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:45,378 INFO L225 Difference]: With dead ends: 1117 [2022-11-16 11:57:45,378 INFO L226 Difference]: Without dead ends: 270 [2022-11-16 11:57:45,379 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-16 11:57:45,379 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 43 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:45,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:57:45,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-16 11:57:45,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2022-11-16 11:57:45,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 2.746268656716418) internal successors, (736), 268 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:45,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 736 transitions. [2022-11-16 11:57:45,389 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 736 transitions. Word has length 14 [2022-11-16 11:57:45,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:45,389 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 736 transitions. [2022-11-16 11:57:45,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 736 transitions. [2022-11-16 11:57:45,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:57:45,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:45,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:45,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:57:45,391 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:45,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:45,392 INFO L85 PathProgramCache]: Analyzing trace with hash 330962339, now seen corresponding path program 1 times [2022-11-16 11:57:45,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:45,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418032403] [2022-11-16 11:57:45,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:45,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:45,665 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-16 11:57:45,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:45,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418032403] [2022-11-16 11:57:45,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418032403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:45,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:45,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:57:45,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856357377] [2022-11-16 11:57:45,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:45,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:57:45,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:45,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:57:45,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:57:45,668 INFO L87 Difference]: Start difference. First operand 269 states and 736 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:45,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:45,744 INFO L93 Difference]: Finished difference Result 190 states and 444 transitions. [2022-11-16 11:57:45,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:57:45,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 11:57:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:45,746 INFO L225 Difference]: With dead ends: 190 [2022-11-16 11:57:45,746 INFO L226 Difference]: Without dead ends: 190 [2022-11-16 11:57:45,746 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-16 11:57:45,747 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:45,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:57:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-16 11:57:45,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-11-16 11:57:45,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 2.3492063492063493) internal successors, (444), 189 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:45,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 444 transitions. [2022-11-16 11:57:45,753 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 444 transitions. Word has length 15 [2022-11-16 11:57:45,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:45,753 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 444 transitions. [2022-11-16 11:57:45,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 444 transitions. [2022-11-16 11:57:45,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 11:57:45,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:45,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:45,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:57:45,755 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:45,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:45,756 INFO L85 PathProgramCache]: Analyzing trace with hash 531569925, now seen corresponding path program 1 times [2022-11-16 11:57:45,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:45,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443700168] [2022-11-16 11:57:45,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:45,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:46,082 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-16 11:57:46,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:46,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443700168] [2022-11-16 11:57:46,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443700168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:46,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:46,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:57:46,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044174834] [2022-11-16 11:57:46,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:46,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:57:46,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:46,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:57:46,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:57:46,085 INFO L87 Difference]: Start difference. First operand 190 states and 444 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:46,183 INFO L93 Difference]: Finished difference Result 117 states and 234 transitions. [2022-11-16 11:57:46,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:57:46,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-16 11:57:46,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:46,185 INFO L225 Difference]: With dead ends: 117 [2022-11-16 11:57:46,185 INFO L226 Difference]: Without dead ends: 117 [2022-11-16 11:57:46,185 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-16 11:57:46,186 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:46,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:57:46,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-16 11:57:46,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-16 11:57:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.0172413793103448) internal successors, (234), 116 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 234 transitions. [2022-11-16 11:57:46,190 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 234 transitions. Word has length 17 [2022-11-16 11:57:46,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:46,190 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 234 transitions. [2022-11-16 11:57:46,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 234 transitions. [2022-11-16 11:57:46,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 11:57:46,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:46,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:46,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:57:46,192 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:46,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:46,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1584404953, now seen corresponding path program 1 times [2022-11-16 11:57:46,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:46,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686051104] [2022-11-16 11:57:46,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:46,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:57:46,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:46,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686051104] [2022-11-16 11:57:46,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686051104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:46,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:46,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:57:46,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75378168] [2022-11-16 11:57:46,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:46,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:57:46,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:46,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:57:46,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:57:46,557 INFO L87 Difference]: Start difference. First operand 117 states and 234 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:46,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:46,649 INFO L93 Difference]: Finished difference Result 92 states and 185 transitions. [2022-11-16 11:57:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:57:46,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-16 11:57:46,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:46,650 INFO L225 Difference]: With dead ends: 92 [2022-11-16 11:57:46,650 INFO L226 Difference]: Without dead ends: 92 [2022-11-16 11:57:46,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:57:46,651 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 56 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:46,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 5 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:57:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-16 11:57:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-16 11:57:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.032967032967033) internal successors, (185), 91 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 185 transitions. [2022-11-16 11:57:46,654 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 185 transitions. Word has length 19 [2022-11-16 11:57:46,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:46,657 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 185 transitions. [2022-11-16 11:57:46,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 185 transitions. [2022-11-16 11:57:46,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 11:57:46,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:46,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:46,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:57:46,659 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:46,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:46,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2052306523, now seen corresponding path program 1 times [2022-11-16 11:57:46,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:46,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549882742] [2022-11-16 11:57:46,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:46,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:46,950 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-16 11:57:46,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:46,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549882742] [2022-11-16 11:57:46,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549882742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:57:46,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:57:46,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:57:46,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065843618] [2022-11-16 11:57:46,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:57:46,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:57:46,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:46,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:57:46,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:57:46,953 INFO L87 Difference]: Start difference. First operand 92 states and 185 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:47,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:47,062 INFO L93 Difference]: Finished difference Result 118 states and 233 transitions. [2022-11-16 11:57:47,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:57:47,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 11:57:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:47,063 INFO L225 Difference]: With dead ends: 118 [2022-11-16 11:57:47,063 INFO L226 Difference]: Without dead ends: 48 [2022-11-16 11:57:47,063 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-16 11:57:47,064 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:47,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:57:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-16 11:57:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-16 11:57:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 47 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2022-11-16 11:57:47,066 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 21 [2022-11-16 11:57:47,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:47,066 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2022-11-16 11:57:47,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:57:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2022-11-16 11:57:47,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 11:57:47,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:47,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:47,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:57:47,067 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:57:47,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:47,067 INFO L85 PathProgramCache]: Analyzing trace with hash 964261379, now seen corresponding path program 2 times [2022-11-16 11:57:47,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:47,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177928521] [2022-11-16 11:57:47,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:47,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:57:47,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:57:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:57:47,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:57:47,498 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:57:47,500 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (66 of 67 remaining) [2022-11-16 11:57:47,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (65 of 67 remaining) [2022-11-16 11:57:47,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 67 remaining) [2022-11-16 11:57:47,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 67 remaining) [2022-11-16 11:57:47,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 67 remaining) [2022-11-16 11:57:47,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 67 remaining) [2022-11-16 11:57:47,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 67 remaining) [2022-11-16 11:57:47,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 67 remaining) [2022-11-16 11:57:47,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 67 remaining) [2022-11-16 11:57:47,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 67 remaining) [2022-11-16 11:57:47,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 67 remaining) [2022-11-16 11:57:47,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 67 remaining) [2022-11-16 11:57:47,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 67 remaining) [2022-11-16 11:57:47,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 67 remaining) [2022-11-16 11:57:47,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 67 remaining) [2022-11-16 11:57:47,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 67 remaining) [2022-11-16 11:57:47,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 67 remaining) [2022-11-16 11:57:47,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 67 remaining) [2022-11-16 11:57:47,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 67 remaining) [2022-11-16 11:57:47,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 67 remaining) [2022-11-16 11:57:47,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 67 remaining) [2022-11-16 11:57:47,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 67 remaining) [2022-11-16 11:57:47,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 67 remaining) [2022-11-16 11:57:47,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 67 remaining) [2022-11-16 11:57:47,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 67 remaining) [2022-11-16 11:57:47,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 67 remaining) [2022-11-16 11:57:47,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 67 remaining) [2022-11-16 11:57:47,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 67 remaining) [2022-11-16 11:57:47,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 67 remaining) [2022-11-16 11:57:47,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 67 remaining) [2022-11-16 11:57:47,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 67 remaining) [2022-11-16 11:57:47,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 67 remaining) [2022-11-16 11:57:47,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 67 remaining) [2022-11-16 11:57:47,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 67 remaining) [2022-11-16 11:57:47,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 67 remaining) [2022-11-16 11:57:47,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 67 remaining) [2022-11-16 11:57:47,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 67 remaining) [2022-11-16 11:57:47,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 67 remaining) [2022-11-16 11:57:47,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (28 of 67 remaining) [2022-11-16 11:57:47,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 67 remaining) [2022-11-16 11:57:47,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 67 remaining) [2022-11-16 11:57:47,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 67 remaining) [2022-11-16 11:57:47,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 67 remaining) [2022-11-16 11:57:47,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 67 remaining) [2022-11-16 11:57:47,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 67 remaining) [2022-11-16 11:57:47,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 67 remaining) [2022-11-16 11:57:47,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 67 remaining) [2022-11-16 11:57:47,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 67 remaining) [2022-11-16 11:57:47,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 67 remaining) [2022-11-16 11:57:47,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 67 remaining) [2022-11-16 11:57:47,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 67 remaining) [2022-11-16 11:57:47,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 67 remaining) [2022-11-16 11:57:47,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 67 remaining) [2022-11-16 11:57:47,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 67 remaining) [2022-11-16 11:57:47,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 67 remaining) [2022-11-16 11:57:47,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 67 remaining) [2022-11-16 11:57:47,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 67 remaining) [2022-11-16 11:57:47,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 67 remaining) [2022-11-16 11:57:47,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 67 remaining) [2022-11-16 11:57:47,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 67 remaining) [2022-11-16 11:57:47,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 67 remaining) [2022-11-16 11:57:47,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 67 remaining) [2022-11-16 11:57:47,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 67 remaining) [2022-11-16 11:57:47,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 67 remaining) [2022-11-16 11:57:47,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 67 remaining) [2022-11-16 11:57:47,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 67 remaining) [2022-11-16 11:57:47,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 67 remaining) [2022-11-16 11:57:47,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:57:47,529 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:57:47,536 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:57:47,536 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:57:47,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:57:47 BasicIcfg [2022-11-16 11:57:47,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:57:47,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:57:47,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:57:47,698 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:57:47,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:57:09" (3/4) ... [2022-11-16 11:57:47,702 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:57:47,702 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:57:47,703 INFO L158 Benchmark]: Toolchain (without parser) took 40778.53ms. Allocated memory was 109.1MB in the beginning and 817.9MB in the end (delta: 708.8MB). Free memory was 66.8MB in the beginning and 612.0MB in the end (delta: -545.2MB). Peak memory consumption was 164.5MB. Max. memory is 16.1GB. [2022-11-16 11:57:47,703 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 109.1MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:57:47,704 INFO L158 Benchmark]: CACSL2BoogieTranslator took 819.95ms. Allocated memory is still 109.1MB. Free memory was 66.5MB in the beginning and 71.3MB in the end (delta: -4.8MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2022-11-16 11:57:47,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.28ms. Allocated memory is still 109.1MB. Free memory was 71.3MB in the beginning and 68.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:57:47,706 INFO L158 Benchmark]: Boogie Preprocessor took 50.41ms. Allocated memory is still 109.1MB. Free memory was 68.8MB in the beginning and 66.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:57:47,706 INFO L158 Benchmark]: RCFGBuilder took 1820.49ms. Allocated memory was 109.1MB in the beginning and 155.2MB in the end (delta: 46.1MB). Free memory was 66.3MB in the beginning and 77.4MB in the end (delta: -11.1MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2022-11-16 11:57:47,707 INFO L158 Benchmark]: TraceAbstraction took 37975.54ms. Allocated memory was 155.2MB in the beginning and 817.9MB in the end (delta: 662.7MB). Free memory was 76.4MB in the beginning and 613.1MB in the end (delta: -536.6MB). Peak memory consumption was 583.1MB. Max. memory is 16.1GB. [2022-11-16 11:57:47,708 INFO L158 Benchmark]: Witness Printer took 4.77ms. Allocated memory is still 817.9MB. Free memory was 613.1MB in the beginning and 612.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:57:47,714 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.31ms. Allocated memory is still 109.1MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 819.95ms. Allocated memory is still 109.1MB. Free memory was 66.5MB in the beginning and 71.3MB in the end (delta: -4.8MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.28ms. Allocated memory is still 109.1MB. Free memory was 71.3MB in the beginning and 68.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.41ms. Allocated memory is still 109.1MB. Free memory was 68.8MB in the beginning and 66.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1820.49ms. Allocated memory was 109.1MB in the beginning and 155.2MB in the end (delta: 46.1MB). Free memory was 66.3MB in the beginning and 77.4MB in the end (delta: -11.1MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * TraceAbstraction took 37975.54ms. Allocated memory was 155.2MB in the beginning and 817.9MB in the end (delta: 662.7MB). Free memory was 76.4MB in the beginning and 613.1MB in the end (delta: -536.6MB). Peak memory consumption was 583.1MB. Max. memory is 16.1GB. * Witness Printer took 4.77ms. Allocated memory is still 817.9MB. Free memory was 613.1MB in the beginning and 612.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.3s, 182 PlacesBefore, 76 PlacesAfterwards, 174 TransitionsBefore, 66 TransitionsAfterwards, 5328 CoEnabledTransitionPairs, 7 FixpointIterations, 70 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 155 TotalNumberOfCompositions, 21266 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9368, independent: 8949, independent conditional: 0, independent unconditional: 8949, dependent: 393, dependent conditional: 0, dependent unconditional: 393, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3297, independent: 3212, independent conditional: 0, independent unconditional: 3212, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3297, independent: 3019, independent conditional: 0, independent unconditional: 3019, dependent: 278, dependent conditional: 0, dependent unconditional: 278, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 278, independent: 193, independent conditional: 0, independent unconditional: 193, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1920, independent: 1132, independent conditional: 0, independent unconditional: 1132, dependent: 672, dependent conditional: 0, dependent unconditional: 672, unknown: 116, unknown conditional: 0, unknown unconditional: 116] ], Cache Queries: [ total: 9368, independent: 5737, independent conditional: 0, independent unconditional: 5737, dependent: 312, dependent conditional: 0, dependent unconditional: 312, unknown: 3319, unknown conditional: 0, unknown unconditional: 3319] , Statistics on independence cache: Total cache size (in pairs): 747, Positive cache size: 711, Positive conditional cache size: 0, Positive unconditional cache size: 711, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L750] 0 int y$w_buff0; [L752] 0 int y$w_buff1; [L739] 0 int y$mem_tmp; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L748] 0 _Bool y$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L709] 0 int __unbuffered_cnt = 0; [L753] 0 _Bool y$w_buff1_used; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L749] 0 int *y$read_delayed_var; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L711] 0 int __unbuffered_p0_EAX = 0; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L715] 0 int __unbuffered_p2_EAX = 0; [L738] 0 _Bool y$flush_delayed; [L713] 0 int __unbuffered_p0_EBX = 0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L733] 0 _Bool main$tmp_guard1; [L732] 0 _Bool main$tmp_guard0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L751] 0 _Bool y$w_buff0_used; [L735] 0 int x = 0; [L744] 0 _Bool y$r_buff1_thd0; [L737] 0 int y = 0; [L746] 0 _Bool y$r_buff1_thd2; [L755] 0 int z = 0; [L745] 0 _Bool y$r_buff1_thd1; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L747] 0 _Bool y$r_buff1_thd3; [L850] 0 pthread_t t2052; [L851] FCALL, FORK 0 pthread_create(&t2052, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2052, ((void *)0), P0, ((void *)0))=8, t2052={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t2053; [L853] FCALL, FORK 0 pthread_create(&t2053, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2053, ((void *)0), P1, ((void *)0))=9, t2052={7:0}, t2053={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] 0 pthread_t t2054; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2052={7:0}, t2053={5:0}, t2054={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L855] FCALL, FORK 0 pthread_create(&t2054, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2054, ((void *)0), P2, ((void *)0))=10, t2052={7:0}, t2053={5:0}, t2054={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L765] 1 __unbuffered_p0_EBX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L792] 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) [L792] 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) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 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 [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L772] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] 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) [L861] 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) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 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 [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052={7:0}, t2053={5:0}, t2054={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 224 locations, 67 error locations. Started 1 CEGAR loops. OverallTime: 37.6s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 21.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 728 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 728 mSDsluCounter, 148 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1603 IncrementalHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 54 mSDtfsCounter, 1603 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15204occurred in iteration=0, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 2438 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 1864 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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-16 11:57:47,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da --- 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-e04fb08 [2022-11-16 11:57:50,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:57:50,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:57:50,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:57:50,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:57:50,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:57:50,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:57:50,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:57:50,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:57:50,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:57:50,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:57:50,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:57:50,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:57:50,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:57:50,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:57:50,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:57:50,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:57:50,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:57:50,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:57:50,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:57:50,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:57:50,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:57:50,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:57:50,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:57:50,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:57:50,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:57:50,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:57:50,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:57:50,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:57:50,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:57:50,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:57:50,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:57:50,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:57:50,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:57:50,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:57:50,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:57:50,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:57:50,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:57:50,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:57:50,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:57:50,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:57:50,414 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 11:57:50,471 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:57:50,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:57:50,473 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:57:50,473 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:57:50,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:57:50,474 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:57:50,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:57:50,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:57:50,477 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:57:50,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:57:50,478 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:57:50,478 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:57:50,479 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:57:50,479 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:57:50,479 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:57:50,480 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:57:50,480 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:57:50,480 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:57:50,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:57:50,480 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:57:50,481 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:57:50,481 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:57:50,481 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:57:50,481 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:57:50,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:57:50,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:57:50,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:57:50,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:57:50,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:57:50,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:57:50,483 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:57:50,484 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:57:50,484 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:57:50,484 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_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/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_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da [2022-11-16 11:57:50,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:57:50,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:57:50,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:57:50,974 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:57:50,975 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:57:50,977 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2022-11-16 11:57:51,049 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/data/2feac356d/7789784e497449b08af196056b9e340a/FLAG5de0a94f3 [2022-11-16 11:57:51,685 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:57:51,685 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2022-11-16 11:57:51,701 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/data/2feac356d/7789784e497449b08af196056b9e340a/FLAG5de0a94f3 [2022-11-16 11:57:51,924 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/data/2feac356d/7789784e497449b08af196056b9e340a [2022-11-16 11:57:51,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:57:51,930 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:57:51,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:57:51,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:57:51,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:57:51,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:51" (1/1) ... [2022-11-16 11:57:51,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e6754f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:51, skipping insertion in model container [2022-11-16 11:57:51,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:51" (1/1) ... [2022-11-16 11:57:51,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:57:52,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:57:52,333 WARN L229 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_1a9b72d6-f895-4248-bbc7-8d8728e988e8/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i[951,964] [2022-11-16 11:57:52,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:57:52,631 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:57:52,645 WARN L229 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_1a9b72d6-f895-4248-bbc7-8d8728e988e8/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i[951,964] [2022-11-16 11:57:52,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:57:52,738 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:57:52,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:52 WrapperNode [2022-11-16 11:57:52,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:57:52,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:57:52,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:57:52,740 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:57:52,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:52" (1/1) ... [2022-11-16 11:57:52,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:52" (1/1) ... [2022-11-16 11:57:52,829 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 182 [2022-11-16 11:57:52,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:57:52,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:57:52,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:57:52,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:57:52,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:52" (1/1) ... [2022-11-16 11:57:52,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:52" (1/1) ... [2022-11-16 11:57:52,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:52" (1/1) ... [2022-11-16 11:57:52,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:52" (1/1) ... [2022-11-16 11:57:52,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:52" (1/1) ... [2022-11-16 11:57:52,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:52" (1/1) ... [2022-11-16 11:57:52,867 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:52" (1/1) ... [2022-11-16 11:57:52,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:52" (1/1) ... [2022-11-16 11:57:52,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:57:52,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:57:52,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:57:52,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:57:52,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:52" (1/1) ... [2022-11-16 11:57:52,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:57:52,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:52,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:57:52,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:57:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 11:57:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:57:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:57:52,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:57:52,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:57:52,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 11:57:52,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 11:57:52,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-16 11:57:52,967 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:57:52,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:57:52,968 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:57:52,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:57:52,968 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:57:52,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:57:52,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:57:52,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:57:52,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:57:52,971 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:57:53,216 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:57:53,232 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:57:53,940 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:57:54,717 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:57:54,717 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:57:54,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:57:54 BoogieIcfgContainer [2022-11-16 11:57:54,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:57:54,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:57:54,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:57:54,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:57:54,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:57:51" (1/3) ... [2022-11-16 11:57:54,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1da787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:57:54, skipping insertion in model container [2022-11-16 11:57:54,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:52" (2/3) ... [2022-11-16 11:57:54,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1da787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:57:54, skipping insertion in model container [2022-11-16 11:57:54,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:57:54" (3/3) ... [2022-11-16 11:57:54,730 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2022-11-16 11:57:54,749 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:57:54,750 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-16 11:57:54,750 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:57:54,964 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:57:55,014 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:57:55,034 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 175 transitions, 365 flow [2022-11-16 11:57:55,038 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 175 transitions, 365 flow [2022-11-16 11:57:55,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 175 transitions, 365 flow [2022-11-16 11:57:55,177 INFO L130 PetriNetUnfolder]: 2/172 cut-off events. [2022-11-16 11:57:55,177 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:57:55,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 172 events. 2/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 218 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2022-11-16 11:57:55,189 INFO L119 LiptonReduction]: Number of co-enabled transitions 5328 [2022-11-16 11:58:12,385 WARN L233 SmtUtils]: Spent 5.56s on a formula simplification. DAG size of input: 238 DAG size of output: 237 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 11:58:18,702 WARN L233 SmtUtils]: Spent 6.31s on a formula simplification. DAG size of input: 237 DAG size of output: 236 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 11:58:51,213 INFO L134 LiptonReduction]: Checked pairs total: 21294 [2022-11-16 11:58:51,213 INFO L136 LiptonReduction]: Total number of compositions: 160 [2022-11-16 11:58:51,224 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 66 transitions, 147 flow [2022-11-16 11:58:52,012 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 15204 states, 14055 states have (on average 3.817289220917823) internal successors, (53652), 15203 states have internal predecessors, (53652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:52,063 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:58:52,075 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;@6d9c809c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:58:52,076 INFO L358 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2022-11-16 11:58:52,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 15204 states, 14055 states have (on average 3.817289220917823) internal successors, (53652), 15203 states have internal predecessors, (53652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 11:58:52,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:58:52,133 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 11:58:52,136 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:58:52,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:58:52,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1071, now seen corresponding path program 1 times [2022-11-16 11:58:52,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:58:52,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737609123] [2022-11-16 11:58:52,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:52,162 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-16 11:58:52,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:58:52,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:58:52,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:58:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:52,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 11:58:52,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:58:52,429 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-16 11:58:52,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:58:52,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:58:52,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737609123] [2022-11-16 11:58:52,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737609123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:58:52,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:58:52,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 11:58:52,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078287341] [2022-11-16 11:58:52,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:58:52,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:58:52,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:58:52,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:58:52,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:58:52,499 INFO L87 Difference]: Start difference. First operand has 15204 states, 14055 states have (on average 3.817289220917823) internal successors, (53652), 15203 states have internal predecessors, (53652), 0 states have call successors, (0), 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-16 11:58:53,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:58:53,016 INFO L93 Difference]: Finished difference Result 6714 states and 23324 transitions. [2022-11-16 11:58:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:58:53,019 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-16 11:58:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:58:53,110 INFO L225 Difference]: With dead ends: 6714 [2022-11-16 11:58:53,110 INFO L226 Difference]: Without dead ends: 6714 [2022-11-16 11:58:53,112 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-16 11:58:53,116 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:58:53,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:58:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6714 states. [2022-11-16 11:58:53,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6714 to 6714. [2022-11-16 11:58:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6714 states, 6337 states have (on average 3.68060596496765) internal successors, (23324), 6713 states have internal predecessors, (23324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6714 states to 6714 states and 23324 transitions. [2022-11-16 11:58:53,890 INFO L78 Accepts]: Start accepts. Automaton has 6714 states and 23324 transitions. Word has length 1 [2022-11-16 11:58:53,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:58:53,891 INFO L495 AbstractCegarLoop]: Abstraction has 6714 states and 23324 transitions. [2022-11-16 11:58:53,892 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-16 11:58:53,894 INFO L276 IsEmpty]: Start isEmpty. Operand 6714 states and 23324 transitions. [2022-11-16 11:58:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:58:53,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:58:53,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:58:53,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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)] Ended with exit code 0 [2022-11-16 11:58:54,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:58:54,096 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:58:54,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:58:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1466333764, now seen corresponding path program 1 times [2022-11-16 11:58:54,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:58:54,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615301679] [2022-11-16 11:58:54,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:54,099 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-16 11:58:54,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:58:54,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:58:54,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:58:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:54,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:58:54,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:58:54,511 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-16 11:58:54,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:58:54,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:58:54,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615301679] [2022-11-16 11:58:54,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615301679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:58:54,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:58:54,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:58:54,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908789265] [2022-11-16 11:58:54,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:58:54,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:58:54,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:58:54,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:58:54,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:58:54,526 INFO L87 Difference]: Start difference. First operand 6714 states and 23324 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:55,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:58:55,203 INFO L93 Difference]: Finished difference Result 6042 states and 20920 transitions. [2022-11-16 11:58:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:58:55,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-16 11:58:55,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:58:55,327 INFO L225 Difference]: With dead ends: 6042 [2022-11-16 11:58:55,327 INFO L226 Difference]: Without dead ends: 6042 [2022-11-16 11:58:55,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-16 11:58:55,331 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:58:55,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 4 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:58:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2022-11-16 11:58:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2022-11-16 11:58:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6042 states, 5728 states have (on average 3.6522346368715084) internal successors, (20920), 6041 states have internal predecessors, (20920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20920 transitions. [2022-11-16 11:58:55,960 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20920 transitions. Word has length 6 [2022-11-16 11:58:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:58:55,961 INFO L495 AbstractCegarLoop]: Abstraction has 6042 states and 20920 transitions. [2022-11-16 11:58:55,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20920 transitions. [2022-11-16 11:58:55,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:58:55,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:58:55,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:58:55,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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)] Ended with exit code 0 [2022-11-16 11:58:56,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:58:56,178 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:58:56,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:58:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1788292700, now seen corresponding path program 1 times [2022-11-16 11:58:56,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:58:56,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065708134] [2022-11-16 11:58:56,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:56,180 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-16 11:58:56,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:58:56,182 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:58:56,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:58:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:56,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:58:56,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:58:56,461 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-16 11:58:56,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:58:56,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:58:56,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065708134] [2022-11-16 11:58:56,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065708134] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:58:56,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:58:56,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:58:56,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337725367] [2022-11-16 11:58:56,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:58:56,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:58:56,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:58:56,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:58:56,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:58:56,469 INFO L87 Difference]: Start difference. First operand 6042 states and 20920 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-16 11:58:57,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:58:57,159 INFO L93 Difference]: Finished difference Result 7638 states and 26489 transitions. [2022-11-16 11:58:57,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:58:57,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-16 11:58:57,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:58:57,228 INFO L225 Difference]: With dead ends: 7638 [2022-11-16 11:58:57,229 INFO L226 Difference]: Without dead ends: 7638 [2022-11-16 11:58:57,229 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-16 11:58:57,231 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 27 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:58:57,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:58:57,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7638 states. [2022-11-16 11:58:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7638 to 6462. [2022-11-16 11:58:57,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6462 states, 6164 states have (on average 3.814243997404283) internal successors, (23511), 6461 states have internal predecessors, (23511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6462 states to 6462 states and 23511 transitions. [2022-11-16 11:58:58,102 INFO L78 Accepts]: Start accepts. Automaton has 6462 states and 23511 transitions. Word has length 7 [2022-11-16 11:58:58,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:58:58,103 INFO L495 AbstractCegarLoop]: Abstraction has 6462 states and 23511 transitions. [2022-11-16 11:58:58,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-16 11:58:58,108 INFO L276 IsEmpty]: Start isEmpty. Operand 6462 states and 23511 transitions. [2022-11-16 11:58:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:58:58,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:58:58,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:58:58,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-16 11:58:58,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:58:58,324 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:58:58,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:58:58,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1788292698, now seen corresponding path program 1 times [2022-11-16 11:58:58,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:58:58,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132391382] [2022-11-16 11:58:58,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:58,326 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-16 11:58:58,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:58:58,330 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:58:58,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:58:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:58,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:58:58,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:58:58,717 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:58:58,718 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-16 11:58:58,805 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 11:58:58,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 11:58:58,858 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-16 11:58:58,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:58:58,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:58:58,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132391382] [2022-11-16 11:58:58,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132391382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:58:58,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:58:58,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:58:58,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162706114] [2022-11-16 11:58:58,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:58:58,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:58:58,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:58:58,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:58:58,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:58:58,862 INFO L87 Difference]: Start difference. First operand 6462 states and 23511 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-16 11:58:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:58:59,214 INFO L93 Difference]: Finished difference Result 4066 states and 14358 transitions. [2022-11-16 11:58:59,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:58:59,216 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-16 11:58:59,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:58:59,245 INFO L225 Difference]: With dead ends: 4066 [2022-11-16 11:58:59,245 INFO L226 Difference]: Without dead ends: 4066 [2022-11-16 11:58:59,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:58:59,248 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 24 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:58:59,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:58:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4066 states. [2022-11-16 11:58:59,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4066 to 4066. [2022-11-16 11:58:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4066 states, 3939 states have (on average 3.645087585681645) internal successors, (14358), 4065 states have internal predecessors, (14358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:58:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4066 states to 4066 states and 14358 transitions. [2022-11-16 11:58:59,584 INFO L78 Accepts]: Start accepts. Automaton has 4066 states and 14358 transitions. Word has length 7 [2022-11-16 11:58:59,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:58:59,584 INFO L495 AbstractCegarLoop]: Abstraction has 4066 states and 14358 transitions. [2022-11-16 11:58:59,585 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-16 11:58:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 4066 states and 14358 transitions. [2022-11-16 11:58:59,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:58:59,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:58:59,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:58:59,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:58:59,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:58:59,802 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:58:59,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:58:59,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1788292697, now seen corresponding path program 1 times [2022-11-16 11:58:59,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:58:59,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382274385] [2022-11-16 11:58:59,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:59,804 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-16 11:58:59,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:58:59,806 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:58:59,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:00,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 11:59:00,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:59:00,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:00,115 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-16 11:59:00,198 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:59:00,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 11:59:00,274 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-16 11:59:00,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:59:00,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:59:00,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382274385] [2022-11-16 11:59:00,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382274385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:00,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:00,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:59:00,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215753521] [2022-11-16 11:59:00,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:00,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:59:00,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:59:00,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:59:00,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:59:00,278 INFO L87 Difference]: Start difference. First operand 4066 states and 14358 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-16 11:59:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:00,552 INFO L93 Difference]: Finished difference Result 1910 states and 6361 transitions. [2022-11-16 11:59:00,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:59:00,556 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-16 11:59:00,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:00,572 INFO L225 Difference]: With dead ends: 1910 [2022-11-16 11:59:00,573 INFO L226 Difference]: Without dead ends: 1910 [2022-11-16 11:59:00,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:59:00,576 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:00,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:59:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2022-11-16 11:59:00,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1818. [2022-11-16 11:59:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1792 states have (on average 3.3839285714285716) internal successors, (6064), 1817 states have internal predecessors, (6064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:00,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 6064 transitions. [2022-11-16 11:59:00,669 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 6064 transitions. Word has length 7 [2022-11-16 11:59:00,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:00,669 INFO L495 AbstractCegarLoop]: Abstraction has 1818 states and 6064 transitions. [2022-11-16 11:59:00,670 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-16 11:59:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 6064 transitions. [2022-11-16 11:59:00,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 11:59:00,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:00,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:00,694 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:00,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:00,894 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:59:00,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:00,895 INFO L85 PathProgramCache]: Analyzing trace with hash -528990438, now seen corresponding path program 1 times [2022-11-16 11:59:00,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:59:00,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536668363] [2022-11-16 11:59:00,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:00,898 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-16 11:59:00,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:59:00,905 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:00,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:01,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:59:01,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:59:01,241 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-16 11:59:01,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:59:01,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:59:01,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536668363] [2022-11-16 11:59:01,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536668363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:01,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:01,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:59:01,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860554661] [2022-11-16 11:59:01,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:01,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:59:01,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:59:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:59:01,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:59:01,245 INFO L87 Difference]: Start difference. First operand 1818 states and 6064 transitions. Second operand has 3 states, 3 states have (on average 3.0) 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-16 11:59:01,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:01,531 INFO L93 Difference]: Finished difference Result 921 states and 2488 transitions. [2022-11-16 11:59:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:59:01,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) 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-16 11:59:01,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:01,538 INFO L225 Difference]: With dead ends: 921 [2022-11-16 11:59:01,538 INFO L226 Difference]: Without dead ends: 921 [2022-11-16 11:59:01,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:59:01,540 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:01,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:59:01,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-11-16 11:59:01,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2022-11-16 11:59:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 895 states have (on average 2.7798882681564248) internal successors, (2488), 920 states have internal predecessors, (2488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 2488 transitions. [2022-11-16 11:59:01,582 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 2488 transitions. Word has length 9 [2022-11-16 11:59:01,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:01,582 INFO L495 AbstractCegarLoop]: Abstraction has 921 states and 2488 transitions. [2022-11-16 11:59:01,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) 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-16 11:59:01,583 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 2488 transitions. [2022-11-16 11:59:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:59:01,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:01,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:01,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:01,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:01,812 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:59:01,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:01,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1044528326, now seen corresponding path program 1 times [2022-11-16 11:59:01,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:59:01,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715015064] [2022-11-16 11:59:01,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:01,813 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-16 11:59:01,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:59:01,815 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:01,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:02,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:59:02,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:59:02,168 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-16 11:59:02,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:59:02,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:59:02,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715015064] [2022-11-16 11:59:02,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715015064] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:02,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:02,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:59:02,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736997629] [2022-11-16 11:59:02,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:02,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:59:02,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:59:02,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:59:02,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:59:02,173 INFO L87 Difference]: Start difference. First operand 921 states and 2488 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-16 11:59:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:02,527 INFO L93 Difference]: Finished difference Result 310 states and 671 transitions. [2022-11-16 11:59:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:59:02,528 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-16 11:59:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:02,530 INFO L225 Difference]: With dead ends: 310 [2022-11-16 11:59:02,530 INFO L226 Difference]: Without dead ends: 310 [2022-11-16 11:59:02,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-16 11:59:02,532 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:02,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 8 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:59:02,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-11-16 11:59:02,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2022-11-16 11:59:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 296 states have (on average 2.266891891891892) internal successors, (671), 309 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 671 transitions. [2022-11-16 11:59:02,545 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 671 transitions. Word has length 12 [2022-11-16 11:59:02,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:02,545 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 671 transitions. [2022-11-16 11:59:02,545 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-16 11:59:02,546 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 671 transitions. [2022-11-16 11:59:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:59:02,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:02,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:02,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:02,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:02,762 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:59:02,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:02,763 INFO L85 PathProgramCache]: Analyzing trace with hash 653085253, now seen corresponding path program 1 times [2022-11-16 11:59:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:59:02,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077169313] [2022-11-16 11:59:02,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:02,764 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-16 11:59:02,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:59:02,767 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:02,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:03,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:59:03,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:59:03,159 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-16 11:59:03,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:59:03,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:59:03,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077169313] [2022-11-16 11:59:03,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077169313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:03,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:03,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:59:03,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838709643] [2022-11-16 11:59:03,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:03,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:59:03,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:59:03,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:59:03,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:59:03,164 INFO L87 Difference]: Start difference. First operand 310 states and 671 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:03,693 INFO L93 Difference]: Finished difference Result 179 states and 413 transitions. [2022-11-16 11:59:03,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:59:03,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 11:59:03,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:03,695 INFO L225 Difference]: With dead ends: 179 [2022-11-16 11:59:03,695 INFO L226 Difference]: Without dead ends: 179 [2022-11-16 11:59:03,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-16 11:59:03,697 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:03,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 18 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:59:03,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-16 11:59:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-11-16 11:59:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 175 states have (on average 2.36) internal successors, (413), 178 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 413 transitions. [2022-11-16 11:59:03,704 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 413 transitions. Word has length 16 [2022-11-16 11:59:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:03,705 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 413 transitions. [2022-11-16 11:59:03,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 413 transitions. [2022-11-16 11:59:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:59:03,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:03,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:03,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:03,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:03,923 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:59:03,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:03,923 INFO L85 PathProgramCache]: Analyzing trace with hash 562411206, now seen corresponding path program 1 times [2022-11-16 11:59:03,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:59:03,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892812271] [2022-11-16 11:59:03,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:03,924 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-16 11:59:03,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:59:03,926 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:03,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-16 11:59:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:04,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:59:04,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:59:04,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:59:10,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2022-11-16 11:59:10,522 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-16 11:59:10,557 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-16 11:59:10,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:59:10,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:59:10,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892812271] [2022-11-16 11:59:10,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892812271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:10,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:10,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:59:10,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011614283] [2022-11-16 11:59:10,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:10,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:59:10,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:59:10,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:59:10,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:59:10,561 INFO L87 Difference]: Start difference. First operand 179 states and 413 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:11,123 INFO L93 Difference]: Finished difference Result 231 states and 522 transitions. [2022-11-16 11:59:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:59:11,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 11:59:11,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:11,124 INFO L225 Difference]: With dead ends: 231 [2022-11-16 11:59:11,125 INFO L226 Difference]: Without dead ends: 231 [2022-11-16 11:59:11,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:59:11,126 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 36 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:11,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 16 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:59:11,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-16 11:59:11,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 178. [2022-11-16 11:59:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 175 states have (on average 2.354285714285714) internal successors, (412), 177 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:11,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 412 transitions. [2022-11-16 11:59:11,133 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 412 transitions. Word has length 20 [2022-11-16 11:59:11,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:11,134 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 412 transitions. [2022-11-16 11:59:11,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:11,134 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 412 transitions. [2022-11-16 11:59:11,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:59:11,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:11,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:11,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:59:11,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:11,351 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:59:11,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:11,352 INFO L85 PathProgramCache]: Analyzing trace with hash 562411207, now seen corresponding path program 1 times [2022-11-16 11:59:11,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:59:11,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921699758] [2022-11-16 11:59:11,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:11,353 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-16 11:59:11,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:59:11,354 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:11,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 11:59:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:11,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:59:11,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:59:11,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:59:30,102 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-16 11:59:30,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2022-11-16 11:59:30,290 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-16 11:59:30,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:59:30,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:59:30,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921699758] [2022-11-16 11:59:30,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921699758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:30,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:30,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:59:30,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482547255] [2022-11-16 11:59:30,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:30,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:59:30,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:59:30,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:59:30,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:59:30,293 INFO L87 Difference]: Start difference. First operand 178 states and 412 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:30,693 INFO L93 Difference]: Finished difference Result 229 states and 520 transitions. [2022-11-16 11:59:30,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:59:30,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 11:59:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:30,694 INFO L225 Difference]: With dead ends: 229 [2022-11-16 11:59:30,694 INFO L226 Difference]: Without dead ends: 229 [2022-11-16 11:59:30,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:59:30,695 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 74 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:30,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 16 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:59:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-11-16 11:59:30,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 177. [2022-11-16 11:59:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 2.3485714285714288) internal successors, (411), 176 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 411 transitions. [2022-11-16 11:59:30,701 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 411 transitions. Word has length 20 [2022-11-16 11:59:30,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:30,702 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 411 transitions. [2022-11-16 11:59:30,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 411 transitions. [2022-11-16 11:59:30,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 11:59:30,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:30,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:30,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:59:30,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:30,906 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:59:30,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:30,907 INFO L85 PathProgramCache]: Analyzing trace with hash 254874640, now seen corresponding path program 1 times [2022-11-16 11:59:30,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:59:30,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455245627] [2022-11-16 11:59:30,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:30,907 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-16 11:59:30,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:59:30,909 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:30,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-16 11:59:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:31,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:59:31,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:59:31,219 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-16 11:59:31,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:59:31,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:59:31,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455245627] [2022-11-16 11:59:31,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455245627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:31,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:31,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:59:31,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136933171] [2022-11-16 11:59:31,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:31,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:59:31,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:59:31,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:59:31,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:59:31,222 INFO L87 Difference]: Start difference. First operand 177 states and 411 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:31,411 INFO L93 Difference]: Finished difference Result 228 states and 513 transitions. [2022-11-16 11:59:31,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:59:31,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 11:59:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:31,413 INFO L225 Difference]: With dead ends: 228 [2022-11-16 11:59:31,413 INFO L226 Difference]: Without dead ends: 228 [2022-11-16 11:59:31,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-16 11:59:31,414 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:31,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:59:31,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-16 11:59:31,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2022-11-16 11:59:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 222 states have (on average 2.2972972972972974) internal successors, (510), 223 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 510 transitions. [2022-11-16 11:59:31,420 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 510 transitions. Word has length 21 [2022-11-16 11:59:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:31,421 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 510 transitions. [2022-11-16 11:59:31,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 510 transitions. [2022-11-16 11:59:31,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 11:59:31,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:31,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:31,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-16 11:59:31,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:31,635 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:59:31,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:31,636 INFO L85 PathProgramCache]: Analyzing trace with hash 968407540, now seen corresponding path program 2 times [2022-11-16 11:59:31,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:59:31,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674661789] [2022-11-16 11:59:31,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:59:31,636 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-16 11:59:31,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:59:31,637 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:31,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-16 11:59:31,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 11:59:31,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:59:31,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:59:31,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:59:31,961 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-16 11:59:31,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:59:31,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:59:31,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674661789] [2022-11-16 11:59:31,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674661789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:31,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:31,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:59:31,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760183432] [2022-11-16 11:59:31,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:31,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:59:31,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:59:31,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:59:31,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:59:31,963 INFO L87 Difference]: Start difference. First operand 224 states and 510 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:32,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:32,216 INFO L93 Difference]: Finished difference Result 320 states and 701 transitions. [2022-11-16 11:59:32,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:59:32,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 11:59:32,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:32,218 INFO L225 Difference]: With dead ends: 320 [2022-11-16 11:59:32,218 INFO L226 Difference]: Without dead ends: 320 [2022-11-16 11:59:32,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-16 11:59:32,219 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:32,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:59:32,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-11-16 11:59:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 212. [2022-11-16 11:59:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 210 states have (on average 2.2904761904761903) internal successors, (481), 211 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:32,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 481 transitions. [2022-11-16 11:59:32,226 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 481 transitions. Word has length 21 [2022-11-16 11:59:32,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:32,226 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 481 transitions. [2022-11-16 11:59:32,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:59:32,227 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 481 transitions. [2022-11-16 11:59:32,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 11:59:32,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:32,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:32,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-16 11:59:32,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:32,447 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-11-16 11:59:32,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:32,447 INFO L85 PathProgramCache]: Analyzing trace with hash -597459370, now seen corresponding path program 3 times [2022-11-16 11:59:32,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:59:32,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881317015] [2022-11-16 11:59:32,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:59:32,448 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-16 11:59:32,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:59:32,449 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:32,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-16 11:59:32,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 11:59:32,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 11:59:32,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:59:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:59:33,125 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-16 11:59:33,126 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:59:33,127 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (66 of 67 remaining) [2022-11-16 11:59:33,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (65 of 67 remaining) [2022-11-16 11:59:33,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 67 remaining) [2022-11-16 11:59:33,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 67 remaining) [2022-11-16 11:59:33,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 67 remaining) [2022-11-16 11:59:33,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 67 remaining) [2022-11-16 11:59:33,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 67 remaining) [2022-11-16 11:59:33,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 67 remaining) [2022-11-16 11:59:33,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 67 remaining) [2022-11-16 11:59:33,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 67 remaining) [2022-11-16 11:59:33,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 67 remaining) [2022-11-16 11:59:33,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 67 remaining) [2022-11-16 11:59:33,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 67 remaining) [2022-11-16 11:59:33,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 67 remaining) [2022-11-16 11:59:33,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 67 remaining) [2022-11-16 11:59:33,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 67 remaining) [2022-11-16 11:59:33,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 67 remaining) [2022-11-16 11:59:33,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 67 remaining) [2022-11-16 11:59:33,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 67 remaining) [2022-11-16 11:59:33,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 67 remaining) [2022-11-16 11:59:33,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 67 remaining) [2022-11-16 11:59:33,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 67 remaining) [2022-11-16 11:59:33,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 67 remaining) [2022-11-16 11:59:33,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 67 remaining) [2022-11-16 11:59:33,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 67 remaining) [2022-11-16 11:59:33,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 67 remaining) [2022-11-16 11:59:33,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 67 remaining) [2022-11-16 11:59:33,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 67 remaining) [2022-11-16 11:59:33,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 67 remaining) [2022-11-16 11:59:33,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 67 remaining) [2022-11-16 11:59:33,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 67 remaining) [2022-11-16 11:59:33,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 67 remaining) [2022-11-16 11:59:33,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 67 remaining) [2022-11-16 11:59:33,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 67 remaining) [2022-11-16 11:59:33,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 67 remaining) [2022-11-16 11:59:33,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 67 remaining) [2022-11-16 11:59:33,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 67 remaining) [2022-11-16 11:59:33,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 67 remaining) [2022-11-16 11:59:33,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (28 of 67 remaining) [2022-11-16 11:59:33,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 67 remaining) [2022-11-16 11:59:33,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 67 remaining) [2022-11-16 11:59:33,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 67 remaining) [2022-11-16 11:59:33,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 67 remaining) [2022-11-16 11:59:33,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 67 remaining) [2022-11-16 11:59:33,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 67 remaining) [2022-11-16 11:59:33,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 67 remaining) [2022-11-16 11:59:33,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 67 remaining) [2022-11-16 11:59:33,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 67 remaining) [2022-11-16 11:59:33,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 67 remaining) [2022-11-16 11:59:33,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 67 remaining) [2022-11-16 11:59:33,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 67 remaining) [2022-11-16 11:59:33,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 67 remaining) [2022-11-16 11:59:33,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 67 remaining) [2022-11-16 11:59:33,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 67 remaining) [2022-11-16 11:59:33,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 67 remaining) [2022-11-16 11:59:33,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 67 remaining) [2022-11-16 11:59:33,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 67 remaining) [2022-11-16 11:59:33,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 67 remaining) [2022-11-16 11:59:33,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 67 remaining) [2022-11-16 11:59:33,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 67 remaining) [2022-11-16 11:59:33,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 67 remaining) [2022-11-16 11:59:33,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 67 remaining) [2022-11-16 11:59:33,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 67 remaining) [2022-11-16 11:59:33,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 67 remaining) [2022-11-16 11:59:33,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 67 remaining) [2022-11-16 11:59:33,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 67 remaining) [2022-11-16 11:59:33,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 67 remaining) [2022-11-16 11:59:33,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:59:33,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/mathsat -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-16 11:59:33,365 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:33,372 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:59:33,373 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:59:33,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:59:33 BasicIcfg [2022-11-16 11:59:33,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:59:33,525 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:59:33,525 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:59:33,526 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:59:33,526 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:57:54" (3/4) ... [2022-11-16 11:59:33,530 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:59:33,530 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:59:33,531 INFO L158 Benchmark]: Toolchain (without parser) took 101601.24ms. Allocated memory was 71.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 51.7MB in the beginning and 891.9MB in the end (delta: -840.2MB). Peak memory consumption was 699.6MB. Max. memory is 16.1GB. [2022-11-16 11:59:33,531 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 71.3MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:59:33,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 806.03ms. Allocated memory is still 71.3MB. Free memory was 51.5MB in the beginning and 40.9MB in the end (delta: 10.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 11:59:33,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.38ms. Allocated memory is still 71.3MB. Free memory was 40.9MB in the beginning and 38.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:59:33,533 INFO L158 Benchmark]: Boogie Preprocessor took 41.13ms. Allocated memory is still 71.3MB. Free memory was 38.3MB in the beginning and 35.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:59:33,537 INFO L158 Benchmark]: RCFGBuilder took 1845.25ms. Allocated memory was 71.3MB in the beginning and 107.0MB in the end (delta: 35.7MB). Free memory was 35.7MB in the beginning and 62.7MB in the end (delta: -26.9MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2022-11-16 11:59:33,538 INFO L158 Benchmark]: TraceAbstraction took 98801.53ms. Allocated memory was 107.0MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 61.7MB in the beginning and 891.9MB in the end (delta: -830.1MB). Peak memory consumption was 673.4MB. Max. memory is 16.1GB. [2022-11-16 11:59:33,538 INFO L158 Benchmark]: Witness Printer took 5.13ms. Allocated memory is still 1.6GB. Free memory is still 891.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:59:33,547 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.31ms. Allocated memory is still 71.3MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 806.03ms. Allocated memory is still 71.3MB. Free memory was 51.5MB in the beginning and 40.9MB in the end (delta: 10.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.38ms. Allocated memory is still 71.3MB. Free memory was 40.9MB in the beginning and 38.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.13ms. Allocated memory is still 71.3MB. Free memory was 38.3MB in the beginning and 35.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1845.25ms. Allocated memory was 71.3MB in the beginning and 107.0MB in the end (delta: 35.7MB). Free memory was 35.7MB in the beginning and 62.7MB in the end (delta: -26.9MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. * TraceAbstraction took 98801.53ms. Allocated memory was 107.0MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 61.7MB in the beginning and 891.9MB in the end (delta: -830.1MB). Peak memory consumption was 673.4MB. Max. memory is 16.1GB. * Witness Printer took 5.13ms. Allocated memory is still 1.6GB. Free memory is still 891.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 56.2s, 183 PlacesBefore, 76 PlacesAfterwards, 175 TransitionsBefore, 66 TransitionsAfterwards, 5328 CoEnabledTransitionPairs, 7 FixpointIterations, 73 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 160 TotalNumberOfCompositions, 21294 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9164, independent: 8745, independent conditional: 0, independent unconditional: 8745, dependent: 389, dependent conditional: 0, dependent unconditional: 389, unknown: 30, unknown conditional: 0, unknown unconditional: 30] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3315, independent: 3220, independent conditional: 0, independent unconditional: 3220, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3315, independent: 3027, independent conditional: 0, independent unconditional: 3027, dependent: 288, dependent conditional: 0, dependent unconditional: 288, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 288, independent: 193, independent conditional: 0, independent unconditional: 193, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7549, independent: 1238, independent conditional: 0, independent unconditional: 1238, dependent: 2009, dependent conditional: 0, dependent unconditional: 2009, unknown: 4302, unknown conditional: 0, unknown unconditional: 4302] ], Cache Queries: [ total: 9164, independent: 5525, independent conditional: 0, independent unconditional: 5525, dependent: 299, dependent conditional: 0, dependent unconditional: 299, unknown: 3340, unknown conditional: 0, unknown unconditional: 3340] , Statistics on independence cache: Total cache size (in pairs): 769, Positive cache size: 725, Positive conditional cache size: 0, Positive unconditional cache size: 725, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L750] 0 int y$w_buff0; [L752] 0 int y$w_buff1; [L739] 0 int y$mem_tmp; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L748] 0 _Bool y$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L709] 0 int __unbuffered_cnt = 0; [L753] 0 _Bool y$w_buff1_used; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L749] 0 int *y$read_delayed_var; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L711] 0 int __unbuffered_p0_EAX = 0; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L715] 0 int __unbuffered_p2_EAX = 0; [L738] 0 _Bool y$flush_delayed; [L713] 0 int __unbuffered_p0_EBX = 0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L733] 0 _Bool main$tmp_guard1; [L732] 0 _Bool main$tmp_guard0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L751] 0 _Bool y$w_buff0_used; [L735] 0 int x = 0; [L744] 0 _Bool y$r_buff1_thd0; [L737] 0 int y = 0; [L746] 0 _Bool y$r_buff1_thd2; [L755] 0 int z = 0; [L745] 0 _Bool y$r_buff1_thd1; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L747] 0 _Bool y$r_buff1_thd3; [L850] 0 pthread_t t2052; [L851] FCALL, FORK 0 pthread_create(&t2052, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2052, ((void *)0), P0, ((void *)0))=0, t2052={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t2053; [L853] FCALL, FORK 0 pthread_create(&t2053, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2053, ((void *)0), P1, ((void *)0))=1, t2052={15:0}, t2053={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] 0 pthread_t t2054; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2052={15:0}, t2053={5:0}, t2054={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L855] FCALL, FORK 0 pthread_create(&t2054, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2054, ((void *)0), P2, ((void *)0))=2, t2052={15:0}, t2053={5:0}, t2054={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] EXPR 3 \read(y) [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=34, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=34, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=34, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L762] 1 __unbuffered_p0_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=34, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 1 __unbuffered_p0_EBX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=34, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L772] 1 return 0; [L777] 2 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=34, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=34, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L792] 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) [L792] 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) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 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 [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=34, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] 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) [L861] 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) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 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 [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052={15:0}, t2053={5:0}, t2054={7:0}, weak$$choice0=34, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=34, weak$$choice1=2, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 225 locations, 67 error locations. Started 1 CEGAR loops. OverallTime: 98.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 57.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 316 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 316 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1025 IncrementalHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 42 mSDtfsCounter, 1025 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15204occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 1485 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 25.7s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 691 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1612 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-16 11:59:33,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a9b72d6-f895-4248-bbc7-8d8728e988e8/bin/uautomizer-tPACEb0tL8/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