./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe020_power.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b 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_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe020_power.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro --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 cd91eb07499c204f7750c4a87fd11eb7780a100da5928fd001cd5e1a53feff12 --- 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-8393723 [2022-11-18 18:33:49,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:33:49,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:33:49,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:33:49,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:33:49,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:33:49,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:33:49,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:33:49,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:33:49,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:33:49,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:33:49,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:33:49,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:33:49,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:33:49,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:33:49,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:33:49,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:33:49,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:33:49,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:33:49,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:33:49,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:33:49,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:33:49,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:33:49,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:33:49,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:33:49,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:33:49,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:33:49,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:33:49,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:33:49,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:33:49,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:33:49,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:33:49,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:33:49,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:33:49,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:33:49,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:33:49,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:33:49,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:33:49,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:33:49,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:33:49,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:33:49,494 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 18:33:49,516 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:33:49,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:33:49,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:33:49,517 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:33:49,518 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:33:49,518 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:33:49,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:33:49,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:33:49,519 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:33:49,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:33:49,520 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 18:33:49,520 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 18:33:49,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:33:49,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 18:33:49,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:33:49,521 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 18:33:49,521 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 18:33:49,521 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 18:33:49,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:33:49,522 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 18:33:49,522 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 18:33:49,522 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:33:49,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:33:49,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:33:49,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:33:49,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:33:49,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:33:49,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:33:49,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 18:33:49,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 18:33:49,524 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_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/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_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro 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 -> cd91eb07499c204f7750c4a87fd11eb7780a100da5928fd001cd5e1a53feff12 [2022-11-18 18:33:49,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:33:49,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:33:49,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:33:49,832 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:33:49,832 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:33:49,834 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/safe020_power.i [2022-11-18 18:33:49,921 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/data/d48ebf66a/9dd80a56fecf4a7d85b42a718c7b3d3e/FLAGc2c0c4217 [2022-11-18 18:33:50,587 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:33:50,587 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/sv-benchmarks/c/pthread-wmm/safe020_power.i [2022-11-18 18:33:50,614 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/data/d48ebf66a/9dd80a56fecf4a7d85b42a718c7b3d3e/FLAGc2c0c4217 [2022-11-18 18:33:50,832 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/data/d48ebf66a/9dd80a56fecf4a7d85b42a718c7b3d3e [2022-11-18 18:33:50,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:33:50,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:33:50,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:33:50,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:33:50,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:33:50,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:33:50" (1/1) ... [2022-11-18 18:33:50,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1687b436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:50, skipping insertion in model container [2022-11-18 18:33:50,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:33:50" (1/1) ... [2022-11-18 18:33:50,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:33:50,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:33:51,098 WARN L234 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_600d1020-fb47-4773-b8b0-4975716f5f2c/sv-benchmarks/c/pthread-wmm/safe020_power.i[990,1003] [2022-11-18 18:33:51,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:33:51,388 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:33:51,415 WARN L234 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_600d1020-fb47-4773-b8b0-4975716f5f2c/sv-benchmarks/c/pthread-wmm/safe020_power.i[990,1003] [2022-11-18 18:33:51,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:33:51,545 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:33:51,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:51 WrapperNode [2022-11-18 18:33:51,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:33:51,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:33:51,548 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:33:51,549 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:33:51,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:51" (1/1) ... [2022-11-18 18:33:51,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:51" (1/1) ... [2022-11-18 18:33:51,635 INFO L138 Inliner]: procedures = 176, calls = 77, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-11-18 18:33:51,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:33:51,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:33:51,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:33:51,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:33:51,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:51" (1/1) ... [2022-11-18 18:33:51,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:51" (1/1) ... [2022-11-18 18:33:51,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:51" (1/1) ... [2022-11-18 18:33:51,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:51" (1/1) ... [2022-11-18 18:33:51,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:51" (1/1) ... [2022-11-18 18:33:51,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:51" (1/1) ... [2022-11-18 18:33:51,678 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:51" (1/1) ... [2022-11-18 18:33:51,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:51" (1/1) ... [2022-11-18 18:33:51,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:33:51,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:33:51,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:33:51,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:33:51,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:51" (1/1) ... [2022-11-18 18:33:51,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:33:51,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:33:51,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:33:51,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:33:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 18:33:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 18:33:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 18:33:51,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 18:33:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 18:33:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 18:33:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 18:33:51,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 18:33:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 18:33:51,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 18:33:51,765 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 18:33:51,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 18:33:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 18:33:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 18:33:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:33:51,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:33:51,768 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 18:33:52,000 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:33:52,003 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:33:52,550 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:33:53,289 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:33:53,289 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 18:33:53,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:33:53 BoogieIcfgContainer [2022-11-18 18:33:53,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:33:53,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:33:53,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:33:53,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:33:53,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:33:50" (1/3) ... [2022-11-18 18:33:53,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d169c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:33:53, skipping insertion in model container [2022-11-18 18:33:53,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:51" (2/3) ... [2022-11-18 18:33:53,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d169c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:33:53, skipping insertion in model container [2022-11-18 18:33:53,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:33:53" (3/3) ... [2022-11-18 18:33:53,303 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_power.i [2022-11-18 18:33:53,323 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:33:53,323 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations. [2022-11-18 18:33:53,324 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 18:33:53,503 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 18:33:53,551 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 18:33:53,568 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 183 transitions, 381 flow [2022-11-18 18:33:53,572 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 183 transitions, 381 flow [2022-11-18 18:33:53,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 183 transitions, 381 flow [2022-11-18 18:33:53,712 INFO L130 PetriNetUnfolder]: 2/180 cut-off events. [2022-11-18 18:33:53,713 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 18:33:53,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 180 events. 2/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 296 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-11-18 18:33:53,726 INFO L119 LiptonReduction]: Number of co-enabled transitions 7512 [2022-11-18 18:34:17,124 INFO L134 LiptonReduction]: Checked pairs total: 34351 [2022-11-18 18:34:17,124 INFO L136 LiptonReduction]: Total number of compositions: 182 [2022-11-18 18:34:17,139 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 79 transitions, 173 flow [2022-11-18 18:34:19,268 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:19,288 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:34:19,295 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;@37a0788a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:34:19,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2022-11-18 18:34:19,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 18:34:19,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:19,390 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 18:34:19,391 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:19,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:19,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1231, now seen corresponding path program 1 times [2022-11-18 18:34:19,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:19,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404077655] [2022-11-18 18:34:19,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:19,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:19,706 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-18 18:34:19,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:19,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404077655] [2022-11-18 18:34:19,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404077655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:19,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:19,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 18:34:19,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309809153] [2022-11-18 18:34:19,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:19,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 18:34:19,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:19,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 18:34:19,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 18:34:19,812 INFO L87 Difference]: Start difference. First operand has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 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-18 18:34:20,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:20,148 INFO L93 Difference]: Finished difference Result 9084 states and 32205 transitions. [2022-11-18 18:34:20,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 18:34:20,152 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-18 18:34:20,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:20,256 INFO L225 Difference]: With dead ends: 9084 [2022-11-18 18:34:20,257 INFO L226 Difference]: Without dead ends: 9084 [2022-11-18 18:34:20,258 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-18 18:34:20,262 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:20,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:34:20,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9084 states. [2022-11-18 18:34:20,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9084 to 9084. [2022-11-18 18:34:20,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9084 states, 7951 states have (on average 4.050433907684568) internal successors, (32205), 9083 states have internal predecessors, (32205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9084 states to 9084 states and 32205 transitions. [2022-11-18 18:34:20,991 INFO L78 Accepts]: Start accepts. Automaton has 9084 states and 32205 transitions. Word has length 1 [2022-11-18 18:34:20,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:20,992 INFO L495 AbstractCegarLoop]: Abstraction has 9084 states and 32205 transitions. [2022-11-18 18:34:20,993 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-18 18:34:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 9084 states and 32205 transitions. [2022-11-18 18:34:20,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 18:34:20,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:20,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 18:34:20,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 18:34:20,994 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:20,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:20,995 INFO L85 PathProgramCache]: Analyzing trace with hash 37655887, now seen corresponding path program 1 times [2022-11-18 18:34:20,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:20,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545523381] [2022-11-18 18:34:20,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:20,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:21,352 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-18 18:34:21,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:21,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545523381] [2022-11-18 18:34:21,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545523381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:21,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:21,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 18:34:21,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925880161] [2022-11-18 18:34:21,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:21,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:34:21,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:21,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:34:21,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:34:21,364 INFO L87 Difference]: Start difference. First operand 9084 states and 32205 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:21,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:21,755 INFO L93 Difference]: Finished difference Result 6818 states and 22177 transitions. [2022-11-18 18:34:21,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:34:21,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-18 18:34:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:21,837 INFO L225 Difference]: With dead ends: 6818 [2022-11-18 18:34:21,837 INFO L226 Difference]: Without dead ends: 6818 [2022-11-18 18:34:21,845 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-18 18:34:21,846 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:21,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:34:21,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6818 states. [2022-11-18 18:34:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6818 to 6090. [2022-11-18 18:34:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6090 states, 5679 states have (on average 3.729705934143335) internal successors, (21181), 6089 states have internal predecessors, (21181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6090 states to 6090 states and 21181 transitions. [2022-11-18 18:34:22,387 INFO L78 Accepts]: Start accepts. Automaton has 6090 states and 21181 transitions. Word has length 4 [2022-11-18 18:34:22,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:22,388 INFO L495 AbstractCegarLoop]: Abstraction has 6090 states and 21181 transitions. [2022-11-18 18:34:22,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 6090 states and 21181 transitions. [2022-11-18 18:34:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 18:34:22,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:22,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 18:34:22,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 18:34:22,389 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:22,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:22,390 INFO L85 PathProgramCache]: Analyzing trace with hash 37655888, now seen corresponding path program 1 times [2022-11-18 18:34:22,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:22,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540188134] [2022-11-18 18:34:22,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:22,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:22,608 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-18 18:34:22,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:22,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540188134] [2022-11-18 18:34:22,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540188134] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:22,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:22,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 18:34:22,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557927134] [2022-11-18 18:34:22,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:22,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:34:22,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:22,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:34:22,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:34:22,612 INFO L87 Difference]: Start difference. First operand 6090 states and 21181 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:22,735 INFO L93 Difference]: Finished difference Result 2502 states and 7903 transitions. [2022-11-18 18:34:22,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:34:22,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-18 18:34:22,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:22,748 INFO L225 Difference]: With dead ends: 2502 [2022-11-18 18:34:22,748 INFO L226 Difference]: Without dead ends: 2452 [2022-11-18 18:34:22,749 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-18 18:34:22,752 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:22,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:34:22,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2022-11-18 18:34:22,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2452. [2022-11-18 18:34:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 2383 states have (on average 3.2459085186739403) internal successors, (7735), 2451 states have internal predecessors, (7735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 7735 transitions. [2022-11-18 18:34:22,839 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 7735 transitions. Word has length 4 [2022-11-18 18:34:22,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:22,839 INFO L495 AbstractCegarLoop]: Abstraction has 2452 states and 7735 transitions. [2022-11-18 18:34:22,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 7735 transitions. [2022-11-18 18:34:22,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 18:34:22,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:22,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 18:34:22,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 18:34:22,841 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:22,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:22,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1828104364, now seen corresponding path program 1 times [2022-11-18 18:34:22,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:22,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701014737] [2022-11-18 18:34:22,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:22,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:23,089 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-18 18:34:23,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:23,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701014737] [2022-11-18 18:34:23,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701014737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:23,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:23,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 18:34:23,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702900933] [2022-11-18 18:34:23,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:23,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:34:23,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:23,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:34:23,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:34:23,098 INFO L87 Difference]: Start difference. First operand 2452 states and 7735 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-18 18:34:23,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:23,258 INFO L93 Difference]: Finished difference Result 2076 states and 6397 transitions. [2022-11-18 18:34:23,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:34:23,259 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-18 18:34:23,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:23,269 INFO L225 Difference]: With dead ends: 2076 [2022-11-18 18:34:23,269 INFO L226 Difference]: Without dead ends: 2058 [2022-11-18 18:34:23,269 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-18 18:34:23,271 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:23,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:34:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2022-11-18 18:34:23,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2058. [2022-11-18 18:34:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2058 states, 2008 states have (on average 3.1658366533864544) internal successors, (6357), 2057 states have internal predecessors, (6357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 6357 transitions. [2022-11-18 18:34:23,335 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 6357 transitions. Word has length 6 [2022-11-18 18:34:23,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:23,336 INFO L495 AbstractCegarLoop]: Abstraction has 2058 states and 6357 transitions. [2022-11-18 18:34:23,337 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-18 18:34:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 6357 transitions. [2022-11-18 18:34:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 18:34:23,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:23,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:23,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 18:34:23,339 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1327123706, now seen corresponding path program 1 times [2022-11-18 18:34:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:23,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233640373] [2022-11-18 18:34:23,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:23,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:23,478 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-18 18:34:23,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:23,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233640373] [2022-11-18 18:34:23,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233640373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:23,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:23,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 18:34:23,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704315433] [2022-11-18 18:34:23,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:23,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:34:23,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:23,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:34:23,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:34:23,485 INFO L87 Difference]: Start difference. First operand 2058 states and 6357 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-18 18:34:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:23,630 INFO L93 Difference]: Finished difference Result 2026 states and 6245 transitions. [2022-11-18 18:34:23,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:34:23,633 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-18 18:34:23,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:23,647 INFO L225 Difference]: With dead ends: 2026 [2022-11-18 18:34:23,647 INFO L226 Difference]: Without dead ends: 2026 [2022-11-18 18:34:23,647 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-18 18:34:23,648 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 17 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:23,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:34:23,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2022-11-18 18:34:23,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2026. [2022-11-18 18:34:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2026 states, 1976 states have (on average 3.160425101214575) internal successors, (6245), 2025 states have internal predecessors, (6245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 6245 transitions. [2022-11-18 18:34:23,711 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 6245 transitions. Word has length 10 [2022-11-18 18:34:23,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:23,712 INFO L495 AbstractCegarLoop]: Abstraction has 2026 states and 6245 transitions. [2022-11-18 18:34:23,712 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-18 18:34:23,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 6245 transitions. [2022-11-18 18:34:23,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 18:34:23,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:23,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:23,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 18:34:23,714 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:23,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:23,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1808836714, now seen corresponding path program 1 times [2022-11-18 18:34:23,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:23,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236798777] [2022-11-18 18:34:23,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:23,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:23,872 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-18 18:34:23,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:23,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236798777] [2022-11-18 18:34:23,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236798777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:23,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:23,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 18:34:23,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905346395] [2022-11-18 18:34:23,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:23,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:34:23,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:23,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:34:23,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:34:23,874 INFO L87 Difference]: Start difference. First operand 2026 states and 6245 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-18 18:34:24,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:24,016 INFO L93 Difference]: Finished difference Result 2018 states and 6215 transitions. [2022-11-18 18:34:24,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:34:24,017 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-18 18:34:24,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:24,028 INFO L225 Difference]: With dead ends: 2018 [2022-11-18 18:34:24,029 INFO L226 Difference]: Without dead ends: 2018 [2022-11-18 18:34:24,029 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-18 18:34:24,030 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:24,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:34:24,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2022-11-18 18:34:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 2018. [2022-11-18 18:34:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2018 states, 1968 states have (on average 3.158028455284553) internal successors, (6215), 2017 states have internal predecessors, (6215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:24,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 6215 transitions. [2022-11-18 18:34:24,128 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 6215 transitions. Word has length 11 [2022-11-18 18:34:24,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:24,129 INFO L495 AbstractCegarLoop]: Abstraction has 2018 states and 6215 transitions. [2022-11-18 18:34:24,129 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-18 18:34:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 6215 transitions. [2022-11-18 18:34:24,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 18:34:24,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:24,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:24,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 18:34:24,136 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:24,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:24,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1808841146, now seen corresponding path program 1 times [2022-11-18 18:34:24,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:24,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396824612] [2022-11-18 18:34:24,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:24,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:24,875 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-18 18:34:24,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:24,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396824612] [2022-11-18 18:34:24,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396824612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:24,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:24,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:34:24,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950839293] [2022-11-18 18:34:24,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:24,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:34:24,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:24,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:34:24,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:34:24,878 INFO L87 Difference]: Start difference. First operand 2018 states and 6215 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:25,231 INFO L93 Difference]: Finished difference Result 3143 states and 9634 transitions. [2022-11-18 18:34:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:34:25,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-18 18:34:25,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:25,249 INFO L225 Difference]: With dead ends: 3143 [2022-11-18 18:34:25,249 INFO L226 Difference]: Without dead ends: 3143 [2022-11-18 18:34:25,250 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-18 18:34:25,250 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 50 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:25,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 4 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 18:34:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2022-11-18 18:34:25,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 2098. [2022-11-18 18:34:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2048 states have (on average 3.17919921875) internal successors, (6511), 2097 states have internal predecessors, (6511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 6511 transitions. [2022-11-18 18:34:25,343 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 6511 transitions. Word has length 11 [2022-11-18 18:34:25,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:25,344 INFO L495 AbstractCegarLoop]: Abstraction has 2098 states and 6511 transitions. [2022-11-18 18:34:25,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:25,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 6511 transitions. [2022-11-18 18:34:25,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 18:34:25,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:25,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:25,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 18:34:25,346 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:25,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:25,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1808841145, now seen corresponding path program 1 times [2022-11-18 18:34:25,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:25,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141240324] [2022-11-18 18:34:25,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:25,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:25,597 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-18 18:34:25,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:25,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141240324] [2022-11-18 18:34:25,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141240324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:25,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:25,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:34:25,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632736377] [2022-11-18 18:34:25,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:25,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:34:25,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:25,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:34:25,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:34:25,601 INFO L87 Difference]: Start difference. First operand 2098 states and 6511 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:25,754 INFO L93 Difference]: Finished difference Result 2362 states and 7095 transitions. [2022-11-18 18:34:25,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:34:25,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-18 18:34:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:25,767 INFO L225 Difference]: With dead ends: 2362 [2022-11-18 18:34:25,767 INFO L226 Difference]: Without dead ends: 2362 [2022-11-18 18:34:25,767 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-18 18:34:25,769 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:25,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:34:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-11-18 18:34:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2034. [2022-11-18 18:34:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 1985 states have (on average 3.1511335012594457) internal successors, (6255), 2033 states have internal predecessors, (6255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 6255 transitions. [2022-11-18 18:34:25,850 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 6255 transitions. Word has length 11 [2022-11-18 18:34:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:25,851 INFO L495 AbstractCegarLoop]: Abstraction has 2034 states and 6255 transitions. [2022-11-18 18:34:25,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 6255 transitions. [2022-11-18 18:34:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 18:34:25,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:25,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:25,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 18:34:25,854 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:25,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:25,854 INFO L85 PathProgramCache]: Analyzing trace with hash -633317488, now seen corresponding path program 1 times [2022-11-18 18:34:25,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:25,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181166794] [2022-11-18 18:34:25,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:25,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:26,545 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-18 18:34:26,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:26,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181166794] [2022-11-18 18:34:26,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181166794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:26,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:26,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:34:26,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920000830] [2022-11-18 18:34:26,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:26,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:34:26,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:26,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:34:26,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:34:26,547 INFO L87 Difference]: Start difference. First operand 2034 states and 6255 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-18 18:34:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:26,854 INFO L93 Difference]: Finished difference Result 3405 states and 10407 transitions. [2022-11-18 18:34:26,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:34:26,855 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-18 18:34:26,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:26,871 INFO L225 Difference]: With dead ends: 3405 [2022-11-18 18:34:26,871 INFO L226 Difference]: Without dead ends: 3405 [2022-11-18 18:34:26,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:34:26,873 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 63 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:26,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 7 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 18:34:26,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2022-11-18 18:34:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 2020. [2022-11-18 18:34:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 1971 states have (on average 3.1425672247590057) internal successors, (6194), 2019 states have internal predecessors, (6194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 6194 transitions. [2022-11-18 18:34:26,949 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 6194 transitions. Word has length 12 [2022-11-18 18:34:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:26,949 INFO L495 AbstractCegarLoop]: Abstraction has 2020 states and 6194 transitions. [2022-11-18 18:34:26,949 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-18 18:34:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 6194 transitions. [2022-11-18 18:34:26,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 18:34:26,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:26,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:26,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 18:34:26,951 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:26,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:26,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1038878338, now seen corresponding path program 1 times [2022-11-18 18:34:26,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:26,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817020412] [2022-11-18 18:34:26,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:26,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:27,301 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-18 18:34:27,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:27,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817020412] [2022-11-18 18:34:27,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817020412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:27,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:27,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:34:27,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138152434] [2022-11-18 18:34:27,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:27,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:34:27,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:27,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:34:27,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:34:27,303 INFO L87 Difference]: Start difference. First operand 2020 states and 6194 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-18 18:34:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:27,437 INFO L93 Difference]: Finished difference Result 2008 states and 6153 transitions. [2022-11-18 18:34:27,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:34:27,438 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-18 18:34:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:27,446 INFO L225 Difference]: With dead ends: 2008 [2022-11-18 18:34:27,447 INFO L226 Difference]: Without dead ends: 2008 [2022-11-18 18:34:27,447 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-18 18:34:27,448 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:27,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:34:27,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2022-11-18 18:34:27,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 2008. [2022-11-18 18:34:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2008 states, 1959 states have (on average 3.140888208269525) internal successors, (6153), 2007 states have internal predecessors, (6153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:27,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 6153 transitions. [2022-11-18 18:34:27,515 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 6153 transitions. Word has length 12 [2022-11-18 18:34:27,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:27,516 INFO L495 AbstractCegarLoop]: Abstraction has 2008 states and 6153 transitions. [2022-11-18 18:34:27,516 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-18 18:34:27,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 6153 transitions. [2022-11-18 18:34:27,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 18:34:27,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:27,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:27,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 18:34:27,518 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1529902473, now seen corresponding path program 1 times [2022-11-18 18:34:27,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:27,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885888699] [2022-11-18 18:34:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:27,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:27,904 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-18 18:34:27,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:27,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885888699] [2022-11-18 18:34:27,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885888699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:27,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:27,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:34:27,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304458713] [2022-11-18 18:34:27,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:27,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:34:27,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:27,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:34:27,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:34:27,908 INFO L87 Difference]: Start difference. First operand 2008 states and 6153 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:28,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:28,094 INFO L93 Difference]: Finished difference Result 2032 states and 6207 transitions. [2022-11-18 18:34:28,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:34:28,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-18 18:34:28,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:28,106 INFO L225 Difference]: With dead ends: 2032 [2022-11-18 18:34:28,106 INFO L226 Difference]: Without dead ends: 2032 [2022-11-18 18:34:28,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-18 18:34:28,107 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:28,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:34:28,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2022-11-18 18:34:28,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1878. [2022-11-18 18:34:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1830 states have (on average 3.146448087431694) internal successors, (5758), 1877 states have internal predecessors, (5758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:28,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 5758 transitions. [2022-11-18 18:34:28,179 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 5758 transitions. Word has length 13 [2022-11-18 18:34:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:28,179 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 5758 transitions. [2022-11-18 18:34:28,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 5758 transitions. [2022-11-18 18:34:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 18:34:28,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:28,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:28,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 18:34:28,181 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:28,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:28,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2140460448, now seen corresponding path program 1 times [2022-11-18 18:34:28,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:28,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787882128] [2022-11-18 18:34:28,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:28,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:29,781 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-18 18:34:29,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:29,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787882128] [2022-11-18 18:34:29,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787882128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:29,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:29,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:34:29,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895063928] [2022-11-18 18:34:29,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:29,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 18:34:29,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:29,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 18:34:29,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:34:29,784 INFO L87 Difference]: Start difference. First operand 1878 states and 5758 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-18 18:34:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:30,478 INFO L93 Difference]: Finished difference Result 2383 states and 7367 transitions. [2022-11-18 18:34:30,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 18:34:30,479 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-18 18:34:30,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:30,489 INFO L225 Difference]: With dead ends: 2383 [2022-11-18 18:34:30,489 INFO L226 Difference]: Without dead ends: 2383 [2022-11-18 18:34:30,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2022-11-18 18:34:30,490 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 91 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:30,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 10 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 18:34:30,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2022-11-18 18:34:30,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 1883. [2022-11-18 18:34:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1835 states have (on average 3.130790190735695) internal successors, (5745), 1882 states have internal predecessors, (5745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 5745 transitions. [2022-11-18 18:34:30,551 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 5745 transitions. Word has length 13 [2022-11-18 18:34:30,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:30,552 INFO L495 AbstractCegarLoop]: Abstraction has 1883 states and 5745 transitions. [2022-11-18 18:34:30,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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-18 18:34:30,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 5745 transitions. [2022-11-18 18:34:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 18:34:30,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:30,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:30,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 18:34:30,554 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:30,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:30,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1169671471, now seen corresponding path program 1 times [2022-11-18 18:34:30,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:30,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137089124] [2022-11-18 18:34:30,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:30,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:30,868 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-18 18:34:30,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:30,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137089124] [2022-11-18 18:34:30,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137089124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:30,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:30,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:34:30,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631564562] [2022-11-18 18:34:30,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:30,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:34:30,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:30,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:34:30,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:34:30,870 INFO L87 Difference]: Start difference. First operand 1883 states and 5745 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:31,072 INFO L93 Difference]: Finished difference Result 1814 states and 5241 transitions. [2022-11-18 18:34:31,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:34:31,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-18 18:34:31,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:31,078 INFO L225 Difference]: With dead ends: 1814 [2022-11-18 18:34:31,078 INFO L226 Difference]: Without dead ends: 1814 [2022-11-18 18:34:31,079 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-18 18:34:31,080 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 43 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:31,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 5 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:34:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2022-11-18 18:34:31,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1592. [2022-11-18 18:34:31,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1544 states have (on average 3.098445595854922) internal successors, (4784), 1591 states have internal predecessors, (4784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 4784 transitions. [2022-11-18 18:34:31,125 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 4784 transitions. Word has length 13 [2022-11-18 18:34:31,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:31,125 INFO L495 AbstractCegarLoop]: Abstraction has 1592 states and 4784 transitions. [2022-11-18 18:34:31,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:31,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 4784 transitions. [2022-11-18 18:34:31,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 18:34:31,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:31,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:31,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 18:34:31,127 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:31,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:31,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2038623958, now seen corresponding path program 1 times [2022-11-18 18:34:31,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:31,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485036591] [2022-11-18 18:34:31,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:31,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:31,361 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-18 18:34:31,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:31,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485036591] [2022-11-18 18:34:31,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485036591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:31,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:31,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:34:31,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063517615] [2022-11-18 18:34:31,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:31,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:34:31,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:31,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:34:31,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:34:31,363 INFO L87 Difference]: Start difference. First operand 1592 states and 4784 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:31,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:31,539 INFO L93 Difference]: Finished difference Result 804 states and 2057 transitions. [2022-11-18 18:34:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:34:31,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-18 18:34:31,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:31,541 INFO L225 Difference]: With dead ends: 804 [2022-11-18 18:34:31,542 INFO L226 Difference]: Without dead ends: 724 [2022-11-18 18:34:31,542 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-18 18:34:31,542 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:31,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:34:31,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2022-11-18 18:34:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2022-11-18 18:34:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 688 states have (on average 2.6700581395348837) internal successors, (1837), 723 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1837 transitions. [2022-11-18 18:34:31,559 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1837 transitions. Word has length 14 [2022-11-18 18:34:31,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:31,559 INFO L495 AbstractCegarLoop]: Abstraction has 724 states and 1837 transitions. [2022-11-18 18:34:31,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1837 transitions. [2022-11-18 18:34:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 18:34:31,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:31,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:31,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 18:34:31,561 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:31,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:31,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1458379335, now seen corresponding path program 1 times [2022-11-18 18:34:31,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:31,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983677658] [2022-11-18 18:34:31,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:31,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:31,861 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-18 18:34:31,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:31,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983677658] [2022-11-18 18:34:31,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983677658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:31,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:31,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:34:31,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239305066] [2022-11-18 18:34:31,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:31,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:34:31,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:31,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:34:31,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:34:31,864 INFO L87 Difference]: Start difference. First operand 724 states and 1837 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-18 18:34:32,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:32,094 INFO L93 Difference]: Finished difference Result 291 states and 629 transitions. [2022-11-18 18:34:32,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:34:32,094 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-18 18:34:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:32,095 INFO L225 Difference]: With dead ends: 291 [2022-11-18 18:34:32,095 INFO L226 Difference]: Without dead ends: 247 [2022-11-18 18:34:32,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:34:32,096 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 45 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:32,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 7 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:34:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-11-18 18:34:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2022-11-18 18:34:32,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 233 states have (on average 2.2317596566523603) internal successors, (520), 246 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 520 transitions. [2022-11-18 18:34:32,102 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 520 transitions. Word has length 16 [2022-11-18 18:34:32,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:32,103 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 520 transitions. [2022-11-18 18:34:32,103 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-18 18:34:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 520 transitions. [2022-11-18 18:34:32,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 18:34:32,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:32,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:32,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 18:34:32,104 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:32,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:32,105 INFO L85 PathProgramCache]: Analyzing trace with hash 337154400, now seen corresponding path program 1 times [2022-11-18 18:34:32,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:32,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104018257] [2022-11-18 18:34:32,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:32,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:33,090 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-18 18:34:33,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:33,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104018257] [2022-11-18 18:34:33,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104018257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:33,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:33,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:34:33,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336012849] [2022-11-18 18:34:33,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:33,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:34:33,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:33,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:34:33,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:34:33,096 INFO L87 Difference]: Start difference. First operand 247 states and 520 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:33,511 INFO L93 Difference]: Finished difference Result 563 states and 1137 transitions. [2022-11-18 18:34:33,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 18:34:33,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-18 18:34:33,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:33,513 INFO L225 Difference]: With dead ends: 563 [2022-11-18 18:34:33,513 INFO L226 Difference]: Without dead ends: 563 [2022-11-18 18:34:33,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:34:33,514 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 68 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:33,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 17 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 18:34:33,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-11-18 18:34:33,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 332. [2022-11-18 18:34:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 318 states have (on average 2.2264150943396226) internal successors, (708), 331 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 708 transitions. [2022-11-18 18:34:33,524 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 708 transitions. Word has length 18 [2022-11-18 18:34:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:33,525 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 708 transitions. [2022-11-18 18:34:33,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 708 transitions. [2022-11-18 18:34:33,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 18:34:33,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:33,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:33,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 18:34:33,526 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:33,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:33,528 INFO L85 PathProgramCache]: Analyzing trace with hash 123955296, now seen corresponding path program 2 times [2022-11-18 18:34:33,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:33,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041033472] [2022-11-18 18:34:33,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:33,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:36,081 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-18 18:34:36,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:36,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041033472] [2022-11-18 18:34:36,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041033472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:36,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:36,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:34:36,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33520537] [2022-11-18 18:34:36,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:36,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 18:34:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:36,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 18:34:36,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:34:36,084 INFO L87 Difference]: Start difference. First operand 332 states and 708 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:36,729 INFO L93 Difference]: Finished difference Result 656 states and 1330 transitions. [2022-11-18 18:34:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 18:34:36,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-18 18:34:36,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:36,731 INFO L225 Difference]: With dead ends: 656 [2022-11-18 18:34:36,731 INFO L226 Difference]: Without dead ends: 656 [2022-11-18 18:34:36,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-18 18:34:36,732 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 90 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:36,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 20 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 18:34:36,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-11-18 18:34:36,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 360. [2022-11-18 18:34:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 346 states have (on average 2.222543352601156) internal successors, (769), 359 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 769 transitions. [2022-11-18 18:34:36,742 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 769 transitions. Word has length 18 [2022-11-18 18:34:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:36,742 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 769 transitions. [2022-11-18 18:34:36,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 769 transitions. [2022-11-18 18:34:36,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 18:34:36,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:36,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:36,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 18:34:36,744 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:36,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:36,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1813779246, now seen corresponding path program 3 times [2022-11-18 18:34:36,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:36,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257134169] [2022-11-18 18:34:36,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:36,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:38,792 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-18 18:34:38,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:38,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257134169] [2022-11-18 18:34:38,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257134169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:38,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:38,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:34:38,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401763404] [2022-11-18 18:34:38,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:38,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 18:34:38,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:38,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 18:34:38,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:34:38,794 INFO L87 Difference]: Start difference. First operand 360 states and 769 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:39,682 INFO L93 Difference]: Finished difference Result 619 states and 1287 transitions. [2022-11-18 18:34:39,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 18:34:39,683 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-18 18:34:39,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:39,685 INFO L225 Difference]: With dead ends: 619 [2022-11-18 18:34:39,685 INFO L226 Difference]: Without dead ends: 619 [2022-11-18 18:34:39,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-11-18 18:34:39,686 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 95 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:39,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 20 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 18:34:39,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-11-18 18:34:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 386. [2022-11-18 18:34:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 372 states have (on average 2.2338709677419355) internal successors, (831), 385 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 831 transitions. [2022-11-18 18:34:39,696 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 831 transitions. Word has length 18 [2022-11-18 18:34:39,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:39,697 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 831 transitions. [2022-11-18 18:34:39,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 831 transitions. [2022-11-18 18:34:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 18:34:39,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:39,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:39,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 18:34:39,699 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:39,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:39,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2035410658, now seen corresponding path program 1 times [2022-11-18 18:34:39,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:39,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683577136] [2022-11-18 18:34:39,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:39,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:39,908 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-18 18:34:39,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:39,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683577136] [2022-11-18 18:34:39,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683577136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:39,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:39,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:34:39,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364563220] [2022-11-18 18:34:39,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:39,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:34:39,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:39,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:34:39,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:34:39,911 INFO L87 Difference]: Start difference. First operand 386 states and 831 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:40,022 INFO L93 Difference]: Finished difference Result 549 states and 1151 transitions. [2022-11-18 18:34:40,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:34:40,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-18 18:34:40,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:40,023 INFO L225 Difference]: With dead ends: 549 [2022-11-18 18:34:40,024 INFO L226 Difference]: Without dead ends: 549 [2022-11-18 18:34:40,024 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-18 18:34:40,024 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:40,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:34:40,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-11-18 18:34:40,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 388. [2022-11-18 18:34:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 374 states have (on average 2.2406417112299466) internal successors, (838), 387 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 838 transitions. [2022-11-18 18:34:40,034 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 838 transitions. Word has length 18 [2022-11-18 18:34:40,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:40,035 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 838 transitions. [2022-11-18 18:34:40,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 838 transitions. [2022-11-18 18:34:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 18:34:40,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:40,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:40,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 18:34:40,037 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:40,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:40,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1760968070, now seen corresponding path program 4 times [2022-11-18 18:34:40,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:40,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447429192] [2022-11-18 18:34:40,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:40,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:40,390 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-18 18:34:40,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:40,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447429192] [2022-11-18 18:34:40,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447429192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:40,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:40,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:34:40,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055209719] [2022-11-18 18:34:40,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:40,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:34:40,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:40,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:34:40,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:34:40,393 INFO L87 Difference]: Start difference. First operand 388 states and 838 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:40,583 INFO L93 Difference]: Finished difference Result 287 states and 625 transitions. [2022-11-18 18:34:40,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 18:34:40,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-18 18:34:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:40,584 INFO L225 Difference]: With dead ends: 287 [2022-11-18 18:34:40,584 INFO L226 Difference]: Without dead ends: 260 [2022-11-18 18:34:40,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:34:40,585 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 64 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:40,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 7 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:34:40,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-18 18:34:40,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 204. [2022-11-18 18:34:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 202 states have (on average 2.2475247524752477) internal successors, (454), 203 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 454 transitions. [2022-11-18 18:34:40,590 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 454 transitions. Word has length 18 [2022-11-18 18:34:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:40,590 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 454 transitions. [2022-11-18 18:34:40,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 454 transitions. [2022-11-18 18:34:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 18:34:40,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:40,591 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-18 18:34:40,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-18 18:34:40,592 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:40,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:40,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2107609321, now seen corresponding path program 1 times [2022-11-18 18:34:40,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:40,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069289074] [2022-11-18 18:34:40,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:40,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:43,129 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-18 18:34:43,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:43,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069289074] [2022-11-18 18:34:43,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069289074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:43,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:43,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:34:43,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240671176] [2022-11-18 18:34:43,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:43,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 18:34:43,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:43,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 18:34:43,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:34:43,131 INFO L87 Difference]: Start difference. First operand 204 states and 454 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:43,920 INFO L93 Difference]: Finished difference Result 419 states and 847 transitions. [2022-11-18 18:34:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:34:43,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-18 18:34:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:43,922 INFO L225 Difference]: With dead ends: 419 [2022-11-18 18:34:43,922 INFO L226 Difference]: Without dead ends: 419 [2022-11-18 18:34:43,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-11-18 18:34:43,923 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 90 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:43,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 19 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 18:34:43,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-11-18 18:34:43,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 202. [2022-11-18 18:34:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 200 states have (on average 2.245) internal successors, (449), 201 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 449 transitions. [2022-11-18 18:34:43,929 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 449 transitions. Word has length 21 [2022-11-18 18:34:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:43,929 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 449 transitions. [2022-11-18 18:34:43,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 449 transitions. [2022-11-18 18:34:43,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 18:34:43,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:43,930 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-18 18:34:43,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 18:34:43,931 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:43,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:43,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1178361935, now seen corresponding path program 2 times [2022-11-18 18:34:43,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:43,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957954645] [2022-11-18 18:34:43,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:43,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:46,352 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-18 18:34:46,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:46,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957954645] [2022-11-18 18:34:46,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957954645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:46,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:46,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:34:46,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87053413] [2022-11-18 18:34:46,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:46,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 18:34:46,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:46,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 18:34:46,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:34:46,355 INFO L87 Difference]: Start difference. First operand 202 states and 449 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:47,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:47,013 INFO L93 Difference]: Finished difference Result 354 states and 755 transitions. [2022-11-18 18:34:47,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:34:47,013 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-18 18:34:47,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:47,014 INFO L225 Difference]: With dead ends: 354 [2022-11-18 18:34:47,014 INFO L226 Difference]: Without dead ends: 354 [2022-11-18 18:34:47,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-18 18:34:47,015 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 42 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:47,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 28 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 18:34:47,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-11-18 18:34:47,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 190. [2022-11-18 18:34:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 188 states have (on average 2.25) internal successors, (423), 189 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 423 transitions. [2022-11-18 18:34:47,021 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 423 transitions. Word has length 21 [2022-11-18 18:34:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:47,021 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 423 transitions. [2022-11-18 18:34:47,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 423 transitions. [2022-11-18 18:34:47,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 18:34:47,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:47,022 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-18 18:34:47,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-18 18:34:47,023 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:47,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:47,023 INFO L85 PathProgramCache]: Analyzing trace with hash -928246991, now seen corresponding path program 3 times [2022-11-18 18:34:47,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:47,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961013938] [2022-11-18 18:34:47,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:47,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:49,286 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-18 18:34:49,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:49,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961013938] [2022-11-18 18:34:49,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961013938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:49,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:49,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:34:49,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333096844] [2022-11-18 18:34:49,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:49,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 18:34:49,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:49,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 18:34:49,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:34:49,289 INFO L87 Difference]: Start difference. First operand 190 states and 423 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:34:49,742 INFO L93 Difference]: Finished difference Result 327 states and 691 transitions. [2022-11-18 18:34:49,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:34:49,743 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-18 18:34:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:34:49,743 INFO L225 Difference]: With dead ends: 327 [2022-11-18 18:34:49,743 INFO L226 Difference]: Without dead ends: 327 [2022-11-18 18:34:49,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-18 18:34:49,744 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 44 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:34:49,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 23 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 18:34:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-11-18 18:34:49,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 181. [2022-11-18 18:34:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 2.2290502793296088) internal successors, (399), 180 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:49,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 399 transitions. [2022-11-18 18:34:49,750 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 399 transitions. Word has length 21 [2022-11-18 18:34:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:34:49,750 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 399 transitions. [2022-11-18 18:34:49,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 399 transitions. [2022-11-18 18:34:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 18:34:49,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:34:49,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:49,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-18 18:34:49,752 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:34:49,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:49,752 INFO L85 PathProgramCache]: Analyzing trace with hash -513539087, now seen corresponding path program 4 times [2022-11-18 18:34:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:49,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648413073] [2022-11-18 18:34:49,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:49,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:34:49,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 18:34:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:34:50,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 18:34:50,032 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 18:34:50,033 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (90 of 91 remaining) [2022-11-18 18:34:50,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 91 remaining) [2022-11-18 18:34:50,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 91 remaining) [2022-11-18 18:34:50,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 91 remaining) [2022-11-18 18:34:50,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 91 remaining) [2022-11-18 18:34:50,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 91 remaining) [2022-11-18 18:34:50,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 91 remaining) [2022-11-18 18:34:50,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 91 remaining) [2022-11-18 18:34:50,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 91 remaining) [2022-11-18 18:34:50,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 91 remaining) [2022-11-18 18:34:50,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 91 remaining) [2022-11-18 18:34:50,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 91 remaining) [2022-11-18 18:34:50,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 91 remaining) [2022-11-18 18:34:50,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (77 of 91 remaining) [2022-11-18 18:34:50,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 91 remaining) [2022-11-18 18:34:50,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 91 remaining) [2022-11-18 18:34:50,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 91 remaining) [2022-11-18 18:34:50,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 91 remaining) [2022-11-18 18:34:50,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 91 remaining) [2022-11-18 18:34:50,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 91 remaining) [2022-11-18 18:34:50,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 91 remaining) [2022-11-18 18:34:50,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 91 remaining) [2022-11-18 18:34:50,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 91 remaining) [2022-11-18 18:34:50,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 91 remaining) [2022-11-18 18:34:50,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 91 remaining) [2022-11-18 18:34:50,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 91 remaining) [2022-11-18 18:34:50,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 91 remaining) [2022-11-18 18:34:50,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 91 remaining) [2022-11-18 18:34:50,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 91 remaining) [2022-11-18 18:34:50,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 91 remaining) [2022-11-18 18:34:50,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 91 remaining) [2022-11-18 18:34:50,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 91 remaining) [2022-11-18 18:34:50,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 91 remaining) [2022-11-18 18:34:50,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 91 remaining) [2022-11-18 18:34:50,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 91 remaining) [2022-11-18 18:34:50,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 91 remaining) [2022-11-18 18:34:50,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 91 remaining) [2022-11-18 18:34:50,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 91 remaining) [2022-11-18 18:34:50,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 91 remaining) [2022-11-18 18:34:50,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 91 remaining) [2022-11-18 18:34:50,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 91 remaining) [2022-11-18 18:34:50,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 91 remaining) [2022-11-18 18:34:50,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 91 remaining) [2022-11-18 18:34:50,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 91 remaining) [2022-11-18 18:34:50,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 91 remaining) [2022-11-18 18:34:50,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 91 remaining) [2022-11-18 18:34:50,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 91 remaining) [2022-11-18 18:34:50,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 91 remaining) [2022-11-18 18:34:50,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 91 remaining) [2022-11-18 18:34:50,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 91 remaining) [2022-11-18 18:34:50,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (40 of 91 remaining) [2022-11-18 18:34:50,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 91 remaining) [2022-11-18 18:34:50,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 91 remaining) [2022-11-18 18:34:50,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 91 remaining) [2022-11-18 18:34:50,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 91 remaining) [2022-11-18 18:34:50,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 91 remaining) [2022-11-18 18:34:50,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 91 remaining) [2022-11-18 18:34:50,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 91 remaining) [2022-11-18 18:34:50,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 91 remaining) [2022-11-18 18:34:50,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 91 remaining) [2022-11-18 18:34:50,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 91 remaining) [2022-11-18 18:34:50,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 91 remaining) [2022-11-18 18:34:50,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 91 remaining) [2022-11-18 18:34:50,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 91 remaining) [2022-11-18 18:34:50,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 91 remaining) [2022-11-18 18:34:50,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 91 remaining) [2022-11-18 18:34:50,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 91 remaining) [2022-11-18 18:34:50,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 91 remaining) [2022-11-18 18:34:50,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 91 remaining) [2022-11-18 18:34:50,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 91 remaining) [2022-11-18 18:34:50,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 91 remaining) [2022-11-18 18:34:50,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 91 remaining) [2022-11-18 18:34:50,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 91 remaining) [2022-11-18 18:34:50,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 91 remaining) [2022-11-18 18:34:50,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 91 remaining) [2022-11-18 18:34:50,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 91 remaining) [2022-11-18 18:34:50,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 91 remaining) [2022-11-18 18:34:50,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 91 remaining) [2022-11-18 18:34:50,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 91 remaining) [2022-11-18 18:34:50,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 91 remaining) [2022-11-18 18:34:50,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 91 remaining) [2022-11-18 18:34:50,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 91 remaining) [2022-11-18 18:34:50,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 91 remaining) [2022-11-18 18:34:50,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 91 remaining) [2022-11-18 18:34:50,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 91 remaining) [2022-11-18 18:34:50,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 91 remaining) [2022-11-18 18:34:50,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 91 remaining) [2022-11-18 18:34:50,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 91 remaining) [2022-11-18 18:34:50,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 91 remaining) [2022-11-18 18:34:50,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 91 remaining) [2022-11-18 18:34:50,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 91 remaining) [2022-11-18 18:34:50,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-18 18:34:50,054 INFO L444 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:50,060 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 18:34:50,060 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 18:34:50,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:34:50 BasicIcfg [2022-11-18 18:34:50,163 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 18:34:50,163 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 18:34:50,163 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 18:34:50,164 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 18:34:50,164 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:33:53" (3/4) ... [2022-11-18 18:34:50,167 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 18:34:50,167 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 18:34:50,168 INFO L158 Benchmark]: Toolchain (without parser) took 59331.70ms. Allocated memory was 123.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 84.7MB in the beginning and 1.0GB in the end (delta: -916.6MB). Peak memory consumption was 431.7MB. Max. memory is 16.1GB. [2022-11-18 18:34:50,168 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 123.7MB. Free memory was 102.9MB in the beginning and 102.8MB in the end (delta: 73.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:34:50,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 709.32ms. Allocated memory is still 123.7MB. Free memory was 84.5MB in the beginning and 83.9MB in the end (delta: 549.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 18:34:50,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.83ms. Allocated memory is still 123.7MB. Free memory was 83.9MB in the beginning and 81.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:34:50,169 INFO L158 Benchmark]: Boogie Preprocessor took 47.72ms. Allocated memory is still 123.7MB. Free memory was 81.4MB in the beginning and 78.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 18:34:50,169 INFO L158 Benchmark]: RCFGBuilder took 1607.92ms. Allocated memory was 123.7MB in the beginning and 169.9MB in the end (delta: 46.1MB). Free memory was 78.9MB in the beginning and 72.2MB in the end (delta: 6.7MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2022-11-18 18:34:50,170 INFO L158 Benchmark]: TraceAbstraction took 56866.86ms. Allocated memory was 169.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 71.1MB in the beginning and 1.0GB in the end (delta: -930.1MB). Peak memory consumption was 372.2MB. Max. memory is 16.1GB. [2022-11-18 18:34:50,170 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 1.5GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:34:50,172 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00ms. Allocated memory is still 123.7MB. Free memory was 102.9MB in the beginning and 102.8MB in the end (delta: 73.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 709.32ms. Allocated memory is still 123.7MB. Free memory was 84.5MB in the beginning and 83.9MB in the end (delta: 549.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.83ms. Allocated memory is still 123.7MB. Free memory was 83.9MB in the beginning and 81.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.72ms. Allocated memory is still 123.7MB. Free memory was 81.4MB in the beginning and 78.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1607.92ms. Allocated memory was 123.7MB in the beginning and 169.9MB in the end (delta: 46.1MB). Free memory was 78.9MB in the beginning and 72.2MB in the end (delta: 6.7MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. * TraceAbstraction took 56866.86ms. Allocated memory was 169.9MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 71.1MB in the beginning and 1.0GB in the end (delta: -930.1MB). Peak memory consumption was 372.2MB. Max. memory is 16.1GB. * Witness Printer took 3.86ms. Allocated memory is still 1.5GB. Free memory is still 1.0GB. 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: 23.6s, 191 PlacesBefore, 88 PlacesAfterwards, 183 TransitionsBefore, 79 TransitionsAfterwards, 7512 CoEnabledTransitionPairs, 8 FixpointIterations, 72 TrivialSequentialCompositions, 105 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 182 TotalNumberOfCompositions, 34351 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14001, independent: 13456, independent conditional: 0, independent unconditional: 13456, dependent: 442, dependent conditional: 0, dependent unconditional: 442, unknown: 103, unknown conditional: 0, unknown unconditional: 103] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4800, independent: 4695, independent conditional: 0, independent unconditional: 4695, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4800, independent: 4072, independent conditional: 0, independent unconditional: 4072, dependent: 728, dependent conditional: 0, dependent unconditional: 728, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 728, independent: 623, independent conditional: 0, independent unconditional: 623, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3268, independent: 2246, independent conditional: 0, independent unconditional: 2246, dependent: 624, dependent conditional: 0, dependent unconditional: 624, unknown: 397, unknown conditional: 0, unknown unconditional: 397] ], Cache Queries: [ total: 14001, independent: 8761, independent conditional: 0, independent unconditional: 8761, dependent: 355, dependent conditional: 0, dependent unconditional: 355, unknown: 4885, unknown conditional: 0, unknown unconditional: 4885] , Statistics on independence cache: Total cache size (in pairs): 844, Positive cache size: 808, Positive conditional cache size: 0, Positive unconditional cache size: 808, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 10, Unknown conditional cache size: 0, Unknown unconditional cache size: 10 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L735] 0 _Bool x$flush_delayed; [L746] 0 int *x$read_delayed_var; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L736] 0 int x$mem_tmp; [L712] 0 int __unbuffered_p0_EAX = 0; [L740] 0 _Bool x$r_buff0_thd3; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L737] 0 _Bool x$r_buff0_thd0; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L714] 0 int __unbuffered_p2_EAX = 0; [L745] 0 _Bool x$read_delayed; [L710] 0 int __unbuffered_cnt = 0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L732] 0 _Bool main$tmp_guard1; [L750] 0 _Bool x$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L748] 0 _Bool x$w_buff0_used; [L747] 0 int x$w_buff0; [L749] 0 int x$w_buff1; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L734] 0 int x = 0; [L742] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L741] 0 _Bool x$r_buff1_thd0; [L752] 0 int y = 0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L744] 0 _Bool x$r_buff1_thd3; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L743] 0 _Bool x$r_buff1_thd2; [L859] 0 pthread_t t2257; [L860] FCALL, FORK 0 pthread_create(&t2257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t2257, ((void *)0), P0, ((void *)0))=-2, t2257={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L861] 0 pthread_t t2258; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t2257={7:0}, t2258={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L862] FCALL, FORK 0 pthread_create(&t2258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t2258, ((void *)0), P1, ((void *)0))=-1, t2257={7:0}, t2258={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L863] 0 pthread_t t2259; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t2257={7:0}, t2258={5:0}, t2259={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L864] FCALL, FORK 0 pthread_create(&t2259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t2259, ((void *)0), P2, ((void *)0))=0, t2257={7:0}, t2258={5:0}, t2259={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L834] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 3 return 0; [L759] 1 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L801] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L802] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L804] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 \read(x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t2257={7:0}, t2258={5:0}, t2259={6:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L877] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: 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: 857]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 864]: 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: 860]: 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, 244 locations, 91 error locations. Started 1 CEGAR loops. OverallTime: 56.5s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 25.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1025 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1025 mSDsluCounter, 188 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 271 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3884 IncrementalHoareTripleChecker+Invalid, 4155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 271 mSolverCounterUnsat, 49 mSDtfsCounter, 3884 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54796occurred in iteration=0, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 5866 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 281 ConstructedInterpolants, 0 QuantifiedInterpolants, 3866 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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-18 18:34:50,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/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_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe020_power.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro --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 cd91eb07499c204f7750c4a87fd11eb7780a100da5928fd001cd5e1a53feff12 --- 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-8393723 [2022-11-18 18:34:52,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:34:52,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:34:52,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:34:52,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:34:52,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:34:52,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:34:52,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:34:52,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:34:52,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:34:52,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:34:52,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:34:52,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:34:52,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:34:52,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:34:52,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:34:52,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:34:52,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:34:52,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:34:52,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:34:52,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:34:52,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:34:52,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:34:52,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:34:52,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:34:52,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:34:52,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:34:52,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:34:52,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:34:52,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:34:52,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:34:52,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:34:52,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:34:52,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:34:52,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:34:52,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:34:52,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:34:52,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:34:52,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:34:52,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:34:52,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:34:52,624 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-18 18:34:52,671 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:34:52,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:34:52,672 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:34:52,672 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:34:52,673 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:34:52,673 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:34:52,675 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:34:52,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:34:52,675 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:34:52,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:34:52,676 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 18:34:52,677 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 18:34:52,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:34:52,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 18:34:52,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:34:52,678 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 18:34:52,678 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 18:34:52,678 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 18:34:52,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:34:52,678 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 18:34:52,679 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 18:34:52,679 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 18:34:52,679 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 18:34:52,679 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:34:52,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:34:52,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:34:52,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:34:52,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:34:52,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:34:52,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:34:52,681 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 18:34:52,681 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 18:34:52,682 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 18:34:52,682 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_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/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_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro 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 -> cd91eb07499c204f7750c4a87fd11eb7780a100da5928fd001cd5e1a53feff12 [2022-11-18 18:34:53,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:34:53,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:34:53,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:34:53,079 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:34:53,081 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:34:53,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/safe020_power.i [2022-11-18 18:34:53,161 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/data/5e3287234/ab42a573e20b4a43bdc598ce42477fbb/FLAG3c3596d8d [2022-11-18 18:34:53,780 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:34:53,781 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/sv-benchmarks/c/pthread-wmm/safe020_power.i [2022-11-18 18:34:53,809 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/data/5e3287234/ab42a573e20b4a43bdc598ce42477fbb/FLAG3c3596d8d [2022-11-18 18:34:54,052 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/data/5e3287234/ab42a573e20b4a43bdc598ce42477fbb [2022-11-18 18:34:54,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:34:54,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:34:54,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:34:54,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:34:54,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:34:54,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:34:54" (1/1) ... [2022-11-18 18:34:54,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1035cda9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:54, skipping insertion in model container [2022-11-18 18:34:54,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:34:54" (1/1) ... [2022-11-18 18:34:54,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:34:54,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:34:54,326 WARN L234 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_600d1020-fb47-4773-b8b0-4975716f5f2c/sv-benchmarks/c/pthread-wmm/safe020_power.i[990,1003] [2022-11-18 18:34:54,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:34:54,625 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:34:54,641 WARN L234 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_600d1020-fb47-4773-b8b0-4975716f5f2c/sv-benchmarks/c/pthread-wmm/safe020_power.i[990,1003] [2022-11-18 18:34:54,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:34:54,730 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:34:54,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:54 WrapperNode [2022-11-18 18:34:54,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:34:54,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:34:54,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:34:54,733 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:34:54,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:54" (1/1) ... [2022-11-18 18:34:54,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:54" (1/1) ... [2022-11-18 18:34:54,815 INFO L138 Inliner]: procedures = 180, calls = 77, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2022-11-18 18:34:54,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:34:54,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:34:54,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:34:54,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:34:54,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:54" (1/1) ... [2022-11-18 18:34:54,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:54" (1/1) ... [2022-11-18 18:34:54,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:54" (1/1) ... [2022-11-18 18:34:54,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:54" (1/1) ... [2022-11-18 18:34:54,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:54" (1/1) ... [2022-11-18 18:34:54,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:54" (1/1) ... [2022-11-18 18:34:54,850 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:54" (1/1) ... [2022-11-18 18:34:54,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:54" (1/1) ... [2022-11-18 18:34:54,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:34:54,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:34:54,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:34:54,871 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:34:54,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:54" (1/1) ... [2022-11-18 18:34:54,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:34:54,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:34:54,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:34:54,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:34:54,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-18 18:34:54,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 18:34:54,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 18:34:54,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 18:34:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 18:34:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-18 18:34:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 18:34:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-18 18:34:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 18:34:54,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 18:34:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 18:34:54,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 18:34:54,968 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 18:34:54,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 18:34:54,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 18:34:54,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:34:54,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:34:54,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-18 18:34:55,231 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:34:55,233 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:34:56,001 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:34:56,779 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:34:56,779 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 18:34:56,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:34:56 BoogieIcfgContainer [2022-11-18 18:34:56,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:34:56,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:34:56,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:34:56,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:34:56,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:34:54" (1/3) ... [2022-11-18 18:34:56,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:34:56, skipping insertion in model container [2022-11-18 18:34:56,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:34:54" (2/3) ... [2022-11-18 18:34:56,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:34:56, skipping insertion in model container [2022-11-18 18:34:56,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:34:56" (3/3) ... [2022-11-18 18:34:56,791 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_power.i [2022-11-18 18:34:56,810 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:34:56,810 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations. [2022-11-18 18:34:56,810 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 18:34:57,059 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 18:34:57,104 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-18 18:34:57,121 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 184 transitions, 383 flow [2022-11-18 18:34:57,125 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 184 transitions, 383 flow [2022-11-18 18:34:57,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 184 transitions, 383 flow [2022-11-18 18:34:57,239 INFO L130 PetriNetUnfolder]: 2/181 cut-off events. [2022-11-18 18:34:57,240 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 18:34:57,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 181 events. 2/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 298 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-11-18 18:34:57,253 INFO L119 LiptonReduction]: Number of co-enabled transitions 7512 [2022-11-18 18:35:15,729 WARN L233 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 189 DAG size of output: 186 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-18 18:35:24,370 WARN L233 SmtUtils]: Spent 6.38s on a formula simplification. DAG size of input: 219 DAG size of output: 216 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-18 18:35:39,546 INFO L134 LiptonReduction]: Checked pairs total: 33404 [2022-11-18 18:35:39,546 INFO L136 LiptonReduction]: Total number of compositions: 176 [2022-11-18 18:35:39,554 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 79 transitions, 173 flow [2022-11-18 18:35:41,755 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:41,773 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:35:41,777 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;@5efcbc10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:35:41,778 INFO L358 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2022-11-18 18:35:41,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-18 18:35:41,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:35:41,891 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-18 18:35:41,892 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:35:41,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:35:41,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1226, now seen corresponding path program 1 times [2022-11-18 18:35:41,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:35:41,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976652885] [2022-11-18 18:35:41,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:41,913 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-18 18:35:41,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:35:41,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:41,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:42,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 18:35:42,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:35:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:35:42,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:35:42,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:35:42,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976652885] [2022-11-18 18:35:42,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976652885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:35:42,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:35:42,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-18 18:35:42,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667859576] [2022-11-18 18:35:42,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:35:42,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 18:35:42,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:35:42,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 18:35:42,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 18:35:42,479 INFO L87 Difference]: Start difference. First operand has 54796 states, 39871 states have (on average 5.182388201951293) internal successors, (206627), 54795 states have internal predecessors, (206627), 0 states have call successors, (0), 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-18 18:35:43,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:35:43,137 INFO L93 Difference]: Finished difference Result 9084 states and 32205 transitions. [2022-11-18 18:35:43,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 18:35:43,140 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-18 18:35:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:35:43,384 INFO L225 Difference]: With dead ends: 9084 [2022-11-18 18:35:43,394 INFO L226 Difference]: Without dead ends: 9084 [2022-11-18 18:35:43,395 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-18 18:35:43,412 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 18:35:43,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 18:35:43,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9084 states. [2022-11-18 18:35:43,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9084 to 9084. [2022-11-18 18:35:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9084 states, 7951 states have (on average 4.050433907684568) internal successors, (32205), 9083 states have internal predecessors, (32205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9084 states to 9084 states and 32205 transitions. [2022-11-18 18:35:44,004 INFO L78 Accepts]: Start accepts. Automaton has 9084 states and 32205 transitions. Word has length 1 [2022-11-18 18:35:44,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:35:44,005 INFO L495 AbstractCegarLoop]: Abstraction has 9084 states and 32205 transitions. [2022-11-18 18:35:44,005 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-18 18:35:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 9084 states and 32205 transitions. [2022-11-18 18:35:44,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 18:35:44,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:35:44,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 18:35:44,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-18 18:35:44,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:44,219 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:35:44,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:35:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash 37570267, now seen corresponding path program 1 times [2022-11-18 18:35:44,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:35:44,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320629030] [2022-11-18 18:35:44,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:44,222 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-18 18:35:44,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:35:44,226 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:44,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:44,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 18:35:44,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:35:44,532 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 18:35:44,533 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-18 18:35:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:35:44,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:35:44,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:35:44,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320629030] [2022-11-18 18:35:44,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320629030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:35:44,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:35:44,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 18:35:44,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471434272] [2022-11-18 18:35:44,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:35:44,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:35:44,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:35:44,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:35:44,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:35:44,592 INFO L87 Difference]: Start difference. First operand 9084 states and 32205 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:35:45,162 INFO L93 Difference]: Finished difference Result 5010 states and 17211 transitions. [2022-11-18 18:35:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:35:45,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-18 18:35:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:35:45,242 INFO L225 Difference]: With dead ends: 5010 [2022-11-18 18:35:45,243 INFO L226 Difference]: Without dead ends: 5010 [2022-11-18 18:35:45,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:35:45,244 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:35:45,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 18:35:45,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5010 states. [2022-11-18 18:35:45,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5010 to 5010. [2022-11-18 18:35:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5010 states, 4599 states have (on average 3.742335290280496) internal successors, (17211), 5009 states have internal predecessors, (17211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5010 states to 5010 states and 17211 transitions. [2022-11-18 18:35:45,667 INFO L78 Accepts]: Start accepts. Automaton has 5010 states and 17211 transitions. Word has length 4 [2022-11-18 18:35:45,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:35:45,668 INFO L495 AbstractCegarLoop]: Abstraction has 5010 states and 17211 transitions. [2022-11-18 18:35:45,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5010 states and 17211 transitions. [2022-11-18 18:35:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-18 18:35:45,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:35:45,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-18 18:35:45,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-18 18:35:45,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:45,870 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:35:45,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:35:45,871 INFO L85 PathProgramCache]: Analyzing trace with hash 37570268, now seen corresponding path program 1 times [2022-11-18 18:35:45,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:35:45,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567542778] [2022-11-18 18:35:45,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:45,872 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-18 18:35:45,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:35:45,887 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:45,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:46,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 18:35:46,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:35:46,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:35:46,229 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-18 18:35:46,287 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-18 18:35:46,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:35:46,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:35:46,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567542778] [2022-11-18 18:35:46,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567542778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:35:46,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:35:46,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 18:35:46,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745652354] [2022-11-18 18:35:46,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:35:46,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:35:46,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:35:46,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:35:46,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:35:46,306 INFO L87 Difference]: Start difference. First operand 5010 states and 17211 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:35:46,542 INFO L93 Difference]: Finished difference Result 1886 states and 6165 transitions. [2022-11-18 18:35:46,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:35:46,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-18 18:35:46,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:35:46,561 INFO L225 Difference]: With dead ends: 1886 [2022-11-18 18:35:46,561 INFO L226 Difference]: Without dead ends: 1886 [2022-11-18 18:35:46,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:35:46,566 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:35:46,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:35:46,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2022-11-18 18:35:46,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1886. [2022-11-18 18:35:46,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1817 states have (on average 3.3929554210236654) internal successors, (6165), 1885 states have internal predecessors, (6165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 6165 transitions. [2022-11-18 18:35:46,650 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 6165 transitions. Word has length 4 [2022-11-18 18:35:46,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:35:46,651 INFO L495 AbstractCegarLoop]: Abstraction has 1886 states and 6165 transitions. [2022-11-18 18:35:46,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 6165 transitions. [2022-11-18 18:35:46,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 18:35:46,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:35:46,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 18:35:46,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-18 18:35:46,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:46,864 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:35:46,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:35:46,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1745912858, now seen corresponding path program 1 times [2022-11-18 18:35:46,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:35:46,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134044706] [2022-11-18 18:35:46,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:46,866 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-18 18:35:46,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:35:46,867 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:46,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:47,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 18:35:47,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:35:47,107 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-18 18:35:47,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:35:47,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:35:47,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134044706] [2022-11-18 18:35:47,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134044706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:35:47,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:35:47,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 18:35:47,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702027974] [2022-11-18 18:35:47,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:35:47,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:35:47,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:35:47,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:35:47,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:35:47,111 INFO L87 Difference]: Start difference. First operand 1886 states and 6165 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-18 18:35:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:35:47,365 INFO L93 Difference]: Finished difference Result 1574 states and 5087 transitions. [2022-11-18 18:35:47,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:35:47,366 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-18 18:35:47,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:35:47,375 INFO L225 Difference]: With dead ends: 1574 [2022-11-18 18:35:47,376 INFO L226 Difference]: Without dead ends: 1574 [2022-11-18 18:35:47,376 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-18 18:35:47,377 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:35:47,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:35:47,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2022-11-18 18:35:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1574. [2022-11-18 18:35:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1524 states have (on average 3.3379265091863517) internal successors, (5087), 1573 states have internal predecessors, (5087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 5087 transitions. [2022-11-18 18:35:47,466 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 5087 transitions. Word has length 6 [2022-11-18 18:35:47,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:35:47,466 INFO L495 AbstractCegarLoop]: Abstraction has 1574 states and 5087 transitions. [2022-11-18 18:35:47,467 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-18 18:35:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 5087 transitions. [2022-11-18 18:35:47,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-18 18:35:47,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:35:47,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:35:47,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Ended with exit code 0 [2022-11-18 18:35:47,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:47,679 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:35:47,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:35:47,680 INFO L85 PathProgramCache]: Analyzing trace with hash 701443594, now seen corresponding path program 1 times [2022-11-18 18:35:47,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:35:47,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359710659] [2022-11-18 18:35:47,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:47,681 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-18 18:35:47,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:35:47,683 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:47,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:47,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 18:35:47,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:35:47,942 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-18 18:35:47,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:35:47,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:35:47,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359710659] [2022-11-18 18:35:47,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359710659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:35:47,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:35:47,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:35:47,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388087263] [2022-11-18 18:35:47,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:35:47,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:35:47,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:35:47,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:35:47,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:35:47,945 INFO L87 Difference]: Start difference. First operand 1574 states and 5087 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:35:48,152 INFO L93 Difference]: Finished difference Result 799 states and 2094 transitions. [2022-11-18 18:35:48,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:35:48,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-18 18:35:48,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:35:48,157 INFO L225 Difference]: With dead ends: 799 [2022-11-18 18:35:48,157 INFO L226 Difference]: Without dead ends: 799 [2022-11-18 18:35:48,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:35:48,158 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:35:48,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:35:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2022-11-18 18:35:48,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2022-11-18 18:35:48,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 761 states have (on average 2.751642575558476) internal successors, (2094), 798 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 2094 transitions. [2022-11-18 18:35:48,180 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 2094 transitions. Word has length 10 [2022-11-18 18:35:48,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:35:48,180 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 2094 transitions. [2022-11-18 18:35:48,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:48,181 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 2094 transitions. [2022-11-18 18:35:48,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 18:35:48,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:35:48,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:35:48,208 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:48,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:48,408 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:35:48,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:35:48,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1739557134, now seen corresponding path program 1 times [2022-11-18 18:35:48,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:35:48,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357797571] [2022-11-18 18:35:48,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:48,410 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-18 18:35:48,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:35:48,411 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:48,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:48,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 18:35:48,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:35:48,677 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-18 18:35:48,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:35:48,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:35:48,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357797571] [2022-11-18 18:35:48,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357797571] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:35:48,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:35:48,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:35:48,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452118822] [2022-11-18 18:35:48,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:35:48,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:35:48,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:35:48,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:35:48,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:35:48,680 INFO L87 Difference]: Start difference. First operand 799 states and 2094 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:48,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:35:48,966 INFO L93 Difference]: Finished difference Result 272 states and 569 transitions. [2022-11-18 18:35:48,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 18:35:48,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-18 18:35:48,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:35:48,967 INFO L225 Difference]: With dead ends: 272 [2022-11-18 18:35:48,967 INFO L226 Difference]: Without dead ends: 272 [2022-11-18 18:35:48,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-18 18:35:48,969 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 18:35:48,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 18:35:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-18 18:35:48,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2022-11-18 18:35:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 256 states have (on average 2.22265625) internal successors, (569), 271 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 569 transitions. [2022-11-18 18:35:48,976 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 569 transitions. Word has length 13 [2022-11-18 18:35:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:35:48,976 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 569 transitions. [2022-11-18 18:35:48,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:48,977 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 569 transitions. [2022-11-18 18:35:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 18:35:48,978 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:35:48,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:35:48,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:49,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:49,191 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:35:49,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:35:49,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1449179983, now seen corresponding path program 1 times [2022-11-18 18:35:49,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:35:49,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910260216] [2022-11-18 18:35:49,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:49,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 18:35:49,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:35:49,193 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:49,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:49,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 18:35:49,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:35:49,495 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-18 18:35:49,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:35:49,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:35:49,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910260216] [2022-11-18 18:35:49,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910260216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:35:49,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:35:49,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:35:49,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734468162] [2022-11-18 18:35:49,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:35:49,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:35:49,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:35:49,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:35:49,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:35:49,499 INFO L87 Difference]: Start difference. First operand 272 states and 569 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-18 18:35:49,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:35:49,877 INFO L93 Difference]: Finished difference Result 151 states and 336 transitions. [2022-11-18 18:35:49,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:35:49,877 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-18 18:35:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:35:49,878 INFO L225 Difference]: With dead ends: 151 [2022-11-18 18:35:49,878 INFO L226 Difference]: Without dead ends: 151 [2022-11-18 18:35:49,878 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-18 18:35:49,879 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:35:49,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 18:35:49,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-18 18:35:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-18 18:35:49,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 2.2857142857142856) internal successors, (336), 150 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 336 transitions. [2022-11-18 18:35:49,884 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 336 transitions. Word has length 16 [2022-11-18 18:35:49,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:35:49,884 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 336 transitions. [2022-11-18 18:35:49,884 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-18 18:35:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 336 transitions. [2022-11-18 18:35:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 18:35:49,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:35:49,886 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-18 18:35:49,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:50,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:50,099 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:35:50,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:35:50,100 INFO L85 PathProgramCache]: Analyzing trace with hash 128229786, now seen corresponding path program 1 times [2022-11-18 18:35:50,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:35:50,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046303499] [2022-11-18 18:35:50,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:50,101 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-18 18:35:50,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:35:50,102 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:50,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:50,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 18:35:50,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:35:50,525 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-18 18:35:53,853 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-18 18:35:53,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:35:53,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:35:53,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046303499] [2022-11-18 18:35:53,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046303499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:35:53,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:35:53,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:35:53,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71016485] [2022-11-18 18:35:53,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:35:53,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:35:53,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:35:53,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:35:53,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:35:53,857 INFO L87 Difference]: Start difference. First operand 151 states and 336 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-18 18:35:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:35:54,347 INFO L93 Difference]: Finished difference Result 227 states and 497 transitions. [2022-11-18 18:35:54,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:35:54,348 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-18 18:35:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:35:54,349 INFO L225 Difference]: With dead ends: 227 [2022-11-18 18:35:54,349 INFO L226 Difference]: Without dead ends: 227 [2022-11-18 18:35:54,349 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-18 18:35:54,350 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 66 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:35:54,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 5 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 18:35:54,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-11-18 18:35:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 150. [2022-11-18 18:35:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 147 states have (on average 2.2789115646258504) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 335 transitions. [2022-11-18 18:35:54,356 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 335 transitions. Word has length 20 [2022-11-18 18:35:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:35:54,356 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 335 transitions. [2022-11-18 18:35:54,356 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-18 18:35:54,356 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 335 transitions. [2022-11-18 18:35:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 18:35:54,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:35:54,358 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-18 18:35:54,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:54,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:54,571 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:35:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:35:54,571 INFO L85 PathProgramCache]: Analyzing trace with hash 128229787, now seen corresponding path program 1 times [2022-11-18 18:35:54,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:35:54,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245261105] [2022-11-18 18:35:54,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:54,573 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-18 18:35:54,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:35:54,574 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:54,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:54,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 18:35:54,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:35:55,015 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-18 18:35:55,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-18 18:35:55,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:35:55,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:35:55,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245261105] [2022-11-18 18:35:55,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245261105] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:35:55,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:35:55,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 18:35:55,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561204446] [2022-11-18 18:35:55,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:35:55,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:35:55,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:35:55,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:35:55,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:35:55,713 INFO L87 Difference]: Start difference. First operand 150 states and 335 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-18 18:35:56,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:35:56,169 INFO L93 Difference]: Finished difference Result 228 states and 497 transitions. [2022-11-18 18:35:56,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:35:56,170 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-18 18:35:56,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:35:56,171 INFO L225 Difference]: With dead ends: 228 [2022-11-18 18:35:56,171 INFO L226 Difference]: Without dead ends: 228 [2022-11-18 18:35:56,171 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-18 18:35:56,172 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 71 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:35:56,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 5 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 18:35:56,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-18 18:35:56,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 149. [2022-11-18 18:35:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 2.272108843537415) internal successors, (334), 148 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 334 transitions. [2022-11-18 18:35:56,176 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 334 transitions. Word has length 20 [2022-11-18 18:35:56,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:35:56,177 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 334 transitions. [2022-11-18 18:35:56,177 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-18 18:35:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 334 transitions. [2022-11-18 18:35:56,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 18:35:56,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:35:56,178 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-18 18:35:56,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:56,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:56,378 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:35:56,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:35:56,379 INFO L85 PathProgramCache]: Analyzing trace with hash -319848934, now seen corresponding path program 1 times [2022-11-18 18:35:56,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:35:56,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360412873] [2022-11-18 18:35:56,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:56,380 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-18 18:35:56,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:35:56,381 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:56,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:56,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 18:35:56,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:35:56,692 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-18 18:35:56,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:35:56,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:35:56,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360412873] [2022-11-18 18:35:56,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360412873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:35:56,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:35:56,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:35:56,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916369575] [2022-11-18 18:35:56,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:35:56,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:35:56,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:35:56,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:35:56,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:35:56,694 INFO L87 Difference]: Start difference. First operand 149 states and 334 transitions. Second operand has 3 states, 2 states have (on average 10.5) 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-18 18:35:56,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:35:56,848 INFO L93 Difference]: Finished difference Result 191 states and 415 transitions. [2022-11-18 18:35:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:35:56,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) 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-18 18:35:56,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:35:56,850 INFO L225 Difference]: With dead ends: 191 [2022-11-18 18:35:56,850 INFO L226 Difference]: Without dead ends: 191 [2022-11-18 18:35:56,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-18 18:35:56,851 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:35:56,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:35:56,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-18 18:35:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2022-11-18 18:35:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 185 states have (on average 2.227027027027027) internal successors, (412), 186 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-18 18:35:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 412 transitions. [2022-11-18 18:35:56,857 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 412 transitions. Word has length 21 [2022-11-18 18:35:56,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:35:56,857 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 412 transitions. [2022-11-18 18:35:56,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) 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-18 18:35:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 412 transitions. [2022-11-18 18:35:56,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 18:35:56,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:35:56,858 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-18 18:35:56,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:57,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:57,059 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:35:57,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:35:57,059 INFO L85 PathProgramCache]: Analyzing trace with hash -70440620, now seen corresponding path program 2 times [2022-11-18 18:35:57,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:35:57,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278268118] [2022-11-18 18:35:57,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 18:35:57,060 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-18 18:35:57,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:35:57,061 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:57,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:35:57,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 18:35:57,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:35:57,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-18 18:35:57,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:36:06,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2022-11-18 18:36:06,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-18 18:36:07,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 56 treesize of output 36 [2022-11-18 18:36:07,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-18 18:36:07,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-18 18:36:07,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:36:07,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 18:36:07,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278268118] [2022-11-18 18:36:07,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278268118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:36:07,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:36:07,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:36:07,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288090102] [2022-11-18 18:36:07,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:36:07,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 18:36:07,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 18:36:07,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 18:36:07,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:36:07,609 INFO L87 Difference]: Start difference. First operand 187 states and 412 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:36:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:36:08,962 INFO L93 Difference]: Finished difference Result 342 states and 714 transitions. [2022-11-18 18:36:08,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 18:36:08,963 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-18 18:36:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:36:08,964 INFO L225 Difference]: With dead ends: 342 [2022-11-18 18:36:08,964 INFO L226 Difference]: Without dead ends: 342 [2022-11-18 18:36:08,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-18 18:36:08,965 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:36:08,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 22 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-18 18:36:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-11-18 18:36:08,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 195. [2022-11-18 18:36:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 193 states have (on average 2.227979274611399) internal successors, (430), 194 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:36:08,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 430 transitions. [2022-11-18 18:36:08,971 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 430 transitions. Word has length 21 [2022-11-18 18:36:08,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:36:08,972 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 430 transitions. [2022-11-18 18:36:08,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:36:08,972 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 430 transitions. [2022-11-18 18:36:08,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-18 18:36:08,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:36:08,973 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-18 18:36:08,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:36:09,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:36:09,186 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-18 18:36:09,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:36:09,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1914925968, now seen corresponding path program 3 times [2022-11-18 18:36:09,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 18:36:09,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957989994] [2022-11-18 18:36:09,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 18:36:09,187 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-18 18:36:09,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 18:36:09,188 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:36:09,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:36:09,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-18 18:36:09,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-18 18:36:09,525 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 18:36:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:36:09,776 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-18 18:36:09,776 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 18:36:09,777 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (90 of 91 remaining) [2022-11-18 18:36:09,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 91 remaining) [2022-11-18 18:36:09,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 91 remaining) [2022-11-18 18:36:09,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 91 remaining) [2022-11-18 18:36:09,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 91 remaining) [2022-11-18 18:36:09,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 91 remaining) [2022-11-18 18:36:09,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 91 remaining) [2022-11-18 18:36:09,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 91 remaining) [2022-11-18 18:36:09,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 91 remaining) [2022-11-18 18:36:09,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 91 remaining) [2022-11-18 18:36:09,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 91 remaining) [2022-11-18 18:36:09,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 91 remaining) [2022-11-18 18:36:09,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 91 remaining) [2022-11-18 18:36:09,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (77 of 91 remaining) [2022-11-18 18:36:09,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 91 remaining) [2022-11-18 18:36:09,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 91 remaining) [2022-11-18 18:36:09,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 91 remaining) [2022-11-18 18:36:09,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 91 remaining) [2022-11-18 18:36:09,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 91 remaining) [2022-11-18 18:36:09,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 91 remaining) [2022-11-18 18:36:09,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 91 remaining) [2022-11-18 18:36:09,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 91 remaining) [2022-11-18 18:36:09,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 91 remaining) [2022-11-18 18:36:09,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 91 remaining) [2022-11-18 18:36:09,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 91 remaining) [2022-11-18 18:36:09,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 91 remaining) [2022-11-18 18:36:09,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 91 remaining) [2022-11-18 18:36:09,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 91 remaining) [2022-11-18 18:36:09,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 91 remaining) [2022-11-18 18:36:09,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 91 remaining) [2022-11-18 18:36:09,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 91 remaining) [2022-11-18 18:36:09,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 91 remaining) [2022-11-18 18:36:09,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 91 remaining) [2022-11-18 18:36:09,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 91 remaining) [2022-11-18 18:36:09,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 91 remaining) [2022-11-18 18:36:09,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 91 remaining) [2022-11-18 18:36:09,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 91 remaining) [2022-11-18 18:36:09,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 91 remaining) [2022-11-18 18:36:09,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 91 remaining) [2022-11-18 18:36:09,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 91 remaining) [2022-11-18 18:36:09,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 91 remaining) [2022-11-18 18:36:09,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 91 remaining) [2022-11-18 18:36:09,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 91 remaining) [2022-11-18 18:36:09,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 91 remaining) [2022-11-18 18:36:09,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 91 remaining) [2022-11-18 18:36:09,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 91 remaining) [2022-11-18 18:36:09,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 91 remaining) [2022-11-18 18:36:09,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 91 remaining) [2022-11-18 18:36:09,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 91 remaining) [2022-11-18 18:36:09,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 91 remaining) [2022-11-18 18:36:09,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (40 of 91 remaining) [2022-11-18 18:36:09,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 91 remaining) [2022-11-18 18:36:09,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 91 remaining) [2022-11-18 18:36:09,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 91 remaining) [2022-11-18 18:36:09,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 91 remaining) [2022-11-18 18:36:09,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 91 remaining) [2022-11-18 18:36:09,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 91 remaining) [2022-11-18 18:36:09,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 91 remaining) [2022-11-18 18:36:09,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 91 remaining) [2022-11-18 18:36:09,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 91 remaining) [2022-11-18 18:36:09,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 91 remaining) [2022-11-18 18:36:09,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 91 remaining) [2022-11-18 18:36:09,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 91 remaining) [2022-11-18 18:36:09,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 91 remaining) [2022-11-18 18:36:09,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 91 remaining) [2022-11-18 18:36:09,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 91 remaining) [2022-11-18 18:36:09,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 91 remaining) [2022-11-18 18:36:09,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 91 remaining) [2022-11-18 18:36:09,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 91 remaining) [2022-11-18 18:36:09,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 91 remaining) [2022-11-18 18:36:09,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 91 remaining) [2022-11-18 18:36:09,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 91 remaining) [2022-11-18 18:36:09,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 91 remaining) [2022-11-18 18:36:09,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 91 remaining) [2022-11-18 18:36:09,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 91 remaining) [2022-11-18 18:36:09,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 91 remaining) [2022-11-18 18:36:09,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 91 remaining) [2022-11-18 18:36:09,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 91 remaining) [2022-11-18 18:36:09,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 91 remaining) [2022-11-18 18:36:09,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 91 remaining) [2022-11-18 18:36:09,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 91 remaining) [2022-11-18 18:36:09,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 91 remaining) [2022-11-18 18:36:09,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 91 remaining) [2022-11-18 18:36:09,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 91 remaining) [2022-11-18 18:36:09,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 91 remaining) [2022-11-18 18:36:09,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 91 remaining) [2022-11-18 18:36:09,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 91 remaining) [2022-11-18 18:36:09,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 91 remaining) [2022-11-18 18:36:09,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 91 remaining) [2022-11-18 18:36:09,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 91 remaining) [2022-11-18 18:36:09,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 91 remaining) [2022-11-18 18:36:09,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:36:10,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 18:36:10,012 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:36:10,017 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 18:36:10,017 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 18:36:10,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:36:10 BasicIcfg [2022-11-18 18:36:10,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 18:36:10,104 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 18:36:10,104 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 18:36:10,104 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 18:36:10,104 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:34:56" (3/4) ... [2022-11-18 18:36:10,120 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 18:36:10,120 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 18:36:10,121 INFO L158 Benchmark]: Toolchain (without parser) took 76065.28ms. Allocated memory was 60.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 38.2MB in the beginning and 534.6MB in the end (delta: -496.4MB). Peak memory consumption was 606.4MB. Max. memory is 16.1GB. [2022-11-18 18:36:10,121 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 60.8MB. Free memory is still 42.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:36:10,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 673.12ms. Allocated memory is still 60.8MB. Free memory was 38.0MB in the beginning and 29.5MB in the end (delta: 8.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 18:36:10,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.41ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 29.3MB in the beginning and 61.2MB in the end (delta: -31.9MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-11-18 18:36:10,122 INFO L158 Benchmark]: Boogie Preprocessor took 40.54ms. Allocated memory is still 79.7MB. Free memory was 60.9MB in the beginning and 58.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:36:10,122 INFO L158 Benchmark]: RCFGBuilder took 1911.20ms. Allocated memory was 79.7MB in the beginning and 107.0MB in the end (delta: 27.3MB). Free memory was 58.5MB in the beginning and 44.3MB in the end (delta: 14.2MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2022-11-18 18:36:10,123 INFO L158 Benchmark]: TraceAbstraction took 73319.20ms. Allocated memory was 107.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 43.5MB in the beginning and 534.6MB in the end (delta: -491.1MB). Peak memory consumption was 566.5MB. Max. memory is 16.1GB. [2022-11-18 18:36:10,123 INFO L158 Benchmark]: Witness Printer took 16.80ms. Allocated memory is still 1.2GB. Free memory was 534.6MB in the beginning and 534.6MB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:36:10,125 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.70ms. Allocated memory is still 60.8MB. Free memory is still 42.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 673.12ms. Allocated memory is still 60.8MB. Free memory was 38.0MB in the beginning and 29.5MB in the end (delta: 8.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.41ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 29.3MB in the beginning and 61.2MB in the end (delta: -31.9MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.54ms. Allocated memory is still 79.7MB. Free memory was 60.9MB in the beginning and 58.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1911.20ms. Allocated memory was 79.7MB in the beginning and 107.0MB in the end (delta: 27.3MB). Free memory was 58.5MB in the beginning and 44.3MB in the end (delta: 14.2MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. * TraceAbstraction took 73319.20ms. Allocated memory was 107.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 43.5MB in the beginning and 534.6MB in the end (delta: -491.1MB). Peak memory consumption was 566.5MB. Max. memory is 16.1GB. * Witness Printer took 16.80ms. Allocated memory is still 1.2GB. Free memory was 534.6MB in the beginning and 534.6MB in the end (delta: 2.7kB). 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: 42.4s, 192 PlacesBefore, 88 PlacesAfterwards, 184 TransitionsBefore, 79 TransitionsAfterwards, 7512 CoEnabledTransitionPairs, 8 FixpointIterations, 71 TrivialSequentialCompositions, 100 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 176 TotalNumberOfCompositions, 33404 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11932, independent: 11404, independent conditional: 0, independent unconditional: 11404, dependent: 436, dependent conditional: 0, dependent unconditional: 436, unknown: 92, unknown conditional: 0, unknown unconditional: 92] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4562, independent: 4446, independent conditional: 0, independent unconditional: 4446, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4562, independent: 3936, independent conditional: 0, independent unconditional: 3936, dependent: 626, dependent conditional: 0, dependent unconditional: 626, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 626, independent: 510, independent conditional: 0, independent unconditional: 510, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4589, independent: 2582, independent conditional: 0, independent unconditional: 2582, dependent: 1247, dependent conditional: 0, dependent unconditional: 1247, unknown: 760, unknown conditional: 0, unknown unconditional: 760] ], Cache Queries: [ total: 11932, independent: 6958, independent conditional: 0, independent unconditional: 6958, dependent: 339, dependent conditional: 0, dependent unconditional: 339, unknown: 4635, unknown conditional: 0, unknown unconditional: 4635] , Statistics on independence cache: Total cache size (in pairs): 637, Positive cache size: 601, Positive conditional cache size: 0, Positive unconditional cache size: 601, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 10, Unknown conditional cache size: 0, Unknown unconditional cache size: 10 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L735] 0 _Bool x$flush_delayed; [L746] 0 int *x$read_delayed_var; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L736] 0 int x$mem_tmp; [L712] 0 int __unbuffered_p0_EAX = 0; [L740] 0 _Bool x$r_buff0_thd3; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L737] 0 _Bool x$r_buff0_thd0; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L714] 0 int __unbuffered_p2_EAX = 0; [L745] 0 _Bool x$read_delayed; [L710] 0 int __unbuffered_cnt = 0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L732] 0 _Bool main$tmp_guard1; [L750] 0 _Bool x$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L748] 0 _Bool x$w_buff0_used; [L747] 0 int x$w_buff0; [L749] 0 int x$w_buff1; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L734] 0 int x = 0; [L742] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L741] 0 _Bool x$r_buff1_thd0; [L752] 0 int y = 0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L744] 0 _Bool x$r_buff1_thd3; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L743] 0 _Bool x$r_buff1_thd2; [L859] 0 pthread_t t2257; [L860] FCALL, FORK 0 pthread_create(&t2257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t2257, ((void *)0), P0, ((void *)0))=-2, t2257={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L861] 0 pthread_t t2258; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t2257={15:0}, t2258={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L862] FCALL, FORK 0 pthread_create(&t2258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t2258, ((void *)0), P1, ((void *)0))=-1, t2257={15:0}, t2258={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L863] 0 pthread_t t2259; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t2257={15:0}, t2258={5:0}, t2259={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L864] FCALL, FORK 0 pthread_create(&t2259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t2259, ((void *)0), P2, ((void *)0))=0, t2257={15:0}, t2258={5:0}, t2259={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L820] EXPR 3 \read(x) [L820] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=128, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L834] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=128, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=128, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 3 return 0; [L759] 1 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=128, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=6, weak$$choice1=128, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L801] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L802] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L804] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=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=6, weak$$choice1=128, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 \read(x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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, t2257={15:0}, t2258={5:0}, t2259={7:0}, weak$$choice0=6, weak$$choice1=128, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L877] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=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=6, weak$$choice1=2, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: 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: 857]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 864]: 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: 860]: 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, 245 locations, 91 error locations. Started 1 CEGAR loops. OverallTime: 72.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 44.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 308 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 308 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1185 IncrementalHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 19 mSDtfsCounter, 1185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54796occurred in iteration=0, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 307 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 1335 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1620 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-18 18:36:10,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_600d1020-fb47-4773-b8b0-4975716f5f2c/bin/uautomizer-TMbwUNV5ro/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