./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:53:59,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:53:59,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:53:59,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:53:59,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:53:59,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:53:59,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:53:59,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:53:59,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:53:59,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:53:59,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:53:59,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:53:59,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:53:59,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:53:59,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:53:59,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:53:59,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:53:59,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:53:59,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:53:59,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:53:59,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:53:59,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:53:59,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:53:59,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:53:59,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:53:59,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:53:59,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:53:59,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:53:59,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:53:59,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:53:59,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:53:59,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:53:59,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:53:59,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:53:59,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:53:59,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:53:59,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:53:59,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:53:59,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:53:59,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:53:59,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:53:59,387 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:53:59,425 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:53:59,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:53:59,426 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:53:59,427 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:53:59,428 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:53:59,428 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:53:59,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:53:59,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:53:59,429 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:53:59,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:53:59,431 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:53:59,431 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:53:59,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:53:59,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:53:59,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:53:59,432 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:53:59,433 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:53:59,433 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:53:59,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:53:59,433 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:53:59,434 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:53:59,434 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:53:59,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:53:59,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:53:59,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:53:59,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:53:59,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:53:59,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:53:59,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:53:59,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:53:59,437 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_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 [2022-11-16 11:53:59,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:53:59,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:53:59,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:53:59,834 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:53:59,835 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:53:59,836 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-16 11:53:59,897 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/data/b6a690d9d/a0541f9a2ba24284947eb4e08ae7a83b/FLAGea68dc8c5 [2022-11-16 11:54:00,448 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:54:00,449 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-16 11:54:00,463 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/data/b6a690d9d/a0541f9a2ba24284947eb4e08ae7a83b/FLAGea68dc8c5 [2022-11-16 11:54:00,739 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/data/b6a690d9d/a0541f9a2ba24284947eb4e08ae7a83b [2022-11-16 11:54:00,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:54:00,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:54:00,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:54:00,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:54:00,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:54:00,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:54:00" (1/1) ... [2022-11-16 11:54:00,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@792c9b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:00, skipping insertion in model container [2022-11-16 11:54:00,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:54:00" (1/1) ... [2022-11-16 11:54:00,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:54:00,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:54:01,068 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2022-11-16 11:54:01,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:54:01,280 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:54:01,296 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2022-11-16 11:54:01,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:54:01,441 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:54:01,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:01 WrapperNode [2022-11-16 11:54:01,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:54:01,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:54:01,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:54:01,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:54:01,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:01" (1/1) ... [2022-11-16 11:54:01,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:01" (1/1) ... [2022-11-16 11:54:01,529 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-11-16 11:54:01,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:54:01,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:54:01,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:54:01,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:54:01,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:01" (1/1) ... [2022-11-16 11:54:01,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:01" (1/1) ... [2022-11-16 11:54:01,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:01" (1/1) ... [2022-11-16 11:54:01,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:01" (1/1) ... [2022-11-16 11:54:01,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:01" (1/1) ... [2022-11-16 11:54:01,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:01" (1/1) ... [2022-11-16 11:54:01,579 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:01" (1/1) ... [2022-11-16 11:54:01,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:01" (1/1) ... [2022-11-16 11:54:01,596 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:54:01,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:54:01,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:54:01,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:54:01,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:01" (1/1) ... [2022-11-16 11:54:01,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:54:01,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:54:01,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:54:01,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:54:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:54:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:54:01,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:54:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:54:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:54:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:54:01,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:54:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:54:01,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:54:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:54:01,689 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:54:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:54:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:54:01,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:54:01,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:54:01,691 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:54:01,924 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:54:01,927 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:54:02,277 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:54:02,476 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:54:02,486 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:54:02,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:54:02 BoogieIcfgContainer [2022-11-16 11:54:02,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:54:02,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:54:02,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:54:02,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:54:02,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:54:00" (1/3) ... [2022-11-16 11:54:02,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3fecc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:54:02, skipping insertion in model container [2022-11-16 11:54:02,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:01" (2/3) ... [2022-11-16 11:54:02,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3fecc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:54:02, skipping insertion in model container [2022-11-16 11:54:02,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:54:02" (3/3) ... [2022-11-16 11:54:02,497 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-16 11:54:02,516 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:54:02,516 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-16 11:54:02,516 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:54:02,611 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:54:02,646 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:54:02,662 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 263 flow [2022-11-16 11:54:02,668 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 263 flow [2022-11-16 11:54:02,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-11-16 11:54:02,753 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-11-16 11:54:02,753 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:54:02,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-11-16 11:54:02,761 INFO L119 LiptonReduction]: Number of co-enabled transitions 2164 [2022-11-16 11:54:08,773 INFO L134 LiptonReduction]: Checked pairs total: 5473 [2022-11-16 11:54:08,774 INFO L136 LiptonReduction]: Total number of compositions: 121 [2022-11-16 11:54:08,789 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 34 transitions, 83 flow [2022-11-16 11:54:08,900 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 876 states, 863 states have (on average 3.2885283893395134) internal successors, (2838), 875 states have internal predecessors, (2838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:08,924 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:54:08,937 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;@2881584f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:54:08,937 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-16 11:54:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand has 876 states, 863 states have (on average 3.2885283893395134) internal successors, (2838), 875 states have internal predecessors, (2838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:08,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 11:54:08,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:08,948 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 11:54:08,949 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:08,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:08,958 INFO L85 PathProgramCache]: Analyzing trace with hash 528, now seen corresponding path program 1 times [2022-11-16 11:54:08,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:08,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285457109] [2022-11-16 11:54:08,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:08,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:09,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:09,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285457109] [2022-11-16 11:54:09,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285457109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:09,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:09,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 11:54:09,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273323250] [2022-11-16 11:54:09,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:09,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:54:09,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:09,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:54:09,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:54:09,166 INFO L87 Difference]: Start difference. First operand has 876 states, 863 states have (on average 3.2885283893395134) internal successors, (2838), 875 states have internal predecessors, (2838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:09,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:09,292 INFO L93 Difference]: Finished difference Result 818 states and 2578 transitions. [2022-11-16 11:54:09,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:54:09,294 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-16 11:54:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:09,325 INFO L225 Difference]: With dead ends: 818 [2022-11-16 11:54:09,326 INFO L226 Difference]: Without dead ends: 818 [2022-11-16 11:54:09,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:54:09,332 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:09,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:54:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2022-11-16 11:54:09,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2022-11-16 11:54:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 813 states have (on average 3.1709717097170973) internal successors, (2578), 817 states have internal predecessors, (2578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 2578 transitions. [2022-11-16 11:54:09,448 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 2578 transitions. Word has length 1 [2022-11-16 11:54:09,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:09,448 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 2578 transitions. [2022-11-16 11:54:09,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 2578 transitions. [2022-11-16 11:54:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:54:09,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:09,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:54:09,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:54:09,456 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:09,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:09,457 INFO L85 PathProgramCache]: Analyzing trace with hash 498245394, now seen corresponding path program 1 times [2022-11-16 11:54:09,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:09,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656345800] [2022-11-16 11:54:09,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:09,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:09,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:09,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656345800] [2022-11-16 11:54:09,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656345800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:09,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:09,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:54:09,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699512628] [2022-11-16 11:54:09,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:09,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:54:09,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:09,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:54:09,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:54:09,775 INFO L87 Difference]: Start difference. First operand 818 states and 2578 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:09,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:09,855 INFO L93 Difference]: Finished difference Result 670 states and 2079 transitions. [2022-11-16 11:54:09,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:54:09,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 11:54:09,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:09,862 INFO L225 Difference]: With dead ends: 670 [2022-11-16 11:54:09,862 INFO L226 Difference]: Without dead ends: 650 [2022-11-16 11:54:09,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:54:09,872 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:09,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:54:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-11-16 11:54:09,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-11-16 11:54:09,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 648 states have (on average 3.1296296296296298) internal successors, (2028), 649 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:09,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2022-11-16 11:54:09,898 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 5 [2022-11-16 11:54:09,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:09,898 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2022-11-16 11:54:09,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:09,899 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2022-11-16 11:54:09,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 11:54:09,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:09,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:09,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:54:09,901 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:09,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:09,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1169731380, now seen corresponding path program 1 times [2022-11-16 11:54:09,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:09,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459336499] [2022-11-16 11:54:09,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:09,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:10,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:10,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459336499] [2022-11-16 11:54:10,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459336499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:10,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:10,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:54:10,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912153397] [2022-11-16 11:54:10,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:10,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:54:10,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:10,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:54:10,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:54:10,197 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:10,295 INFO L93 Difference]: Finished difference Result 1078 states and 3248 transitions. [2022-11-16 11:54:10,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:54:10,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 11:54:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:10,302 INFO L225 Difference]: With dead ends: 1078 [2022-11-16 11:54:10,303 INFO L226 Difference]: Without dead ends: 1078 [2022-11-16 11:54:10,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:54:10,304 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:10,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:54:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2022-11-16 11:54:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 838. [2022-11-16 11:54:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 836 states have (on average 3.123205741626794) internal successors, (2611), 837 states have internal predecessors, (2611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 2611 transitions. [2022-11-16 11:54:10,338 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 2611 transitions. Word has length 9 [2022-11-16 11:54:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:10,339 INFO L495 AbstractCegarLoop]: Abstraction has 838 states and 2611 transitions. [2022-11-16 11:54:10,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 2611 transitions. [2022-11-16 11:54:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 11:54:10,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:10,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:10,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:54:10,342 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:10,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1172205391, now seen corresponding path program 1 times [2022-11-16 11:54:10,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:10,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647225449] [2022-11-16 11:54:10,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:10,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:10,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:10,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647225449] [2022-11-16 11:54:10,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647225449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:10,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:10,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:54:10,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285897735] [2022-11-16 11:54:10,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:10,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:54:10,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:10,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:54:10,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:54:10,657 INFO L87 Difference]: Start difference. First operand 838 states and 2611 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:10,785 INFO L93 Difference]: Finished difference Result 1027 states and 3091 transitions. [2022-11-16 11:54:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:54:10,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 11:54:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:10,792 INFO L225 Difference]: With dead ends: 1027 [2022-11-16 11:54:10,792 INFO L226 Difference]: Without dead ends: 1027 [2022-11-16 11:54:10,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:54:10,793 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:10,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:54:10,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2022-11-16 11:54:10,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 808. [2022-11-16 11:54:10,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 3.1029776674937963) internal successors, (2501), 807 states have internal predecessors, (2501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 2501 transitions. [2022-11-16 11:54:10,824 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 2501 transitions. Word has length 10 [2022-11-16 11:54:10,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:10,824 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 2501 transitions. [2022-11-16 11:54:10,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 2501 transitions. [2022-11-16 11:54:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 11:54:10,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:10,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:10,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:54:10,826 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:10,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1901933665, now seen corresponding path program 1 times [2022-11-16 11:54:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:10,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627611427] [2022-11-16 11:54:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:10,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:11,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:11,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627611427] [2022-11-16 11:54:11,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627611427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:11,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:11,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:54:11,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935284718] [2022-11-16 11:54:11,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:11,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:54:11,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:11,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:54:11,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:54:11,194 INFO L87 Difference]: Start difference. First operand 808 states and 2501 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:11,450 INFO L93 Difference]: Finished difference Result 859 states and 2584 transitions. [2022-11-16 11:54:11,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:54:11,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 11:54:11,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:11,455 INFO L225 Difference]: With dead ends: 859 [2022-11-16 11:54:11,455 INFO L226 Difference]: Without dead ends: 759 [2022-11-16 11:54:11,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:54:11,456 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:11,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 21 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:54:11,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2022-11-16 11:54:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 714. [2022-11-16 11:54:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 712 states have (on average 3.085674157303371) internal successors, (2197), 713 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 2197 transitions. [2022-11-16 11:54:11,480 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 2197 transitions. Word has length 10 [2022-11-16 11:54:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:11,480 INFO L495 AbstractCegarLoop]: Abstraction has 714 states and 2197 transitions. [2022-11-16 11:54:11,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 2197 transitions. [2022-11-16 11:54:11,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:54:11,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:11,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:11,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:54:11,482 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:11,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:11,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1095154464, now seen corresponding path program 1 times [2022-11-16 11:54:11,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:11,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096454836] [2022-11-16 11:54:11,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:11,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:11,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-16 11:54:11,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:11,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096454836] [2022-11-16 11:54:11,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096454836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:11,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:11,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:54:11,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652443944] [2022-11-16 11:54:11,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:11,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:54:11,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:11,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:54:11,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:54:11,600 INFO L87 Difference]: Start difference. First operand 714 states and 2197 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-16 11:54:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:11,726 INFO L93 Difference]: Finished difference Result 909 states and 2714 transitions. [2022-11-16 11:54:11,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:54:11,728 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-16 11:54:11,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:11,733 INFO L225 Difference]: With dead ends: 909 [2022-11-16 11:54:11,733 INFO L226 Difference]: Without dead ends: 909 [2022-11-16 11:54:11,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:54:11,735 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:11,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 5 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:54:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2022-11-16 11:54:11,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 672. [2022-11-16 11:54:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 670 states have (on average 3.0671641791044775) internal successors, (2055), 671 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 2055 transitions. [2022-11-16 11:54:11,774 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 2055 transitions. Word has length 11 [2022-11-16 11:54:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:11,774 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 2055 transitions. [2022-11-16 11:54:11,774 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-16 11:54:11,775 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 2055 transitions. [2022-11-16 11:54:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:54:11,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:11,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:11,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:54:11,776 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:11,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1098058065, now seen corresponding path program 1 times [2022-11-16 11:54:11,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:11,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929332982] [2022-11-16 11:54:11,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:11,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:12,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:12,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929332982] [2022-11-16 11:54:12,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929332982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:12,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:12,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:54:12,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53151566] [2022-11-16 11:54:12,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:12,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:54:12,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:12,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:54:12,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:54:12,368 INFO L87 Difference]: Start difference. First operand 672 states and 2055 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:12,701 INFO L93 Difference]: Finished difference Result 841 states and 2533 transitions. [2022-11-16 11:54:12,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:54:12,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 11:54:12,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:12,705 INFO L225 Difference]: With dead ends: 841 [2022-11-16 11:54:12,705 INFO L226 Difference]: Without dead ends: 413 [2022-11-16 11:54:12,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:54:12,706 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 40 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:12,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 15 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:54:12,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-16 11:54:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2022-11-16 11:54:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 411 states have (on average 2.9197080291970803) internal successors, (1200), 412 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1200 transitions. [2022-11-16 11:54:12,720 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1200 transitions. Word has length 11 [2022-11-16 11:54:12,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:12,720 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 1200 transitions. [2022-11-16 11:54:12,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1200 transitions. [2022-11-16 11:54:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:54:12,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:12,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:12,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:54:12,722 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash 473470360, now seen corresponding path program 1 times [2022-11-16 11:54:12,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:12,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724262720] [2022-11-16 11:54:12,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:12,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:12,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:12,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:12,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724262720] [2022-11-16 11:54:12,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724262720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:12,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:12,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:54:12,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823512556] [2022-11-16 11:54:12,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:12,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:54:12,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:12,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:54:12,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:54:12,922 INFO L87 Difference]: Start difference. First operand 413 states and 1200 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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-16 11:54:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:13,036 INFO L93 Difference]: Finished difference Result 476 states and 1356 transitions. [2022-11-16 11:54:13,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:54:13,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-16 11:54:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:13,040 INFO L225 Difference]: With dead ends: 476 [2022-11-16 11:54:13,040 INFO L226 Difference]: Without dead ends: 476 [2022-11-16 11:54:13,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:54:13,041 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:13,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:54:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-16 11:54:13,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 377. [2022-11-16 11:54:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 375 states have (on average 2.88) internal successors, (1080), 376 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1080 transitions. [2022-11-16 11:54:13,053 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1080 transitions. Word has length 13 [2022-11-16 11:54:13,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:13,054 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 1080 transitions. [2022-11-16 11:54:13,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-16 11:54:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1080 transitions. [2022-11-16 11:54:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:54:13,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:13,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:13,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:54:13,055 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:13,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash 474735456, now seen corresponding path program 1 times [2022-11-16 11:54:13,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:13,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112190550] [2022-11-16 11:54:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:13,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:14,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:14,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112190550] [2022-11-16 11:54:14,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112190550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:14,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:14,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:54:14,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667565023] [2022-11-16 11:54:14,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:14,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:54:14,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:14,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:54:14,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:54:14,018 INFO L87 Difference]: Start difference. First operand 377 states and 1080 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-16 11:54:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:14,348 INFO L93 Difference]: Finished difference Result 638 states and 1818 transitions. [2022-11-16 11:54:14,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:54:14,348 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-16 11:54:14,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:14,352 INFO L225 Difference]: With dead ends: 638 [2022-11-16 11:54:14,353 INFO L226 Difference]: Without dead ends: 590 [2022-11-16 11:54:14,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:54:14,354 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 58 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:14,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 21 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:54:14,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-11-16 11:54:14,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 537. [2022-11-16 11:54:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 535 states have (on average 2.8373831775700933) internal successors, (1518), 536 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:14,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1518 transitions. [2022-11-16 11:54:14,379 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1518 transitions. Word has length 13 [2022-11-16 11:54:14,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:14,380 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 1518 transitions. [2022-11-16 11:54:14,380 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-16 11:54:14,380 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1518 transitions. [2022-11-16 11:54:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:54:14,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:14,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:14,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:54:14,382 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:14,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:14,383 INFO L85 PathProgramCache]: Analyzing trace with hash 593320596, now seen corresponding path program 1 times [2022-11-16 11:54:14,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:14,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390198405] [2022-11-16 11:54:14,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:14,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:14,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:14,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390198405] [2022-11-16 11:54:14,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390198405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:14,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:14,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:54:14,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824422602] [2022-11-16 11:54:14,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:14,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:54:14,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:14,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:54:14,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:54:14,571 INFO L87 Difference]: Start difference. First operand 537 states and 1518 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:14,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:14,700 INFO L93 Difference]: Finished difference Result 987 states and 2760 transitions. [2022-11-16 11:54:14,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:54:14,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 11:54:14,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:14,705 INFO L225 Difference]: With dead ends: 987 [2022-11-16 11:54:14,706 INFO L226 Difference]: Without dead ends: 819 [2022-11-16 11:54:14,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:54:14,707 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 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-16 11:54:14,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 2 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:54:14,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-11-16 11:54:14,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 650. [2022-11-16 11:54:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 648 states have (on average 2.8487654320987654) internal successors, (1846), 649 states have internal predecessors, (1846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1846 transitions. [2022-11-16 11:54:14,731 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1846 transitions. Word has length 14 [2022-11-16 11:54:14,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:14,732 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 1846 transitions. [2022-11-16 11:54:14,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:14,732 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1846 transitions. [2022-11-16 11:54:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:54:14,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:14,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:14,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:54:14,734 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:14,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:14,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1789776418, now seen corresponding path program 2 times [2022-11-16 11:54:14,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:14,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217710210] [2022-11-16 11:54:14,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:14,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:14,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:14,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:14,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217710210] [2022-11-16 11:54:14,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217710210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:14,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:14,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:54:14,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902802670] [2022-11-16 11:54:14,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:14,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:54:14,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:14,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:54:14,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:54:14,884 INFO L87 Difference]: Start difference. First operand 650 states and 1846 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:15,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:15,062 INFO L93 Difference]: Finished difference Result 909 states and 2517 transitions. [2022-11-16 11:54:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:54:15,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 11:54:15,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:15,067 INFO L225 Difference]: With dead ends: 909 [2022-11-16 11:54:15,067 INFO L226 Difference]: Without dead ends: 765 [2022-11-16 11:54:15,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:54:15,068 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 46 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:15,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 5 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:54:15,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2022-11-16 11:54:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 504. [2022-11-16 11:54:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 502 states have (on average 2.7729083665338647) internal successors, (1392), 503 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1392 transitions. [2022-11-16 11:54:15,088 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1392 transitions. Word has length 14 [2022-11-16 11:54:15,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:15,088 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 1392 transitions. [2022-11-16 11:54:15,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1392 transitions. [2022-11-16 11:54:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:54:15,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:15,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:15,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:54:15,090 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:15,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:15,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1740621268, now seen corresponding path program 3 times [2022-11-16 11:54:15,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:15,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478548174] [2022-11-16 11:54:15,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:15,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:15,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:15,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478548174] [2022-11-16 11:54:15,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478548174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:15,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:15,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:54:15,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967848051] [2022-11-16 11:54:15,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:15,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:54:15,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:15,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:54:15,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:54:15,223 INFO L87 Difference]: Start difference. First operand 504 states and 1392 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-16 11:54:15,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:15,347 INFO L93 Difference]: Finished difference Result 508 states and 1227 transitions. [2022-11-16 11:54:15,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:54:15,348 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-16 11:54:15,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:15,350 INFO L225 Difference]: With dead ends: 508 [2022-11-16 11:54:15,350 INFO L226 Difference]: Without dead ends: 392 [2022-11-16 11:54:15,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:54:15,351 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 26 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10 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-16 11:54:15,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:54:15,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-11-16 11:54:15,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2022-11-16 11:54:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 390 states have (on average 2.4512820512820515) internal successors, (956), 391 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 956 transitions. [2022-11-16 11:54:15,364 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 956 transitions. Word has length 14 [2022-11-16 11:54:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:15,365 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 956 transitions. [2022-11-16 11:54:15,365 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-16 11:54:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 956 transitions. [2022-11-16 11:54:15,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:54:15,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:15,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:15,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:54:15,367 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:15,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:15,367 INFO L85 PathProgramCache]: Analyzing trace with hash -956783864, now seen corresponding path program 1 times [2022-11-16 11:54:15,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:15,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984479961] [2022-11-16 11:54:15,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:15,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:16,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:16,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984479961] [2022-11-16 11:54:16,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984479961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:16,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:16,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:54:16,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033731680] [2022-11-16 11:54:16,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:16,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:54:16,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:16,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:54:16,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:54:16,039 INFO L87 Difference]: Start difference. First operand 392 states and 956 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:16,335 INFO L93 Difference]: Finished difference Result 504 states and 1210 transitions. [2022-11-16 11:54:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:54:16,336 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 11:54:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:16,337 INFO L225 Difference]: With dead ends: 504 [2022-11-16 11:54:16,338 INFO L226 Difference]: Without dead ends: 342 [2022-11-16 11:54:16,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:54:16,338 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:16,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 19 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:54:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-11-16 11:54:16,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 272. [2022-11-16 11:54:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 270 states have (on average 2.314814814814815) internal successors, (625), 271 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 625 transitions. [2022-11-16 11:54:16,350 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 625 transitions. Word has length 15 [2022-11-16 11:54:16,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:16,351 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 625 transitions. [2022-11-16 11:54:16,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 625 transitions. [2022-11-16 11:54:16,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:54:16,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:16,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:16,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:54:16,352 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:16,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:16,353 INFO L85 PathProgramCache]: Analyzing trace with hash -153130147, now seen corresponding path program 1 times [2022-11-16 11:54:16,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:16,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147911077] [2022-11-16 11:54:16,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:16,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:16,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:16,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:16,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147911077] [2022-11-16 11:54:16,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147911077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:16,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:16,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:54:16,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970517061] [2022-11-16 11:54:16,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:16,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:54:16,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:16,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:54:16,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:54:16,965 INFO L87 Difference]: Start difference. First operand 272 states and 625 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:17,206 INFO L93 Difference]: Finished difference Result 494 states and 1145 transitions. [2022-11-16 11:54:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:54:17,207 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 11:54:17,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:17,209 INFO L225 Difference]: With dead ends: 494 [2022-11-16 11:54:17,209 INFO L226 Difference]: Without dead ends: 384 [2022-11-16 11:54:17,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:54:17,210 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:17,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 23 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:54:17,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-11-16 11:54:17,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 266. [2022-11-16 11:54:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 264 states have (on average 2.3143939393939394) internal successors, (611), 265 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 611 transitions. [2022-11-16 11:54:17,221 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 611 transitions. Word has length 16 [2022-11-16 11:54:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:17,222 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 611 transitions. [2022-11-16 11:54:17,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 611 transitions. [2022-11-16 11:54:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:54:17,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:17,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:17,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:54:17,224 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:17,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:17,225 INFO L85 PathProgramCache]: Analyzing trace with hash 459104583, now seen corresponding path program 2 times [2022-11-16 11:54:17,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:17,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889062528] [2022-11-16 11:54:17,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:17,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:18,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:18,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889062528] [2022-11-16 11:54:18,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889062528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:18,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:18,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:54:18,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118027271] [2022-11-16 11:54:18,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:18,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:54:18,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:18,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:54:18,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:54:18,523 INFO L87 Difference]: Start difference. First operand 266 states and 611 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:18,891 INFO L93 Difference]: Finished difference Result 421 states and 958 transitions. [2022-11-16 11:54:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:54:18,892 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 11:54:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:18,894 INFO L225 Difference]: With dead ends: 421 [2022-11-16 11:54:18,894 INFO L226 Difference]: Without dead ends: 317 [2022-11-16 11:54:18,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:54:18,895 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:18,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 38 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:54:18,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-16 11:54:18,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 226. [2022-11-16 11:54:18,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 224 states have (on average 2.2544642857142856) internal successors, (505), 225 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 505 transitions. [2022-11-16 11:54:18,905 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 505 transitions. Word has length 16 [2022-11-16 11:54:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:18,905 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 505 transitions. [2022-11-16 11:54:18,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 505 transitions. [2022-11-16 11:54:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:54:18,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:18,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:18,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:54:18,907 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:18,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:18,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1646439868, now seen corresponding path program 1 times [2022-11-16 11:54:18,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:18,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038087831] [2022-11-16 11:54:18,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:18,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:19,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:19,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038087831] [2022-11-16 11:54:19,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038087831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:19,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:19,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:54:19,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607453255] [2022-11-16 11:54:19,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:19,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:54:19,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:19,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:54:19,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:54:19,081 INFO L87 Difference]: Start difference. First operand 226 states and 505 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:19,210 INFO L93 Difference]: Finished difference Result 188 states and 361 transitions. [2022-11-16 11:54:19,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:54:19,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 11:54:19,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:19,211 INFO L225 Difference]: With dead ends: 188 [2022-11-16 11:54:19,211 INFO L226 Difference]: Without dead ends: 146 [2022-11-16 11:54:19,212 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-16 11:54:19,212 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 44 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:19,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 10 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:54:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-16 11:54:19,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-11-16 11:54:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 144 states have (on average 1.8680555555555556) internal successors, (269), 145 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 269 transitions. [2022-11-16 11:54:19,217 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 269 transitions. Word has length 16 [2022-11-16 11:54:19,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:19,217 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 269 transitions. [2022-11-16 11:54:19,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:19,217 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 269 transitions. [2022-11-16 11:54:19,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 11:54:19,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:19,218 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-16 11:54:19,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:54:19,218 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:19,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:19,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1254760389, now seen corresponding path program 1 times [2022-11-16 11:54:19,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:19,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618662634] [2022-11-16 11:54:19,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:19,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:20,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:20,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618662634] [2022-11-16 11:54:20,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618662634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:20,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:20,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:54:20,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719939613] [2022-11-16 11:54:20,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:20,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:54:20,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:20,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:54:20,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:54:20,264 INFO L87 Difference]: Start difference. First operand 146 states and 269 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-16 11:54:20,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:20,530 INFO L93 Difference]: Finished difference Result 140 states and 258 transitions. [2022-11-16 11:54:20,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:54:20,531 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-16 11:54:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:20,532 INFO L225 Difference]: With dead ends: 140 [2022-11-16 11:54:20,532 INFO L226 Difference]: Without dead ends: 81 [2022-11-16 11:54:20,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:54:20,533 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:20,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 23 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:54:20,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-16 11:54:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-16 11:54:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.9) internal successors, (152), 80 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 152 transitions. [2022-11-16 11:54:20,536 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 152 transitions. Word has length 18 [2022-11-16 11:54:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:20,537 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 152 transitions. [2022-11-16 11:54:20,537 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-16 11:54:20,537 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 152 transitions. [2022-11-16 11:54:20,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 11:54:20,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:20,538 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-16 11:54:20,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:54:20,539 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:20,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:20,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1577608788, now seen corresponding path program 1 times [2022-11-16 11:54:20,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:20,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619600504] [2022-11-16 11:54:20,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:20,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:20,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:20,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619600504] [2022-11-16 11:54:20,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619600504] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:20,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:20,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:54:20,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344565844] [2022-11-16 11:54:20,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:20,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:54:20,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:20,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:54:20,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:54:20,934 INFO L87 Difference]: Start difference. First operand 81 states and 152 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-16 11:54:21,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:21,113 INFO L93 Difference]: Finished difference Result 103 states and 190 transitions. [2022-11-16 11:54:21,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:54:21,114 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-16 11:54:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:21,115 INFO L225 Difference]: With dead ends: 103 [2022-11-16 11:54:21,115 INFO L226 Difference]: Without dead ends: 81 [2022-11-16 11:54:21,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:54:21,116 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 42 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:21,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 9 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:54:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-16 11:54:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-16 11:54:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.875) internal successors, (150), 80 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 150 transitions. [2022-11-16 11:54:21,119 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 150 transitions. Word has length 18 [2022-11-16 11:54:21,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:21,119 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 150 transitions. [2022-11-16 11:54:21,122 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-16 11:54:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 150 transitions. [2022-11-16 11:54:21,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 11:54:21,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:21,123 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-16 11:54:21,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:54:21,123 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:21,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:21,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1591431812, now seen corresponding path program 1 times [2022-11-16 11:54:21,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:21,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852481141] [2022-11-16 11:54:21,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:21,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:21,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:21,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852481141] [2022-11-16 11:54:21,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852481141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:21,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:21,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:54:21,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474639701] [2022-11-16 11:54:21,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:21,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:54:21,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:21,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:54:21,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:54:21,339 INFO L87 Difference]: Start difference. First operand 81 states and 150 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-16 11:54:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:21,459 INFO L93 Difference]: Finished difference Result 69 states and 124 transitions. [2022-11-16 11:54:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:54:21,460 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-16 11:54:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:21,461 INFO L225 Difference]: With dead ends: 69 [2022-11-16 11:54:21,461 INFO L226 Difference]: Without dead ends: 61 [2022-11-16 11:54:21,461 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-16 11:54:21,462 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 51 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:21,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 5 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:54:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-16 11:54:21,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-16 11:54:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2022-11-16 11:54:21,466 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 18 [2022-11-16 11:54:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:21,466 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2022-11-16 11:54:21,467 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-16 11:54:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2022-11-16 11:54:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:54:21,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:21,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:21,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:54:21,470 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:21,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:21,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1695761930, now seen corresponding path program 1 times [2022-11-16 11:54:21,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:21,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252127464] [2022-11-16 11:54:21,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:21,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:22,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-16 11:54:22,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:22,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252127464] [2022-11-16 11:54:22,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252127464] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:22,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:22,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:54:22,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421946636] [2022-11-16 11:54:22,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:22,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:54:22,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:22,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:54:22,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:54:22,498 INFO L87 Difference]: Start difference. First operand 61 states and 110 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:22,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:22,709 INFO L93 Difference]: Finished difference Result 71 states and 124 transitions. [2022-11-16 11:54:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:54:22,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 11:54:22,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:22,710 INFO L225 Difference]: With dead ends: 71 [2022-11-16 11:54:22,710 INFO L226 Difference]: Without dead ends: 41 [2022-11-16 11:54:22,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:54:22,711 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 45 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:22,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 12 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:54:22,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-16 11:54:22,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-16 11:54:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.6) internal successors, (64), 40 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:22,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2022-11-16 11:54:22,713 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 20 [2022-11-16 11:54:22,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:22,713 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2022-11-16 11:54:22,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:22,713 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2022-11-16 11:54:22,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:54:22,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:22,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:22,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:54:22,714 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:22,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:22,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1667804380, now seen corresponding path program 2 times [2022-11-16 11:54:22,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:22,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135901321] [2022-11-16 11:54:22,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:22,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:54:22,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:54:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:54:22,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:54:22,865 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:54:22,867 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-16 11:54:22,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-16 11:54:22,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-16 11:54:22,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-16 11:54:22,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-16 11:54:22,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-16 11:54:22,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-16 11:54:22,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-16 11:54:22,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-16 11:54:22,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-16 11:54:22,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-16 11:54:22,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-16 11:54:22,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-16 11:54:22,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:54:22,881 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:22,887 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:54:22,887 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:54:22,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:54:22 BasicIcfg [2022-11-16 11:54:22,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:54:22,986 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:54:22,986 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:54:22,987 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:54:22,987 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:54:02" (3/4) ... [2022-11-16 11:54:22,990 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:54:22,990 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:54:22,990 INFO L158 Benchmark]: Toolchain (without parser) took 22241.73ms. Allocated memory was 90.2MB in the beginning and 337.6MB in the end (delta: 247.5MB). Free memory was 50.2MB in the beginning and 112.4MB in the end (delta: -62.2MB). Peak memory consumption was 184.6MB. Max. memory is 16.1GB. [2022-11-16 11:54:22,991 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 90.2MB. Free memory was 68.0MB in the beginning and 67.9MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:54:22,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 691.14ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 50.0MB in the beginning and 94.8MB in the end (delta: -44.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:54:22,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.29ms. Allocated memory is still 132.1MB. Free memory was 94.5MB in the beginning and 91.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:54:22,996 INFO L158 Benchmark]: Boogie Preprocessor took 65.77ms. Allocated memory is still 132.1MB. Free memory was 91.8MB in the beginning and 90.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:54:22,996 INFO L158 Benchmark]: RCFGBuilder took 891.54ms. Allocated memory is still 132.1MB. Free memory was 90.3MB in the beginning and 57.1MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-16 11:54:22,997 INFO L158 Benchmark]: TraceAbstraction took 20496.14ms. Allocated memory was 132.1MB in the beginning and 337.6MB in the end (delta: 205.5MB). Free memory was 56.2MB in the beginning and 112.4MB in the end (delta: -56.2MB). Peak memory consumption was 151.0MB. Max. memory is 16.1GB. [2022-11-16 11:54:22,997 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 337.6MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:54:23,003 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.24ms. Allocated memory is still 90.2MB. Free memory was 68.0MB in the beginning and 67.9MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 691.14ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 50.0MB in the beginning and 94.8MB in the end (delta: -44.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.29ms. Allocated memory is still 132.1MB. Free memory was 94.5MB in the beginning and 91.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.77ms. Allocated memory is still 132.1MB. Free memory was 91.8MB in the beginning and 90.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 891.54ms. Allocated memory is still 132.1MB. Free memory was 90.3MB in the beginning and 57.1MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20496.14ms. Allocated memory was 132.1MB in the beginning and 337.6MB in the end (delta: 205.5MB). Free memory was 56.2MB in the beginning and 112.4MB in the end (delta: -56.2MB). Peak memory consumption was 151.0MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 337.6MB. Free memory is still 112.4MB. 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: 6.1s, 132 PlacesBefore, 43 PlacesAfterwards, 124 TransitionsBefore, 34 TransitionsAfterwards, 2164 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 121 TotalNumberOfCompositions, 5473 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2969, independent: 2807, independent conditional: 0, independent unconditional: 2807, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1607, independent: 1554, independent conditional: 0, independent unconditional: 1554, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1607, independent: 1531, independent conditional: 0, independent unconditional: 1531, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 473, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 423, dependent conditional: 0, dependent unconditional: 423, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2969, independent: 1253, independent conditional: 0, independent unconditional: 1253, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 1607, unknown conditional: 0, unknown unconditional: 1607] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 138, Positive conditional cache size: 0, Positive unconditional cache size: 138, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L721] 0 _Bool x$flush_delayed; [L732] 0 int *x$read_delayed_var; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L722] 0 int x$mem_tmp; [L712] 0 int __unbuffered_p0_EAX = 0; [L726] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd0; [L716] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool x$read_delayed; [L710] 0 int __unbuffered_cnt = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L718] 0 _Bool main$tmp_guard1; [L736] 0 _Bool x$w_buff1_used; [L717] 0 _Bool main$tmp_guard0; [L734] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff0; [L735] 0 int x$w_buff1; [L720] 0 int x = 0; [L728] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd0; [L738] 0 int y = 0; [L730] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$r_buff1_thd2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1828, ((void *)0), P0, ((void *)0))=-3, t1828={5:0}, weak$$choice0=0, weak$$choice2=0, x=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] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1829, ((void *)0), P1, ((void *)0))=-2, t1828={5:0}, t1829={6:0}, weak$$choice0=0, weak$$choice2=0, x=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] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1830, ((void *)0), P2, ((void *)0))=-1, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=0, weak$$choice2=0, x=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] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice2=0, x=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] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice2=0, x=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] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 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) [L752] 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)) [L753] 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)) [L754] 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)) [L755] 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)) [L756] 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)) [L757] 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)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=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] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L787] 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) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 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 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 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}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=49, weak$$choice2=0, x=1, 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] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L807] 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) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 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 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 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 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, 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] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L849] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=49, weak$$choice2=0, x=1, 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: 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: 827]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 830]: 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: 834]: 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, 150 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 653 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 653 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2404 IncrementalHoareTripleChecker+Invalid, 2481 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 65 mSDtfsCounter, 2404 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=876occurred in iteration=0, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 1602 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 3466 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-16 11:54:23,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:54:25,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:54:25,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:54:25,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:54:25,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:54:25,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:54:25,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:54:25,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:54:25,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:54:25,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:54:25,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:54:25,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:54:25,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:54:25,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:54:25,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:54:25,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:54:25,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:54:25,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:54:25,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:54:25,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:54:25,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:54:25,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:54:25,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:54:25,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:54:25,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:54:25,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:54:25,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:54:25,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:54:25,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:54:25,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:54:25,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:54:25,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:54:25,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:54:25,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:54:25,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:54:25,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:54:25,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:54:25,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:54:25,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:54:25,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:54:25,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:54:25,553 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 11:54:25,598 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:54:25,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:54:25,600 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:54:25,600 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:54:25,601 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:54:25,601 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:54:25,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:54:25,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:54:25,603 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:54:25,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:54:25,605 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:54:25,605 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:54:25,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:54:25,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:54:25,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:54:25,606 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:54:25,606 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:54:25,606 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:54:25,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:54:25,607 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:54:25,607 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:54:25,607 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:54:25,607 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:54:25,608 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:54:25,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:54:25,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:54:25,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:54:25,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:54:25,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:54:25,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:54:25,609 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:54:25,610 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:54:25,610 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:54:25,610 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_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 [2022-11-16 11:54:26,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:54:26,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:54:26,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:54:26,036 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:54:26,039 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:54:26,041 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-16 11:54:26,112 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/data/747601074/7fc975f3549d455480dcc6b10a15b7a4/FLAG13fd689b1 [2022-11-16 11:54:26,744 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:54:26,748 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-16 11:54:26,763 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/data/747601074/7fc975f3549d455480dcc6b10a15b7a4/FLAG13fd689b1 [2022-11-16 11:54:27,027 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/data/747601074/7fc975f3549d455480dcc6b10a15b7a4 [2022-11-16 11:54:27,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:54:27,031 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:54:27,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:54:27,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:54:27,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:54:27,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:54:27" (1/1) ... [2022-11-16 11:54:27,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71000b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:27, skipping insertion in model container [2022-11-16 11:54:27,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:54:27" (1/1) ... [2022-11-16 11:54:27,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:54:27,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:54:27,299 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2022-11-16 11:54:27,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:54:27,555 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:54:27,569 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2022-11-16 11:54:27,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:54:27,708 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:54:27,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:27 WrapperNode [2022-11-16 11:54:27,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:54:27,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:54:27,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:54:27,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:54:27,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:27" (1/1) ... [2022-11-16 11:54:27,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:27" (1/1) ... [2022-11-16 11:54:27,802 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-11-16 11:54:27,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:54:27,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:54:27,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:54:27,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:54:27,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:27" (1/1) ... [2022-11-16 11:54:27,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:27" (1/1) ... [2022-11-16 11:54:27,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:27" (1/1) ... [2022-11-16 11:54:27,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:27" (1/1) ... [2022-11-16 11:54:27,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:27" (1/1) ... [2022-11-16 11:54:27,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:27" (1/1) ... [2022-11-16 11:54:27,859 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:27" (1/1) ... [2022-11-16 11:54:27,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:27" (1/1) ... [2022-11-16 11:54:27,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:54:27,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:54:27,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:54:27,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:54:27,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:27" (1/1) ... [2022-11-16 11:54:27,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:54:27,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:54:27,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:54:27,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:54:27,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:54:27,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:54:27,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:54:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:54:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 11:54:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 11:54:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:54:27,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:54:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:54:27,990 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:54:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:54:27,990 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:54:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:54:27,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:54:27,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:54:27,992 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:54:28,216 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:54:28,218 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:54:28,634 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:54:28,770 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:54:28,770 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:54:28,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:54:28 BoogieIcfgContainer [2022-11-16 11:54:28,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:54:28,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:54:28,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:54:28,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:54:28,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:54:27" (1/3) ... [2022-11-16 11:54:28,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fadceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:54:28, skipping insertion in model container [2022-11-16 11:54:28,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:54:27" (2/3) ... [2022-11-16 11:54:28,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fadceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:54:28, skipping insertion in model container [2022-11-16 11:54:28,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:54:28" (3/3) ... [2022-11-16 11:54:28,783 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-16 11:54:28,803 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:54:28,803 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-16 11:54:28,803 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:54:28,868 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:54:28,916 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:54:28,937 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 125 transitions, 265 flow [2022-11-16 11:54:28,946 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 125 transitions, 265 flow [2022-11-16 11:54:28,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-11-16 11:54:29,007 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-11-16 11:54:29,008 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:54:29,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-11-16 11:54:29,016 INFO L119 LiptonReduction]: Number of co-enabled transitions 2164 [2022-11-16 11:54:38,473 INFO L134 LiptonReduction]: Checked pairs total: 5431 [2022-11-16 11:54:38,474 INFO L136 LiptonReduction]: Total number of compositions: 126 [2022-11-16 11:54:38,482 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 34 transitions, 83 flow [2022-11-16 11:54:38,596 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 876 states, 863 states have (on average 3.2885283893395134) internal successors, (2838), 875 states have internal predecessors, (2838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:38,621 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:54:38,631 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;@c9cc166, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:54:38,632 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-16 11:54:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 876 states, 863 states have (on average 3.2885283893395134) internal successors, (2838), 875 states have internal predecessors, (2838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:38,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 11:54:38,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:38,643 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 11:54:38,644 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:38,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:38,655 INFO L85 PathProgramCache]: Analyzing trace with hash 533, now seen corresponding path program 1 times [2022-11-16 11:54:38,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:54:38,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240188707] [2022-11-16 11:54:38,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:38,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:38,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:54:38,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:54:38,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 11:54:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:38,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 11:54:38,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:38,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:54:38,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:54:38,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240188707] [2022-11-16 11:54:38,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240188707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:38,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:38,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 11:54:38,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113430141] [2022-11-16 11:54:38,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:38,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:54:38,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:54:38,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:54:38,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:54:38,845 INFO L87 Difference]: Start difference. First operand has 876 states, 863 states have (on average 3.2885283893395134) internal successors, (2838), 875 states have internal predecessors, (2838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:39,026 INFO L93 Difference]: Finished difference Result 818 states and 2578 transitions. [2022-11-16 11:54:39,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:54:39,031 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-16 11:54:39,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:39,057 INFO L225 Difference]: With dead ends: 818 [2022-11-16 11:54:39,057 INFO L226 Difference]: Without dead ends: 818 [2022-11-16 11:54:39,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:54:39,062 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:39,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:54:39,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2022-11-16 11:54:39,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2022-11-16 11:54:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 813 states have (on average 3.1709717097170973) internal successors, (2578), 817 states have internal predecessors, (2578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 2578 transitions. [2022-11-16 11:54:39,210 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 2578 transitions. Word has length 1 [2022-11-16 11:54:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:39,211 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 2578 transitions. [2022-11-16 11:54:39,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 2578 transitions. [2022-11-16 11:54:39,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:54:39,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:39,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:54:39,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:39,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:39,413 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:39,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:39,414 INFO L85 PathProgramCache]: Analyzing trace with hash 505702819, now seen corresponding path program 1 times [2022-11-16 11:54:39,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:54:39,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485346216] [2022-11-16 11:54:39,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:39,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:39,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:54:39,424 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:54:39,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 11:54:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:39,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:54:39,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:39,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:54:39,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:54:39,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485346216] [2022-11-16 11:54:39,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485346216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:39,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:39,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:54:39,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879396239] [2022-11-16 11:54:39,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:39,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:54:39,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:54:39,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:54:39,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:54:39,586 INFO L87 Difference]: Start difference. First operand 818 states and 2578 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:39,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:39,722 INFO L93 Difference]: Finished difference Result 670 states and 2079 transitions. [2022-11-16 11:54:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:54:39,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 11:54:39,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:39,728 INFO L225 Difference]: With dead ends: 670 [2022-11-16 11:54:39,731 INFO L226 Difference]: Without dead ends: 650 [2022-11-16 11:54:39,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:54:39,734 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:39,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:54:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-11-16 11:54:39,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-11-16 11:54:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 648 states have (on average 3.1296296296296298) internal successors, (2028), 649 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2022-11-16 11:54:39,786 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 5 [2022-11-16 11:54:39,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:39,789 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2022-11-16 11:54:39,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2022-11-16 11:54:39,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 11:54:39,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:39,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:39,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:40,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:40,009 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:40,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:40,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1092815848, now seen corresponding path program 1 times [2022-11-16 11:54:40,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:54:40,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067093914] [2022-11-16 11:54:40,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:40,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:40,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:54:40,013 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:54:40,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 11:54:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:40,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:54:40,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:40,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:54:40,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:54:40,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067093914] [2022-11-16 11:54:40,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067093914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:40,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:40,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:54:40,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959410319] [2022-11-16 11:54:40,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:40,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:54:40,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:54:40,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:54:40,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:54:40,241 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:40,420 INFO L93 Difference]: Finished difference Result 510 states and 1351 transitions. [2022-11-16 11:54:40,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:54:40,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 11:54:40,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:40,424 INFO L225 Difference]: With dead ends: 510 [2022-11-16 11:54:40,424 INFO L226 Difference]: Without dead ends: 410 [2022-11-16 11:54:40,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:54:40,425 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 31 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 10 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:40,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 10 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:54:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-11-16 11:54:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2022-11-16 11:54:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 408 states have (on average 2.6176470588235294) internal successors, (1068), 409 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1068 transitions. [2022-11-16 11:54:40,445 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1068 transitions. Word has length 9 [2022-11-16 11:54:40,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:40,446 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 1068 transitions. [2022-11-16 11:54:40,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1068 transitions. [2022-11-16 11:54:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:54:40,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:40,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:40,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:40,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:40,663 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:40,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash 133963557, now seen corresponding path program 1 times [2022-11-16 11:54:40,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:54:40,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067474729] [2022-11-16 11:54:40,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:40,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:40,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:54:40,669 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:54:40,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 11:54:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:40,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:54:40,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:40,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:54:40,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:54:40,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067474729] [2022-11-16 11:54:40,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067474729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:40,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:40,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:54:40,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827192089] [2022-11-16 11:54:40,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:40,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:54:40,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:54:40,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:54:40,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:54:40,844 INFO L87 Difference]: Start difference. First operand 410 states and 1068 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:41,055 INFO L93 Difference]: Finished difference Result 262 states and 599 transitions. [2022-11-16 11:54:41,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:54:41,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 11:54:41,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:41,057 INFO L225 Difference]: With dead ends: 262 [2022-11-16 11:54:41,057 INFO L226 Difference]: Without dead ends: 210 [2022-11-16 11:54:41,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:54:41,058 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:41,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 18 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:54:41,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-16 11:54:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-11-16 11:54:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 208 states have (on average 2.25) internal successors, (468), 209 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 468 transitions. [2022-11-16 11:54:41,065 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 468 transitions. Word has length 12 [2022-11-16 11:54:41,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:41,065 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 468 transitions. [2022-11-16 11:54:41,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 468 transitions. [2022-11-16 11:54:41,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:54:41,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:41,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:41,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:41,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:41,279 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:41,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:41,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1506683376, now seen corresponding path program 1 times [2022-11-16 11:54:41,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:54:41,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642229289] [2022-11-16 11:54:41,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:41,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:41,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:54:41,281 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:54:41,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 11:54:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:41,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:54:41,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:41,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:54:41,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:54:41,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642229289] [2022-11-16 11:54:41,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642229289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:41,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:41,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:54:41,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753457292] [2022-11-16 11:54:41,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:41,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:54:41,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:54:41,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:54:41,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:54:41,545 INFO L87 Difference]: Start difference. First operand 210 states and 468 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:41,898 INFO L93 Difference]: Finished difference Result 167 states and 380 transitions. [2022-11-16 11:54:41,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:54:41,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 11:54:41,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:41,900 INFO L225 Difference]: With dead ends: 167 [2022-11-16 11:54:41,900 INFO L226 Difference]: Without dead ends: 155 [2022-11-16 11:54:41,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:54:41,901 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:41,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 30 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:54:41,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-16 11:54:41,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-11-16 11:54:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 153 states have (on average 2.3398692810457518) internal successors, (358), 154 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 358 transitions. [2022-11-16 11:54:41,907 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 358 transitions. Word has length 16 [2022-11-16 11:54:41,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:41,907 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 358 transitions. [2022-11-16 11:54:41,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:41,908 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 358 transitions. [2022-11-16 11:54:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:54:41,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:41,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:41,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:42,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:42,128 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:42,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:42,129 INFO L85 PathProgramCache]: Analyzing trace with hash 22385998, now seen corresponding path program 1 times [2022-11-16 11:54:42,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:54:42,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861080627] [2022-11-16 11:54:42,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:42,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:42,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:54:42,130 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:54:42,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 11:54:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:42,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:54:42,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:42,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:54:42,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:54:42,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861080627] [2022-11-16 11:54:42,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861080627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:42,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:42,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:54:42,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85943151] [2022-11-16 11:54:42,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:42,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:54:42,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:54:42,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:54:42,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:54:42,359 INFO L87 Difference]: Start difference. First operand 155 states and 358 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:42,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:42,476 INFO L93 Difference]: Finished difference Result 240 states and 542 transitions. [2022-11-16 11:54:42,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:54:42,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 11:54:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:42,478 INFO L225 Difference]: With dead ends: 240 [2022-11-16 11:54:42,478 INFO L226 Difference]: Without dead ends: 240 [2022-11-16 11:54:42,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:54:42,479 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:42,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:54:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-11-16 11:54:42,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2022-11-16 11:54:42,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 236 states have (on average 2.292372881355932) internal successors, (541), 237 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:42,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 541 transitions. [2022-11-16 11:54:42,489 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 541 transitions. Word has length 20 [2022-11-16 11:54:42,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:42,490 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 541 transitions. [2022-11-16 11:54:42,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 541 transitions. [2022-11-16 11:54:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:54:42,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:42,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:42,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:42,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:42,703 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:42,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:42,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1208094590, now seen corresponding path program 2 times [2022-11-16 11:54:42,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:54:42,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960440616] [2022-11-16 11:54:42,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:54:42,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:42,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:54:42,705 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:54:42,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 11:54:42,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 11:54:42,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:54:42,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:54:42,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:42,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:54:42,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:54:42,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960440616] [2022-11-16 11:54:42,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960440616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:42,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:42,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:54:42,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857258708] [2022-11-16 11:54:42,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:42,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:54:42,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:54:42,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:54:42,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:54:42,919 INFO L87 Difference]: Start difference. First operand 238 states and 541 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:43,106 INFO L93 Difference]: Finished difference Result 369 states and 793 transitions. [2022-11-16 11:54:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:54:43,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 11:54:43,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:43,109 INFO L225 Difference]: With dead ends: 369 [2022-11-16 11:54:43,109 INFO L226 Difference]: Without dead ends: 369 [2022-11-16 11:54:43,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:54:43,110 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:43,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:54:43,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-11-16 11:54:43,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 193. [2022-11-16 11:54:43,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 191 states have (on average 2.282722513089005) internal successors, (436), 192 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:43,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 436 transitions. [2022-11-16 11:54:43,118 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 436 transitions. Word has length 20 [2022-11-16 11:54:43,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:43,119 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 436 transitions. [2022-11-16 11:54:43,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:43,119 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 436 transitions. [2022-11-16 11:54:43,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:54:43,120 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:43,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:43,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:43,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:43,332 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:43,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:43,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1280766, now seen corresponding path program 3 times [2022-11-16 11:54:43,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:54:43,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712120667] [2022-11-16 11:54:43,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:54:43,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:43,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:54:43,334 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:54:43,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-16 11:54:43,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 11:54:43,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:54:43,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 11:54:43,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:54:43,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:54:43,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:54:43,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712120667] [2022-11-16 11:54:43,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712120667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:54:43,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:54:43,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:54:43,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164623622] [2022-11-16 11:54:43,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:54:43,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:54:43,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:54:43,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:54:43,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:54:43,789 INFO L87 Difference]: Start difference. First operand 193 states and 436 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:44,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:44,086 INFO L93 Difference]: Finished difference Result 239 states and 515 transitions. [2022-11-16 11:54:44,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:54:44,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 11:54:44,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:44,088 INFO L225 Difference]: With dead ends: 239 [2022-11-16 11:54:44,088 INFO L226 Difference]: Without dead ends: 239 [2022-11-16 11:54:44,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:54:44,089 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 41 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 18 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-16 11:54:44,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 18 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:54:44,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-11-16 11:54:44,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 181. [2022-11-16 11:54:44,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 2.2905027932960893) internal successors, (410), 180 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 410 transitions. [2022-11-16 11:54:44,098 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 410 transitions. Word has length 20 [2022-11-16 11:54:44,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:44,098 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 410 transitions. [2022-11-16 11:54:44,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:44,099 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 410 transitions. [2022-11-16 11:54:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:54:44,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:44,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:44,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:44,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:44,301 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:54:44,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:44,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2090066238, now seen corresponding path program 4 times [2022-11-16 11:54:44,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:54:44,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346078066] [2022-11-16 11:54:44,302 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:54:44,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:44,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:54:44,304 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:54:44,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-16 11:54:44,490 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:54:44,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 11:54:44,491 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:54:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:54:44,649 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-16 11:54:44,663 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:54:44,664 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-16 11:54:44,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-16 11:54:44,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-16 11:54:44,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-16 11:54:44,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-16 11:54:44,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-16 11:54:44,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-16 11:54:44,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-16 11:54:44,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-16 11:54:44,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-16 11:54:44,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-16 11:54:44,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-16 11:54:44,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-16 11:54:44,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:44,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:54:44,871 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-11-16 11:54:44,875 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:54:44,876 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:54:44,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:54:44 BasicIcfg [2022-11-16 11:54:44,946 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:54:44,947 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:54:44,947 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:54:44,947 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:54:44,948 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:54:28" (3/4) ... [2022-11-16 11:54:44,953 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:54:44,953 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:54:44,954 INFO L158 Benchmark]: Toolchain (without parser) took 17922.22ms. Allocated memory was 54.5MB in the beginning and 104.9MB in the end (delta: 50.3MB). Free memory was 30.3MB in the beginning and 38.6MB in the end (delta: -8.3MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2022-11-16 11:54:44,954 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 36.3MB in the end (delta: 37.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:54:44,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 676.87ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 30.0MB in the beginning and 42.1MB in the end (delta: -12.1MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2022-11-16 11:54:44,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.92ms. Allocated memory is still 71.3MB. Free memory was 41.9MB in the beginning and 39.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:54:44,965 INFO L158 Benchmark]: Boogie Preprocessor took 73.02ms. Allocated memory is still 71.3MB. Free memory was 39.6MB in the beginning and 37.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:54:44,965 INFO L158 Benchmark]: RCFGBuilder took 896.37ms. Allocated memory is still 71.3MB. Free memory was 37.5MB in the beginning and 40.1MB in the end (delta: -2.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2022-11-16 11:54:44,965 INFO L158 Benchmark]: TraceAbstraction took 16170.85ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 39.5MB in the beginning and 39.7MB in the end (delta: -132.8kB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2022-11-16 11:54:44,965 INFO L158 Benchmark]: Witness Printer took 6.27ms. Allocated memory is still 104.9MB. Free memory was 39.7MB in the beginning and 38.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:54:44,967 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 36.3MB in the end (delta: 37.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 676.87ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 30.0MB in the beginning and 42.1MB in the end (delta: -12.1MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.92ms. Allocated memory is still 71.3MB. Free memory was 41.9MB in the beginning and 39.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.02ms. Allocated memory is still 71.3MB. Free memory was 39.6MB in the beginning and 37.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 896.37ms. Allocated memory is still 71.3MB. Free memory was 37.5MB in the beginning and 40.1MB in the end (delta: -2.6MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16170.85ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 39.5MB in the beginning and 39.7MB in the end (delta: -132.8kB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * Witness Printer took 6.27ms. Allocated memory is still 104.9MB. Free memory was 39.7MB in the beginning and 38.6MB in the end (delta: 1.0MB). 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: 9.5s, 133 PlacesBefore, 43 PlacesAfterwards, 125 TransitionsBefore, 34 TransitionsAfterwards, 2164 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 126 TotalNumberOfCompositions, 5431 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2985, independent: 2826, independent conditional: 0, independent unconditional: 2826, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1622, independent: 1574, independent conditional: 0, independent unconditional: 1574, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1622, independent: 1551, independent conditional: 0, independent unconditional: 1551, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 392, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 341, dependent conditional: 0, dependent unconditional: 341, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2985, independent: 1252, independent conditional: 0, independent unconditional: 1252, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 1622, unknown conditional: 0, unknown unconditional: 1622] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L721] 0 _Bool x$flush_delayed; [L732] 0 int *x$read_delayed_var; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L722] 0 int x$mem_tmp; [L712] 0 int __unbuffered_p0_EAX = 0; [L726] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd0; [L716] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool x$read_delayed; [L710] 0 int __unbuffered_cnt = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L718] 0 _Bool main$tmp_guard1; [L736] 0 _Bool x$w_buff1_used; [L717] 0 _Bool main$tmp_guard0; [L734] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff0; [L735] 0 int x$w_buff1; [L720] 0 int x = 0; [L728] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd0; [L738] 0 int y = 0; [L730] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$r_buff1_thd2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1828, ((void *)0), P0, ((void *)0))=0, t1828={3:0}, weak$$choice0=0, weak$$choice2=0, x=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] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1829, ((void *)0), P1, ((void *)0))=1, t1828={3:0}, t1829={7:0}, weak$$choice0=0, weak$$choice2=0, x=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] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1830, ((void *)0), P2, ((void *)0))=2, t1828={3:0}, t1829={7:0}, t1830={15:0}, weak$$choice0=0, weak$$choice2=0, x=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] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L807] 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) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 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 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L744] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 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) [L752] 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)) [L753] 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)) [L754] 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)) [L755] 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)) [L756] 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)) [L757] 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)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=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] [L787] 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) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 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 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 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}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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$$choice2=0, x=1, 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] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 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 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={3:0}, t1829={7:0}, t1830={15:0}, weak$$choice0=2, weak$$choice2=0, x=1, 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] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L849] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=2, weak$$choice2=0, x=1, 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: 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: 827]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 830]: 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: 834]: 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, 151 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 16.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 828 IncrementalHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 33 mSDtfsCounter, 828 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=876occurred in iteration=0, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 236 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 449 SizeOfPredicates, 14 NumberOfNonLiveVariables, 954 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-16 11:54:44,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5dd66f1-bc21-4b15-9585-9161f78d86af/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample