./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- 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 12:38:08,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:38:08,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:38:08,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:38:08,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:38:08,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:38:08,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:38:08,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:38:08,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:38:08,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:38:08,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:38:08,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:38:08,473 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:38:08,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:38:08,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:38:08,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:38:08,485 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:38:08,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:38:08,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:38:08,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:38:08,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:38:08,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:38:08,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:38:08,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:38:08,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:38:08,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:38:08,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:38:08,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:38:08,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:38:08,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:38:08,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:38:08,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:38:08,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:38:08,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:38:08,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:38:08,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:38:08,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:38:08,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:38:08,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:38:08,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:38:08,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:38:08,543 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 12:38:08,596 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:38:08,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:38:08,597 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:38:08,598 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:38:08,599 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:38:08,599 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:38:08,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:38:08,600 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:38:08,601 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:38:08,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:38:08,603 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:38:08,603 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:38:08,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:38:08,604 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:38:08,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:38:08,604 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:38:08,605 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:38:08,605 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:38:08,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:38:08,606 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:38:08,606 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:38:08,606 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:38:08,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:38:08,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:38:08,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:38:08,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:38:08,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:38:08,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:38:08,609 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:38:08,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:38:08,610 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_2bff00e8-482a-45d2-a461-0f009e99e3e4/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_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2022-11-16 12:38:08,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:38:09,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:38:09,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:38:09,025 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:38:09,026 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:38:09,028 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:38:09,113 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/data/21a3dab65/2584dee2099e4634818d8347d7c271fd/FLAG40a7df6c4 [2022-11-16 12:38:09,907 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:38:09,908 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:38:09,939 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/data/21a3dab65/2584dee2099e4634818d8347d7c271fd/FLAG40a7df6c4 [2022-11-16 12:38:10,077 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/data/21a3dab65/2584dee2099e4634818d8347d7c271fd [2022-11-16 12:38:10,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:38:10,085 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:38:10,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:38:10,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:38:10,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:38:10,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:38:10" (1/1) ... [2022-11-16 12:38:10,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2290dbd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10, skipping insertion in model container [2022-11-16 12:38:10,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:38:10" (1/1) ... [2022-11-16 12:38:10,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:38:10,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:38:10,505 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_2bff00e8-482a-45d2-a461-0f009e99e3e4/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-16 12:38:10,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:38:10,762 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:38:10,781 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_2bff00e8-482a-45d2-a461-0f009e99e3e4/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-16 12:38:10,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:38:10,951 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:38:10,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10 WrapperNode [2022-11-16 12:38:10,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:38:10,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:38:10,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:38:10,954 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:38:10,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2022-11-16 12:38:10,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2022-11-16 12:38:11,038 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-16 12:38:11,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:38:11,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:38:11,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:38:11,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:38:11,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2022-11-16 12:38:11,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2022-11-16 12:38:11,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2022-11-16 12:38:11,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2022-11-16 12:38:11,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2022-11-16 12:38:11,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2022-11-16 12:38:11,115 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2022-11-16 12:38:11,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2022-11-16 12:38:11,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:38:11,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:38:11,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:38:11,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:38:11,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2022-11-16 12:38:11,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:38:11,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:38:11,196 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:38:11,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:38:11,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:38:11,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:38:11,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:38:11,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:38:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:38:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 12:38:11,259 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 12:38:11,259 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 12:38:11,259 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 12:38:11,260 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 12:38:11,260 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 12:38:11,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:38:11,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:38:11,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:38:11,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:38:11,264 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 12:38:11,475 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:38:11,478 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:38:12,078 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:38:12,363 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:38:12,363 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:38:12,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:38:12 BoogieIcfgContainer [2022-11-16 12:38:12,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:38:12,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:38:12,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:38:12,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:38:12,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:38:10" (1/3) ... [2022-11-16 12:38:12,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647ea09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:38:12, skipping insertion in model container [2022-11-16 12:38:12,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (2/3) ... [2022-11-16 12:38:12,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647ea09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:38:12, skipping insertion in model container [2022-11-16 12:38:12,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:38:12" (3/3) ... [2022-11-16 12:38:12,378 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:38:12,402 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:38:12,402 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-16 12:38:12,403 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:38:12,515 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:38:12,564 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 12:38:12,582 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 263 flow [2022-11-16 12:38:12,586 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 263 flow [2022-11-16 12:38:12,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-11-16 12:38:12,661 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-11-16 12:38:12,661 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:38:12,667 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 81 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-16 12:38:12,670 INFO L119 LiptonReduction]: Number of co-enabled transitions 2264 [2022-11-16 12:38:20,179 INFO L134 LiptonReduction]: Checked pairs total: 5902 [2022-11-16 12:38:20,179 INFO L136 LiptonReduction]: Total number of compositions: 119 [2022-11-16 12:38:20,194 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-16 12:38:20,300 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states 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 12:38:20,328 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:38:20,336 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;@1ea7fdeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:38:20,336 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-16 12:38:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states 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 12:38:20,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 12:38:20,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:20,347 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 12:38:20,347 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:20,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:20,353 INFO L85 PathProgramCache]: Analyzing trace with hash 593, now seen corresponding path program 1 times [2022-11-16 12:38:20,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:20,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822663540] [2022-11-16 12:38:20,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:20,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:20,493 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 12:38:20,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:20,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822663540] [2022-11-16 12:38:20,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822663540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:20,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:20,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 12:38:20,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916257812] [2022-11-16 12:38:20,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:20,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:38:20,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:20,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:38:20,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:38:20,537 INFO L87 Difference]: Start difference. First operand has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 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 12:38:20,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:20,665 INFO L93 Difference]: Finished difference Result 970 states and 3096 transitions. [2022-11-16 12:38:20,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:38:20,668 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 12:38:20,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:20,701 INFO L225 Difference]: With dead ends: 970 [2022-11-16 12:38:20,702 INFO L226 Difference]: Without dead ends: 970 [2022-11-16 12:38:20,703 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 12:38:20,707 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:20,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:38:20,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-11-16 12:38:20,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2022-11-16 12:38:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 965 states have (on average 3.2082901554404146) internal successors, (3096), 969 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states 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 12:38:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3096 transitions. [2022-11-16 12:38:20,826 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3096 transitions. Word has length 1 [2022-11-16 12:38:20,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:20,827 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 3096 transitions. [2022-11-16 12:38:20,831 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 12:38:20,833 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3096 transitions. [2022-11-16 12:38:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 12:38:20,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:20,834 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:20,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:38:20,834 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:20,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:20,835 INFO L85 PathProgramCache]: Analyzing trace with hash -854440776, now seen corresponding path program 1 times [2022-11-16 12:38:20,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:20,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847634516] [2022-11-16 12:38:20,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:20,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:21,268 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 12:38:21,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:21,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847634516] [2022-11-16 12:38:21,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847634516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:21,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:21,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:38:21,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384517770] [2022-11-16 12:38:21,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:21,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:38:21,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:21,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:38:21,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:38:21,277 INFO L87 Difference]: Start difference. First operand 970 states and 3096 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:38:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:21,387 INFO L93 Difference]: Finished difference Result 802 states and 2518 transitions. [2022-11-16 12:38:21,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:38:21,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-16 12:38:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:21,392 INFO L225 Difference]: With dead ends: 802 [2022-11-16 12:38:21,393 INFO L226 Difference]: Without dead ends: 778 [2022-11-16 12:38:21,393 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 12:38:21,394 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:21,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:38:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-11-16 12:38:21,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2022-11-16 12:38:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 776 states have (on average 3.1649484536082473) internal successors, (2456), 777 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states 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 12:38:21,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 2456 transitions. [2022-11-16 12:38:21,423 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 2456 transitions. Word has length 7 [2022-11-16 12:38:21,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:21,424 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 2456 transitions. [2022-11-16 12:38:21,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:38:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 2456 transitions. [2022-11-16 12:38:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 12:38:21,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:21,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:21,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:38:21,427 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1628444087, now seen corresponding path program 1 times [2022-11-16 12:38:21,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:21,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711978979] [2022-11-16 12:38:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:21,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:22,050 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 12:38:22,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:22,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711978979] [2022-11-16 12:38:22,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711978979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:22,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:22,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:38:22,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929206228] [2022-11-16 12:38:22,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:22,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:38:22,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:22,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:38:22,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:38:22,053 INFO L87 Difference]: Start difference. First operand 778 states and 2456 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:38:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:22,463 INFO L93 Difference]: Finished difference Result 934 states and 2873 transitions. [2022-11-16 12:38:22,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:38:22,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 12:38:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:22,469 INFO L225 Difference]: With dead ends: 934 [2022-11-16 12:38:22,470 INFO L226 Difference]: Without dead ends: 934 [2022-11-16 12:38:22,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:38:22,471 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 45 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:22,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:38:22,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2022-11-16 12:38:22,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 790. [2022-11-16 12:38:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 788 states have (on average 3.1434010152284264) internal successors, (2477), 789 states have internal predecessors, (2477), 0 states have call successors, (0), 0 states 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 12:38:22,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 2477 transitions. [2022-11-16 12:38:22,502 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 2477 transitions. Word has length 10 [2022-11-16 12:38:22,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:22,503 INFO L495 AbstractCegarLoop]: Abstraction has 790 states and 2477 transitions. [2022-11-16 12:38:22,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:38:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 2477 transitions. [2022-11-16 12:38:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 12:38:22,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:22,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:22,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:38:22,505 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:22,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:22,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1628444099, now seen corresponding path program 1 times [2022-11-16 12:38:22,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:22,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851744299] [2022-11-16 12:38:22,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:22,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:22,975 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 12:38:22,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:22,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851744299] [2022-11-16 12:38:22,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851744299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:22,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:22,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:38:22,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260518757] [2022-11-16 12:38:22,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:22,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:38:22,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:22,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:38:22,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:38:22,979 INFO L87 Difference]: Start difference. First operand 790 states and 2477 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 12:38:23,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:23,300 INFO L93 Difference]: Finished difference Result 1090 states and 3290 transitions. [2022-11-16 12:38:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:38:23,301 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 12:38:23,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:23,308 INFO L225 Difference]: With dead ends: 1090 [2022-11-16 12:38:23,308 INFO L226 Difference]: Without dead ends: 970 [2022-11-16 12:38:23,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:38:23,310 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 36 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:23,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 5 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:38:23,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-11-16 12:38:23,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 910. [2022-11-16 12:38:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 3.0825991189427313) internal successors, (2799), 909 states have internal predecessors, (2799), 0 states have call successors, (0), 0 states 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 12:38:23,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 2799 transitions. [2022-11-16 12:38:23,351 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 2799 transitions. Word has length 10 [2022-11-16 12:38:23,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:23,351 INFO L495 AbstractCegarLoop]: Abstraction has 910 states and 2799 transitions. [2022-11-16 12:38:23,352 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 12:38:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 2799 transitions. [2022-11-16 12:38:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:38:23,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:23,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:23,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:38:23,356 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:23,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1304232627, now seen corresponding path program 1 times [2022-11-16 12:38:23,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:23,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020834761] [2022-11-16 12:38:23,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:23,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:23,670 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 12:38:23,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:23,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020834761] [2022-11-16 12:38:23,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020834761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:23,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:23,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:38:23,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253544890] [2022-11-16 12:38:23,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:23,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:38:23,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:23,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:38:23,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:38:23,673 INFO L87 Difference]: Start difference. First operand 910 states and 2799 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:38:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:23,828 INFO L93 Difference]: Finished difference Result 1066 states and 3176 transitions. [2022-11-16 12:38:23,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:38:23,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 12:38:23,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:23,835 INFO L225 Difference]: With dead ends: 1066 [2022-11-16 12:38:23,836 INFO L226 Difference]: Without dead ends: 1006 [2022-11-16 12:38:23,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:38:23,837 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:23,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:38:23,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2022-11-16 12:38:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 916. [2022-11-16 12:38:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 914 states have (on average 3.073304157549234) internal successors, (2809), 915 states have internal predecessors, (2809), 0 states have call successors, (0), 0 states 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 12:38:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 2809 transitions. [2022-11-16 12:38:23,874 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 2809 transitions. Word has length 13 [2022-11-16 12:38:23,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:23,875 INFO L495 AbstractCegarLoop]: Abstraction has 916 states and 2809 transitions. [2022-11-16 12:38:23,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:38:23,875 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 2809 transitions. [2022-11-16 12:38:23,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:38:23,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:23,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:23,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:38:23,878 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:23,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:23,879 INFO L85 PathProgramCache]: Analyzing trace with hash 484484233, now seen corresponding path program 1 times [2022-11-16 12:38:23,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:23,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588397158] [2022-11-16 12:38:23,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:23,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:25,471 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 12:38:25,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:25,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588397158] [2022-11-16 12:38:25,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588397158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:25,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:25,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:38:25,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705413802] [2022-11-16 12:38:25,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:25,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:38:25,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:25,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:38:25,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:38:25,476 INFO L87 Difference]: Start difference. First operand 916 states and 2809 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 12:38:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:25,783 INFO L93 Difference]: Finished difference Result 866 states and 2585 transitions. [2022-11-16 12:38:25,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:38:25,784 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 12:38:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:25,790 INFO L225 Difference]: With dead ends: 866 [2022-11-16 12:38:25,790 INFO L226 Difference]: Without dead ends: 806 [2022-11-16 12:38:25,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:38:25,796 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:25,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 5 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:38:25,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-11-16 12:38:25,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 538. [2022-11-16 12:38:25,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 2.996275605214153) internal successors, (1609), 537 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states 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 12:38:25,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1609 transitions. [2022-11-16 12:38:25,825 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1609 transitions. Word has length 13 [2022-11-16 12:38:25,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:25,825 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 1609 transitions. [2022-11-16 12:38:25,825 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 12:38:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1609 transitions. [2022-11-16 12:38:25,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 12:38:25,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:25,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:25,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:38:25,828 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:25,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:25,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1776505607, now seen corresponding path program 1 times [2022-11-16 12:38:25,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:25,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873618348] [2022-11-16 12:38:25,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:25,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:27,051 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 12:38:27,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:27,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873618348] [2022-11-16 12:38:27,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873618348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:27,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:27,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:38:27,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537644092] [2022-11-16 12:38:27,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:27,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:38:27,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:27,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:38:27,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:38:27,056 INFO L87 Difference]: Start difference. First operand 538 states and 1609 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 12:38:27,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:27,397 INFO L93 Difference]: Finished difference Result 603 states and 1765 transitions. [2022-11-16 12:38:27,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:38:27,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 12:38:27,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:27,402 INFO L225 Difference]: With dead ends: 603 [2022-11-16 12:38:27,402 INFO L226 Difference]: Without dead ends: 558 [2022-11-16 12:38:27,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:38:27,403 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:27,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 7 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:38:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-11-16 12:38:27,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2022-11-16 12:38:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 2.9802513464991023) internal successors, (1660), 557 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states 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 12:38:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1660 transitions. [2022-11-16 12:38:27,426 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1660 transitions. Word has length 14 [2022-11-16 12:38:27,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:27,426 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 1660 transitions. [2022-11-16 12:38:27,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 12:38:27,427 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1660 transitions. [2022-11-16 12:38:27,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 12:38:27,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:27,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:27,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:38:27,429 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:27,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:27,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1783641359, now seen corresponding path program 2 times [2022-11-16 12:38:27,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:27,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012566251] [2022-11-16 12:38:27,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:27,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:28,847 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 12:38:28,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:28,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012566251] [2022-11-16 12:38:28,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012566251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:28,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:28,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:38:28,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037626920] [2022-11-16 12:38:28,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:28,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:38:28,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:28,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:38:28,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:38:28,851 INFO L87 Difference]: Start difference. First operand 558 states and 1660 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 12:38:29,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:29,263 INFO L93 Difference]: Finished difference Result 816 states and 2397 transitions. [2022-11-16 12:38:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:38:29,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 12:38:29,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:29,269 INFO L225 Difference]: With dead ends: 816 [2022-11-16 12:38:29,269 INFO L226 Difference]: Without dead ends: 744 [2022-11-16 12:38:29,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:38:29,273 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 54 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:29,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 10 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:38:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-11-16 12:38:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 716. [2022-11-16 12:38:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 3.0013986013986016) internal successors, (2146), 715 states have internal predecessors, (2146), 0 states have call successors, (0), 0 states 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 12:38:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 2146 transitions. [2022-11-16 12:38:29,302 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 2146 transitions. Word has length 14 [2022-11-16 12:38:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:29,302 INFO L495 AbstractCegarLoop]: Abstraction has 716 states and 2146 transitions. [2022-11-16 12:38:29,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 12:38:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 2146 transitions. [2022-11-16 12:38:29,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:38:29,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:29,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:29,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:38:29,306 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:29,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:29,306 INFO L85 PathProgramCache]: Analyzing trace with hash -823575871, now seen corresponding path program 1 times [2022-11-16 12:38:29,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:29,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608968158] [2022-11-16 12:38:29,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:29,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:30,137 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 12:38:30,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:30,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608968158] [2022-11-16 12:38:30,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608968158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:30,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:30,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:38:30,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358465224] [2022-11-16 12:38:30,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:30,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:38:30,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:30,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:38:30,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:38:30,139 INFO L87 Difference]: Start difference. First operand 716 states and 2146 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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 12:38:30,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:30,753 INFO L93 Difference]: Finished difference Result 1172 states and 3452 transitions. [2022-11-16 12:38:30,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:38:30,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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 12:38:30,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:30,759 INFO L225 Difference]: With dead ends: 1172 [2022-11-16 12:38:30,759 INFO L226 Difference]: Without dead ends: 684 [2022-11-16 12:38:30,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:38:30,761 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 74 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:30,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 2 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:38:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-11-16 12:38:30,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 582. [2022-11-16 12:38:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 2.8881239242685024) internal successors, (1678), 581 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states 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 12:38:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1678 transitions. [2022-11-16 12:38:30,788 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1678 transitions. Word has length 15 [2022-11-16 12:38:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:30,788 INFO L495 AbstractCegarLoop]: Abstraction has 582 states and 1678 transitions. [2022-11-16 12:38:30,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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 12:38:30,789 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1678 transitions. [2022-11-16 12:38:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:38:30,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:30,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:30,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:38:30,791 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:30,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:30,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2037699218, now seen corresponding path program 1 times [2022-11-16 12:38:30,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:30,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902036026] [2022-11-16 12:38:30,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:30,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:38:32,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:32,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902036026] [2022-11-16 12:38:32,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902036026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:32,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:32,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:38:32,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066370736] [2022-11-16 12:38:32,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:32,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:38:32,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:32,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:38:32,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:38:32,048 INFO L87 Difference]: Start difference. First operand 582 states and 1678 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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 12:38:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:32,621 INFO L93 Difference]: Finished difference Result 1004 states and 2798 transitions. [2022-11-16 12:38:32,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:38:32,621 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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 12:38:32,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:32,625 INFO L225 Difference]: With dead ends: 1004 [2022-11-16 12:38:32,625 INFO L226 Difference]: Without dead ends: 714 [2022-11-16 12:38:32,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:38:32,626 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 51 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:32,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 13 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:38:32,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-11-16 12:38:32,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 496. [2022-11-16 12:38:32,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 2.7595959595959596) internal successors, (1366), 495 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states 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 12:38:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 1366 transitions. [2022-11-16 12:38:32,661 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 1366 transitions. Word has length 15 [2022-11-16 12:38:32,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:32,662 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 1366 transitions. [2022-11-16 12:38:32,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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 12:38:32,663 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 1366 transitions. [2022-11-16 12:38:32,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:38:32,664 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:32,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:32,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:38:32,665 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:32,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:32,666 INFO L85 PathProgramCache]: Analyzing trace with hash -541763999, now seen corresponding path program 1 times [2022-11-16 12:38:32,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:32,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537465739] [2022-11-16 12:38:32,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:32,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:34,659 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 12:38:34,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:34,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537465739] [2022-11-16 12:38:34,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537465739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:34,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:34,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:38:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229926187] [2022-11-16 12:38:34,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:34,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:38:34,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:34,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:38:34,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:38:34,664 INFO L87 Difference]: Start difference. First operand 496 states and 1366 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 12:38:35,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:35,081 INFO L93 Difference]: Finished difference Result 514 states and 1393 transitions. [2022-11-16 12:38:35,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:38:35,082 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 12:38:35,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:35,085 INFO L225 Difference]: With dead ends: 514 [2022-11-16 12:38:35,085 INFO L226 Difference]: Without dead ends: 484 [2022-11-16 12:38:35,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:38:35,086 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:35,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:38:35,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-11-16 12:38:35,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 464. [2022-11-16 12:38:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 2.7667386609071274) internal successors, (1281), 463 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states 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 12:38:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1281 transitions. [2022-11-16 12:38:35,102 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1281 transitions. Word has length 15 [2022-11-16 12:38:35,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:35,103 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 1281 transitions. [2022-11-16 12:38:35,103 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 12:38:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1281 transitions. [2022-11-16 12:38:35,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:38:35,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:35,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:35,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:38:35,106 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:35,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:35,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1255904962, now seen corresponding path program 1 times [2022-11-16 12:38:35,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:35,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539333187] [2022-11-16 12:38:35,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:35,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:37,330 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 12:38:37,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:37,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539333187] [2022-11-16 12:38:37,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539333187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:37,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:37,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:38:37,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680817450] [2022-11-16 12:38:37,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:37,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:38:37,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:37,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:38:37,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:38:37,332 INFO L87 Difference]: Start difference. First operand 464 states and 1281 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 12:38:38,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:38,328 INFO L93 Difference]: Finished difference Result 838 states and 2249 transitions. [2022-11-16 12:38:38,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:38:38,329 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 12:38:38,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:38,331 INFO L225 Difference]: With dead ends: 838 [2022-11-16 12:38:38,332 INFO L226 Difference]: Without dead ends: 505 [2022-11-16 12:38:38,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:38:38,335 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 52 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:38,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 14 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:38:38,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-11-16 12:38:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 356. [2022-11-16 12:38:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 2.5859154929577466) internal successors, (918), 355 states have internal predecessors, (918), 0 states have call successors, (0), 0 states 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 12:38:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 918 transitions. [2022-11-16 12:38:38,348 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 918 transitions. Word has length 16 [2022-11-16 12:38:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:38,348 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 918 transitions. [2022-11-16 12:38:38,348 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 12:38:38,349 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 918 transitions. [2022-11-16 12:38:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:38:38,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:38,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:38,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:38:38,350 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:38,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:38,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2117622568, now seen corresponding path program 2 times [2022-11-16 12:38:38,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:38,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413405580] [2022-11-16 12:38:38,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:38,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:39,764 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 12:38:39,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:39,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413405580] [2022-11-16 12:38:39,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413405580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:39,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:39,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:38:39,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554840555] [2022-11-16 12:38:39,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:39,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:38:39,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:39,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:38:39,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:38:39,766 INFO L87 Difference]: Start difference. First operand 356 states and 918 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 12:38:40,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:40,896 INFO L93 Difference]: Finished difference Result 615 states and 1552 transitions. [2022-11-16 12:38:40,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:38:40,897 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 12:38:40,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:40,900 INFO L225 Difference]: With dead ends: 615 [2022-11-16 12:38:40,900 INFO L226 Difference]: Without dead ends: 452 [2022-11-16 12:38:40,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:38:40,901 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 77 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:40,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 18 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:38:40,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-11-16 12:38:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 390. [2022-11-16 12:38:40,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 2.55012853470437) internal successors, (992), 389 states have internal predecessors, (992), 0 states have call successors, (0), 0 states 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 12:38:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 992 transitions. [2022-11-16 12:38:40,914 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 992 transitions. Word has length 16 [2022-11-16 12:38:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:40,915 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 992 transitions. [2022-11-16 12:38:40,915 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 12:38:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 992 transitions. [2022-11-16 12:38:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:38:40,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:40,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:40,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:38:40,917 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:40,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:40,917 INFO L85 PathProgramCache]: Analyzing trace with hash -327323628, now seen corresponding path program 3 times [2022-11-16 12:38:40,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:40,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63261233] [2022-11-16 12:38:40,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:40,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:41,746 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 12:38:41,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:41,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63261233] [2022-11-16 12:38:41,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63261233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:41,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:41,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:38:41,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952280664] [2022-11-16 12:38:41,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:41,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:38:41,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:41,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:38:41,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:38:41,748 INFO L87 Difference]: Start difference. First operand 390 states and 992 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 12:38:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:42,825 INFO L93 Difference]: Finished difference Result 568 states and 1417 transitions. [2022-11-16 12:38:42,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:38:42,826 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 12:38:42,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:42,828 INFO L225 Difference]: With dead ends: 568 [2022-11-16 12:38:42,828 INFO L226 Difference]: Without dead ends: 375 [2022-11-16 12:38:42,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:38:42,829 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 69 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:42,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 12 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:38:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-11-16 12:38:42,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 353. [2022-11-16 12:38:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 2.522727272727273) internal successors, (888), 352 states have internal predecessors, (888), 0 states have call successors, (0), 0 states 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 12:38:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 888 transitions. [2022-11-16 12:38:42,841 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 888 transitions. Word has length 16 [2022-11-16 12:38:42,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:42,841 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 888 transitions. [2022-11-16 12:38:42,842 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 12:38:42,842 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 888 transitions. [2022-11-16 12:38:42,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:38:42,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:42,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:42,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:38:42,844 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:42,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:42,844 INFO L85 PathProgramCache]: Analyzing trace with hash 385145648, now seen corresponding path program 4 times [2022-11-16 12:38:42,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:42,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848430760] [2022-11-16 12:38:42,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:42,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:43,430 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 12:38:43,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:43,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848430760] [2022-11-16 12:38:43,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848430760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:43,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:43,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:38:43,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369944972] [2022-11-16 12:38:43,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:43,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:38:43,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:43,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:38:43,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:38:43,434 INFO L87 Difference]: Start difference. First operand 353 states and 888 transitions. Second operand has 6 states, 5 states have (on average 3.2) 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 12:38:43,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:43,773 INFO L93 Difference]: Finished difference Result 426 states and 1047 transitions. [2022-11-16 12:38:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:38:43,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) 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 12:38:43,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:43,777 INFO L225 Difference]: With dead ends: 426 [2022-11-16 12:38:43,777 INFO L226 Difference]: Without dead ends: 372 [2022-11-16 12:38:43,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:38:43,782 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:43,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 9 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:38:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-11-16 12:38:43,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 355. [2022-11-16 12:38:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 2.519774011299435) internal successors, (892), 354 states have internal predecessors, (892), 0 states have call successors, (0), 0 states 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 12:38:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 892 transitions. [2022-11-16 12:38:43,796 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 892 transitions. Word has length 16 [2022-11-16 12:38:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:43,796 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 892 transitions. [2022-11-16 12:38:43,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) 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 12:38:43,797 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 892 transitions. [2022-11-16 12:38:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:38:43,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:43,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:43,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:38:43,799 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:43,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:43,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2059800548, now seen corresponding path program 5 times [2022-11-16 12:38:43,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:43,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334206945] [2022-11-16 12:38:43,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:43,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:44,941 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 12:38:44,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:44,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334206945] [2022-11-16 12:38:44,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334206945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:44,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:44,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:38:44,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252596098] [2022-11-16 12:38:44,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:44,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:38:44,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:44,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:38:44,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:38:44,943 INFO L87 Difference]: Start difference. First operand 355 states and 892 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 12:38:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:45,834 INFO L93 Difference]: Finished difference Result 522 states and 1301 transitions. [2022-11-16 12:38:45,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:38:45,835 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 12:38:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:45,837 INFO L225 Difference]: With dead ends: 522 [2022-11-16 12:38:45,837 INFO L226 Difference]: Without dead ends: 354 [2022-11-16 12:38:45,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:38:45,838 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 77 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:45,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 15 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:38:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-11-16 12:38:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 277. [2022-11-16 12:38:45,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 2.528985507246377) internal successors, (698), 276 states have internal predecessors, (698), 0 states have call successors, (0), 0 states 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 12:38:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 698 transitions. [2022-11-16 12:38:45,849 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 698 transitions. Word has length 16 [2022-11-16 12:38:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:45,850 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 698 transitions. [2022-11-16 12:38:45,850 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 12:38:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 698 transitions. [2022-11-16 12:38:45,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:38:45,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:45,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:45,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:38:45,852 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:45,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:45,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1184162757, now seen corresponding path program 1 times [2022-11-16 12:38:45,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:45,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187377218] [2022-11-16 12:38:45,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:45,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:46,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 12:38:46,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:46,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187377218] [2022-11-16 12:38:46,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187377218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:46,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:46,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:38:46,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325172668] [2022-11-16 12:38:46,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:46,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:38:46,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:46,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:38:46,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:38:46,078 INFO L87 Difference]: Start difference. First operand 277 states and 698 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:38:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:46,186 INFO L93 Difference]: Finished difference Result 258 states and 571 transitions. [2022-11-16 12:38:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:38:46,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-16 12:38:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:46,188 INFO L225 Difference]: With dead ends: 258 [2022-11-16 12:38:46,188 INFO L226 Difference]: Without dead ends: 183 [2022-11-16 12:38:46,188 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 12:38:46,189 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:46,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:38:46,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-16 12:38:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-16 12:38:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 2.131868131868132) internal successors, (388), 182 states have internal predecessors, (388), 0 states have call successors, (0), 0 states 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 12:38:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 388 transitions. [2022-11-16 12:38:46,194 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 388 transitions. Word has length 17 [2022-11-16 12:38:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:46,194 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 388 transitions. [2022-11-16 12:38:46,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:38:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 388 transitions. [2022-11-16 12:38:46,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:38:46,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:46,195 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 12:38:46,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:38:46,196 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:46,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:46,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1385241011, now seen corresponding path program 1 times [2022-11-16 12:38:46,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:46,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044185985] [2022-11-16 12:38:46,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:46,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:46,419 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 12:38:46,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:46,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044185985] [2022-11-16 12:38:46,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044185985] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:46,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:46,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:38:46,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564780355] [2022-11-16 12:38:46,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:46,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:38:46,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:46,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:38:46,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:38:46,421 INFO L87 Difference]: Start difference. First operand 183 states and 388 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 12:38:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:46,576 INFO L93 Difference]: Finished difference Result 151 states and 284 transitions. [2022-11-16 12:38:46,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:38:46,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 12:38:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:46,578 INFO L225 Difference]: With dead ends: 151 [2022-11-16 12:38:46,578 INFO L226 Difference]: Without dead ends: 119 [2022-11-16 12:38:46,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:38:46,579 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 66 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:46,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 2 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:38:46,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-16 12:38:46,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-11-16 12:38:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.8305084745762712) internal successors, (216), 118 states have internal predecessors, (216), 0 states have call successors, (0), 0 states 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 12:38:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 216 transitions. [2022-11-16 12:38:46,583 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 216 transitions. Word has length 18 [2022-11-16 12:38:46,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:46,583 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 216 transitions. [2022-11-16 12:38:46,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 12:38:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 216 transitions. [2022-11-16 12:38:46,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 12:38:46,584 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:46,584 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 12:38:46,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 12:38:46,585 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:46,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:46,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1679669250, now seen corresponding path program 1 times [2022-11-16 12:38:46,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:46,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911614848] [2022-11-16 12:38:46,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:46,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:46,894 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 12:38:46,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:46,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911614848] [2022-11-16 12:38:46,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911614848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:46,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:46,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:38:46,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134294526] [2022-11-16 12:38:46,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:46,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:38:46,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:46,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:38:46,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:38:46,898 INFO L87 Difference]: Start difference. First operand 119 states and 216 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:38:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:47,032 INFO L93 Difference]: Finished difference Result 103 states and 183 transitions. [2022-11-16 12:38:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:38:47,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 12:38:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:47,033 INFO L225 Difference]: With dead ends: 103 [2022-11-16 12:38:47,033 INFO L226 Difference]: Without dead ends: 53 [2022-11-16 12:38:47,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:38:47,034 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 68 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:47,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 2 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:38:47,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-16 12:38:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-16 12:38:47,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 52 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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 12:38:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 86 transitions. [2022-11-16 12:38:47,037 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 86 transitions. Word has length 20 [2022-11-16 12:38:47,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:47,037 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 86 transitions. [2022-11-16 12:38:47,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:38:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions. [2022-11-16 12:38:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:38:47,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:47,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:47,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 12:38:47,039 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:47,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:47,039 INFO L85 PathProgramCache]: Analyzing trace with hash -426246031, now seen corresponding path program 1 times [2022-11-16 12:38:47,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:47,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751409660] [2022-11-16 12:38:47,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:47,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:48,759 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 12:38:48,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:48,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751409660] [2022-11-16 12:38:48,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751409660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:48,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:48,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:38:48,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623587357] [2022-11-16 12:38:48,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:48,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:38:48,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:48,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:38:48,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:38:48,761 INFO L87 Difference]: Start difference. First operand 53 states and 86 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:38:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:49,167 INFO L93 Difference]: Finished difference Result 74 states and 122 transitions. [2022-11-16 12:38:49,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:38:49,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 12:38:49,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:49,168 INFO L225 Difference]: With dead ends: 74 [2022-11-16 12:38:49,168 INFO L226 Difference]: Without dead ends: 44 [2022-11-16 12:38:49,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:38:49,169 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 60 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:49,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 8 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:38:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-16 12:38:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-16 12:38:49,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 43 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 12:38:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2022-11-16 12:38:49,172 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 22 [2022-11-16 12:38:49,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:49,172 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2022-11-16 12:38:49,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:38:49,173 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2022-11-16 12:38:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:38:49,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:49,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:49,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 12:38:49,176 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:49,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:49,177 INFO L85 PathProgramCache]: Analyzing trace with hash 340172125, now seen corresponding path program 2 times [2022-11-16 12:38:49,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:49,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158674696] [2022-11-16 12:38:49,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:49,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:38:49,954 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 12:38:49,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:38:49,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158674696] [2022-11-16 12:38:49,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158674696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:38:49,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:38:49,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:38:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801773510] [2022-11-16 12:38:49,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:38:49,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:38:49,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:38:49,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:38:49,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:38:49,963 INFO L87 Difference]: Start difference. First operand 44 states and 68 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:38:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:38:50,210 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2022-11-16 12:38:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:38:50,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 12:38:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:38:50,212 INFO L225 Difference]: With dead ends: 69 [2022-11-16 12:38:50,212 INFO L226 Difference]: Without dead ends: 38 [2022-11-16 12:38:50,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:38:50,213 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 49 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:38:50,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 8 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:38:50,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-16 12:38:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-16 12:38:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 12:38:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2022-11-16 12:38:50,216 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 22 [2022-11-16 12:38:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:38:50,216 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2022-11-16 12:38:50,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:38:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2022-11-16 12:38:50,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:38:50,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:38:50,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:50,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 12:38:50,217 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:38:50,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:38:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash -152692199, now seen corresponding path program 3 times [2022-11-16 12:38:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:38:50,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814054871] [2022-11-16 12:38:50,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:38:50,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:38:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:38:50,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:38:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:38:50,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:38:50,445 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:38:50,447 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-16 12:38:50,449 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-16 12:38:50,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-16 12:38:50,450 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-16 12:38:50,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-16 12:38:50,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-16 12:38:50,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-16 12:38:50,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-16 12:38:50,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-16 12:38:50,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-16 12:38:50,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-16 12:38:50,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-16 12:38:50,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-16 12:38:50,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 12:38:50,463 INFO L444 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:38:50,471 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:38:50,472 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:38:50,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:38:50 BasicIcfg [2022-11-16 12:38:50,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:38:50,598 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:38:50,598 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:38:50,598 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:38:50,599 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:38:12" (3/4) ... [2022-11-16 12:38:50,602 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 12:38:50,602 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:38:50,603 INFO L158 Benchmark]: Toolchain (without parser) took 40518.32ms. Allocated memory was 136.3MB in the beginning and 541.1MB in the end (delta: 404.8MB). Free memory was 93.5MB in the beginning and 308.3MB in the end (delta: -214.8MB). Peak memory consumption was 188.3MB. Max. memory is 16.1GB. [2022-11-16 12:38:50,603 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 136.3MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:38:50,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 864.20ms. Allocated memory is still 136.3MB. Free memory was 93.2MB in the beginning and 94.2MB in the end (delta: -994.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 12:38:50,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.29ms. Allocated memory is still 136.3MB. Free memory was 94.2MB in the beginning and 91.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 12:38:50,610 INFO L158 Benchmark]: Boogie Preprocessor took 97.20ms. Allocated memory is still 136.3MB. Free memory was 91.2MB in the beginning and 89.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:38:50,613 INFO L158 Benchmark]: RCFGBuilder took 1229.01ms. Allocated memory is still 136.3MB. Free memory was 89.1MB in the beginning and 101.2MB in the end (delta: -12.0MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2022-11-16 12:38:50,614 INFO L158 Benchmark]: TraceAbstraction took 38227.54ms. Allocated memory was 136.3MB in the beginning and 541.1MB in the end (delta: 404.8MB). Free memory was 100.4MB in the beginning and 309.4MB in the end (delta: -209.0MB). Peak memory consumption was 196.2MB. Max. memory is 16.1GB. [2022-11-16 12:38:50,614 INFO L158 Benchmark]: Witness Printer took 4.80ms. Allocated memory is still 541.1MB. Free memory was 309.4MB in the beginning and 308.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:38:50,619 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.38ms. Allocated memory is still 136.3MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 864.20ms. Allocated memory is still 136.3MB. Free memory was 93.2MB in the beginning and 94.2MB in the end (delta: -994.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.29ms. Allocated memory is still 136.3MB. Free memory was 94.2MB in the beginning and 91.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.20ms. Allocated memory is still 136.3MB. Free memory was 91.2MB in the beginning and 89.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1229.01ms. Allocated memory is still 136.3MB. Free memory was 89.1MB in the beginning and 101.2MB in the end (delta: -12.0MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. * TraceAbstraction took 38227.54ms. Allocated memory was 136.3MB in the beginning and 541.1MB in the end (delta: 404.8MB). Free memory was 100.4MB in the beginning and 309.4MB in the end (delta: -209.0MB). Peak memory consumption was 196.2MB. Max. memory is 16.1GB. * Witness Printer took 4.80ms. Allocated memory is still 541.1MB. Free memory was 309.4MB in the beginning and 308.3MB 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: 7.6s, 132 PlacesBefore, 44 PlacesAfterwards, 124 TransitionsBefore, 35 TransitionsAfterwards, 2264 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 119 TotalNumberOfCompositions, 5902 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2738, independent: 2570, independent conditional: 0, independent unconditional: 2570, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1507, independent: 1441, independent conditional: 0, independent unconditional: 1441, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1507, independent: 1411, independent conditional: 0, independent unconditional: 1411, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 96, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1067, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 998, dependent conditional: 0, dependent unconditional: 998, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2738, independent: 1129, independent conditional: 0, independent unconditional: 1129, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 1507, unknown conditional: 0, unknown unconditional: 1507] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 127, Positive conditional cache size: 0, Positive unconditional cache size: 127, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, 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: [L719] 0 _Bool x$flush_delayed; [L730] 0 int *x$read_delayed_var; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L720] 0 int x$mem_tmp; [L712] 0 int __unbuffered_p0_EAX = 0; [L724] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff0_thd1; [L714] 0 int __unbuffered_p1_EAX = 0; [L723] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$read_delayed; [L710] 0 int __unbuffered_cnt = 0; [L716] 0 _Bool main$tmp_guard1; [L734] 0 _Bool x$w_buff1_used; [L715] 0 _Bool main$tmp_guard0; [L732] 0 _Bool x$w_buff0_used; [L731] 0 int x$w_buff0; [L733] 0 int x$w_buff1; [L718] 0 int x = 0; [L726] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd0; [L736] 0 int y = 0; [L728] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$r_buff1_thd2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-1, t2537={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] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=0, t2537={5:0}, t2538={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] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=1, t2537={5:0}, t2538={6:0}, t2539={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] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, x$r_buff0_thd3=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, x$r_buff0_thd3=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, x$r_buff0_thd3=1, 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=2, 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_EAX = 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=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, 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=1, 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=2, 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; [L772] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, 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=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 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) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 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 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 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=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=1, 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=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L798] 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) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=66, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=68, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2, 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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 852]: 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: 854]: 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: 37.9s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1007 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1007 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 383 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3322 IncrementalHoareTripleChecker+Invalid, 3705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 383 mSolverCounterUnsat, 40 mSDtfsCounter, 3322 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1028occurred in iteration=0, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 1257 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 4681 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 12:38:50,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- 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 12:38:53,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:38:53,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:38:53,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:38:53,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:38:53,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:38:53,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:38:53,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:38:53,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:38:53,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:38:53,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:38:53,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:38:53,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:38:53,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:38:53,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:38:53,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:38:53,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:38:53,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:38:53,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:38:53,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:38:53,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:38:53,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:38:53,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:38:53,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:38:53,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:38:53,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:38:53,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:38:53,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:38:53,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:38:53,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:38:53,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:38:53,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:38:53,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:38:53,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:38:53,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:38:53,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:38:53,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:38:53,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:38:53,323 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:38:53,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:38:53,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:38:53,326 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 12:38:53,359 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:38:53,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:38:53,360 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:38:53,360 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:38:53,361 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:38:53,361 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:38:53,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:38:53,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:38:53,363 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:38:53,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:38:53,364 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:38:53,364 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:38:53,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:38:53,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:38:53,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:38:53,365 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:38:53,365 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:38:53,366 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:38:53,366 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:38:53,366 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:38:53,366 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 12:38:53,367 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 12:38:53,367 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:38:53,367 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:38:53,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:38:53,368 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:38:53,368 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:38:53,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:38:53,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:38:53,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:38:53,370 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 12:38:53,370 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 12:38:53,370 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 12:38:53,370 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_2bff00e8-482a-45d2-a461-0f009e99e3e4/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_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2022-11-16 12:38:53,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:38:53,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:38:53,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:38:53,834 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:38:53,837 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:38:53,839 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:38:53,907 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/data/c2d60c84b/ffab49f3b7df4dd5a6fb36b3a009dce0/FLAG4f7bebdf0 [2022-11-16 12:38:54,485 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:38:54,485 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:38:54,502 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/data/c2d60c84b/ffab49f3b7df4dd5a6fb36b3a009dce0/FLAG4f7bebdf0 [2022-11-16 12:38:54,796 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/data/c2d60c84b/ffab49f3b7df4dd5a6fb36b3a009dce0 [2022-11-16 12:38:54,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:38:54,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:38:54,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:38:54,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:38:54,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:38:54,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:38:54" (1/1) ... [2022-11-16 12:38:54,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74decb64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:54, skipping insertion in model container [2022-11-16 12:38:54,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:38:54" (1/1) ... [2022-11-16 12:38:54,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:38:54,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:38:55,184 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_2bff00e8-482a-45d2-a461-0f009e99e3e4/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-16 12:38:55,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:38:55,483 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:38:55,498 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_2bff00e8-482a-45d2-a461-0f009e99e3e4/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-11-16 12:38:55,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:38:55,600 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:38:55,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:55 WrapperNode [2022-11-16 12:38:55,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:38:55,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:38:55,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:38:55,603 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:38:55,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:55" (1/1) ... [2022-11-16 12:38:55,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:55" (1/1) ... [2022-11-16 12:38:55,685 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-16 12:38:55,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:38:55,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:38:55,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:38:55,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:38:55,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:55" (1/1) ... [2022-11-16 12:38:55,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:55" (1/1) ... [2022-11-16 12:38:55,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:55" (1/1) ... [2022-11-16 12:38:55,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:55" (1/1) ... [2022-11-16 12:38:55,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:55" (1/1) ... [2022-11-16 12:38:55,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:55" (1/1) ... [2022-11-16 12:38:55,767 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:55" (1/1) ... [2022-11-16 12:38:55,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:55" (1/1) ... [2022-11-16 12:38:55,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:38:55,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:38:55,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:38:55,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:38:55,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:55" (1/1) ... [2022-11-16 12:38:55,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:38:55,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:38:55,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:38:55,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:38:55,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:38:55,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:38:55,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:38:55,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:38:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 12:38:55,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 12:38:55,863 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 12:38:55,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 12:38:55,864 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 12:38:55,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 12:38:55,864 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 12:38:55,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 12:38:55,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:38:55,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:38:55,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:38:55,867 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 12:38:56,163 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:38:56,166 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:38:56,911 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:38:57,220 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:38:57,220 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:38:57,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:38:57 BoogieIcfgContainer [2022-11-16 12:38:57,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:38:57,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:38:57,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:38:57,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:38:57,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:38:54" (1/3) ... [2022-11-16 12:38:57,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579b7e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:38:57, skipping insertion in model container [2022-11-16 12:38:57,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:55" (2/3) ... [2022-11-16 12:38:57,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579b7e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:38:57, skipping insertion in model container [2022-11-16 12:38:57,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:38:57" (3/3) ... [2022-11-16 12:38:57,237 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:38:57,265 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:38:57,265 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-16 12:38:57,266 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:38:57,373 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:38:57,424 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 12:38:57,442 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 125 transitions, 265 flow [2022-11-16 12:38:57,445 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 125 transitions, 265 flow [2022-11-16 12:38:57,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-11-16 12:38:57,516 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-11-16 12:38:57,516 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:38:57,522 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 81 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-16 12:38:57,524 INFO L119 LiptonReduction]: Number of co-enabled transitions 2264 [2022-11-16 12:39:07,835 INFO L134 LiptonReduction]: Checked pairs total: 5468 [2022-11-16 12:39:07,835 INFO L136 LiptonReduction]: Total number of compositions: 124 [2022-11-16 12:39:07,843 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-16 12:39:07,954 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states 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 12:39:07,981 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:39:07,991 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;@1d652fed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:39:07,991 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-16 12:39:07,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states 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 12:39:08,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 12:39:08,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:08,002 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 12:39:08,003 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:39:08,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:08,009 INFO L85 PathProgramCache]: Analyzing trace with hash 600, now seen corresponding path program 1 times [2022-11-16 12:39:08,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:08,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464747478] [2022-11-16 12:39:08,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:08,020 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 12:39:08,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:08,022 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:08,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:08,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 12:39:08,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:08,123 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 12:39:08,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:08,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:08,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464747478] [2022-11-16 12:39:08,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464747478] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:08,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:08,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 12:39:08,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071932054] [2022-11-16 12:39:08,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:08,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:39:08,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:08,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:39:08,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:39:08,161 INFO L87 Difference]: Start difference. First operand has 1028 states, 1017 states have (on average 3.3235004916420845) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 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 12:39:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:08,341 INFO L93 Difference]: Finished difference Result 970 states and 3096 transitions. [2022-11-16 12:39:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:39:08,348 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 12:39:08,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:08,390 INFO L225 Difference]: With dead ends: 970 [2022-11-16 12:39:08,390 INFO L226 Difference]: Without dead ends: 970 [2022-11-16 12:39:08,391 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 12:39:08,394 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:08,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:39:08,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-11-16 12:39:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2022-11-16 12:39:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 965 states have (on average 3.2082901554404146) internal successors, (3096), 969 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states 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 12:39:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3096 transitions. [2022-11-16 12:39:08,511 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3096 transitions. Word has length 1 [2022-11-16 12:39:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:08,512 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 3096 transitions. [2022-11-16 12:39:08,512 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 12:39:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3096 transitions. [2022-11-16 12:39:08,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 12:39:08,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:08,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:08,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:08,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:08,725 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:39:08,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:08,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2012554046, now seen corresponding path program 1 times [2022-11-16 12:39:08,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:08,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502253587] [2022-11-16 12:39:08,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:08,730 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 12:39:08,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:08,732 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:08,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:08,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:39:08,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:08,886 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 12:39:08,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:08,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:08,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502253587] [2022-11-16 12:39:08,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502253587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:08,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:08,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:39:08,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143372751] [2022-11-16 12:39:08,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:08,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:39:08,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:08,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:39:08,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:39:08,890 INFO L87 Difference]: Start difference. First operand 970 states and 3096 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:09,032 INFO L93 Difference]: Finished difference Result 802 states and 2518 transitions. [2022-11-16 12:39:09,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:39:09,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-16 12:39:09,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:09,038 INFO L225 Difference]: With dead ends: 802 [2022-11-16 12:39:09,038 INFO L226 Difference]: Without dead ends: 778 [2022-11-16 12:39:09,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:39:09,040 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:09,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:39:09,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-11-16 12:39:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2022-11-16 12:39:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 776 states have (on average 3.1649484536082473) internal successors, (2456), 777 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states 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 12:39:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 2456 transitions. [2022-11-16 12:39:09,068 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 2456 transitions. Word has length 7 [2022-11-16 12:39:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:09,069 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 2456 transitions. [2022-11-16 12:39:09,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 2456 transitions. [2022-11-16 12:39:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 12:39:09,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:09,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:09,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-16 12:39:09,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:09,298 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:39:09,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:09,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1743298506, now seen corresponding path program 1 times [2022-11-16 12:39:09,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:09,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268258128] [2022-11-16 12:39:09,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:09,300 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 12:39:09,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:09,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:09,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:09,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:39:09,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:09,525 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 12:39:09,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:09,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:09,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268258128] [2022-11-16 12:39:09,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268258128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:09,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:09,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:39:09,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771741285] [2022-11-16 12:39:09,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:09,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:39:09,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:09,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:39:09,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:39:09,530 INFO L87 Difference]: Start difference. First operand 778 states and 2456 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:09,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:09,735 INFO L93 Difference]: Finished difference Result 598 states and 1602 transitions. [2022-11-16 12:39:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:39:09,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 12:39:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:09,740 INFO L225 Difference]: With dead ends: 598 [2022-11-16 12:39:09,740 INFO L226 Difference]: Without dead ends: 478 [2022-11-16 12:39:09,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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 12:39:09,742 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 43 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:09,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:39:09,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-11-16 12:39:09,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2022-11-16 12:39:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 476 states have (on average 2.638655462184874) internal successors, (1256), 477 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states 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 12:39:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1256 transitions. [2022-11-16 12:39:09,760 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1256 transitions. Word has length 10 [2022-11-16 12:39:09,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:09,761 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 1256 transitions. [2022-11-16 12:39:09,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:09,761 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1256 transitions. [2022-11-16 12:39:09,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:39:09,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:09,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:09,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:09,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:09,975 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:39:09,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1160937874, now seen corresponding path program 1 times [2022-11-16 12:39:09,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:09,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806085856] [2022-11-16 12:39:09,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:09,977 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 12:39:09,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:09,979 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:10,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:10,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:39:10,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:10,182 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 12:39:10,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:10,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:10,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806085856] [2022-11-16 12:39:10,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806085856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:10,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:10,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:39:10,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013244931] [2022-11-16 12:39:10,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:10,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:39:10,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:10,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:39:10,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:39:10,189 INFO L87 Difference]: Start difference. First operand 478 states and 1256 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:10,438 INFO L93 Difference]: Finished difference Result 303 states and 704 transitions. [2022-11-16 12:39:10,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:39:10,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 12:39:10,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:10,440 INFO L225 Difference]: With dead ends: 303 [2022-11-16 12:39:10,440 INFO L226 Difference]: Without dead ends: 243 [2022-11-16 12:39:10,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:39:10,442 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 68 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:10,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 5 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:39:10,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-16 12:39:10,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2022-11-16 12:39:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 241 states have (on average 2.2863070539419086) internal successors, (551), 242 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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 12:39:10,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 551 transitions. [2022-11-16 12:39:10,457 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 551 transitions. Word has length 13 [2022-11-16 12:39:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:10,458 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 551 transitions. [2022-11-16 12:39:10,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 551 transitions. [2022-11-16 12:39:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:39:10,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:10,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:10,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:10,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:10,692 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:39:10,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:10,692 INFO L85 PathProgramCache]: Analyzing trace with hash -872040873, now seen corresponding path program 1 times [2022-11-16 12:39:10,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:10,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005429082] [2022-11-16 12:39:10,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:10,693 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 12:39:10,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:10,695 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:10,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:10,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:39:10,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:10,924 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 12:39:10,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:10,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:10,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005429082] [2022-11-16 12:39:10,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005429082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:10,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:10,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:39:10,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107008138] [2022-11-16 12:39:10,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:10,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:39:10,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:10,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:39:10,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:39:10,927 INFO L87 Difference]: Start difference. First operand 243 states and 551 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:11,236 INFO L93 Difference]: Finished difference Result 196 states and 455 transitions. [2022-11-16 12:39:11,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:39:11,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-16 12:39:11,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:11,238 INFO L225 Difference]: With dead ends: 196 [2022-11-16 12:39:11,238 INFO L226 Difference]: Without dead ends: 183 [2022-11-16 12:39:11,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:39:11,239 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 76 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:11,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 9 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:39:11,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-16 12:39:11,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-16 12:39:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 181 states have (on average 2.3812154696132595) internal successors, (431), 182 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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 12:39:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 431 transitions. [2022-11-16 12:39:11,246 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 431 transitions. Word has length 17 [2022-11-16 12:39:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:11,246 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 431 transitions. [2022-11-16 12:39:11,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 431 transitions. [2022-11-16 12:39:11,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:39:11,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:11,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:11,272 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:11,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:11,458 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:39:11,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash -924935714, now seen corresponding path program 1 times [2022-11-16 12:39:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:11,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570913372] [2022-11-16 12:39:11,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:11,460 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 12:39:11,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:11,464 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:11,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:11,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:39:11,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:11,812 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 12:39:11,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:11,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:11,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570913372] [2022-11-16 12:39:11,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570913372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:11,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:11,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:39:11,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319167698] [2022-11-16 12:39:11,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:11,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:39:11,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:11,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:39:11,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:39:11,816 INFO L87 Difference]: Start difference. First operand 183 states and 431 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:11,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:11,980 INFO L93 Difference]: Finished difference Result 241 states and 552 transitions. [2022-11-16 12:39:11,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:39:11,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 12:39:11,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:11,982 INFO L225 Difference]: With dead ends: 241 [2022-11-16 12:39:11,982 INFO L226 Difference]: Without dead ends: 241 [2022-11-16 12:39:11,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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 12:39:11,983 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:11,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:39:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-16 12:39:11,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2022-11-16 12:39:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 238 states have (on average 2.319327731092437) internal successors, (552), 239 states have internal predecessors, (552), 0 states have call successors, (0), 0 states 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 12:39:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 552 transitions. [2022-11-16 12:39:11,993 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 552 transitions. Word has length 22 [2022-11-16 12:39:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:11,993 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 552 transitions. [2022-11-16 12:39:11,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:11,994 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 552 transitions. [2022-11-16 12:39:11,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:39:11,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:11,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:12,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:12,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:12,198 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:39:12,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:12,198 INFO L85 PathProgramCache]: Analyzing trace with hash -924935692, now seen corresponding path program 1 times [2022-11-16 12:39:12,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:12,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790280818] [2022-11-16 12:39:12,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:12,199 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 12:39:12,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:12,201 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:12,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:12,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 12:39:12,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:12,860 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 12:39:12,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:12,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:12,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790280818] [2022-11-16 12:39:12,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790280818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:12,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:12,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:39:12,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95348548] [2022-11-16 12:39:12,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:12,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:39:12,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:12,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:39:12,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:39:12,863 INFO L87 Difference]: Start difference. First operand 240 states and 552 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:12,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:12,978 INFO L93 Difference]: Finished difference Result 351 states and 807 transitions. [2022-11-16 12:39:12,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:39:12,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 12:39:12,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:12,981 INFO L225 Difference]: With dead ends: 351 [2022-11-16 12:39:12,981 INFO L226 Difference]: Without dead ends: 304 [2022-11-16 12:39:12,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:39:12,983 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:12,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-11-16 12:39:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-16 12:39:12,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 232. [2022-11-16 12:39:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 230 states have (on average 2.3086956521739133) internal successors, (531), 231 states have internal predecessors, (531), 0 states have call successors, (0), 0 states 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 12:39:12,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 531 transitions. [2022-11-16 12:39:12,993 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 531 transitions. Word has length 22 [2022-11-16 12:39:12,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:12,994 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 531 transitions. [2022-11-16 12:39:12,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 531 transitions. [2022-11-16 12:39:12,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:39:12,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:12,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:13,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:13,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:13,210 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:39:13,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:13,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1027448408, now seen corresponding path program 2 times [2022-11-16 12:39:13,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:13,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460114893] [2022-11-16 12:39:13,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:39:13,212 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 12:39:13,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:13,213 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:13,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:13,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 12:39:13,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:39:13,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 12:39:13,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:13,920 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 12:39:13,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:13,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:13,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460114893] [2022-11-16 12:39:13,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460114893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:13,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:13,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:39:13,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548749604] [2022-11-16 12:39:13,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:13,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:39:13,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:13,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:39:13,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:39:13,923 INFO L87 Difference]: Start difference. First operand 232 states and 531 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:14,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:14,039 INFO L93 Difference]: Finished difference Result 343 states and 786 transitions. [2022-11-16 12:39:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:39:14,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 12:39:14,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:14,041 INFO L225 Difference]: With dead ends: 343 [2022-11-16 12:39:14,041 INFO L226 Difference]: Without dead ends: 260 [2022-11-16 12:39:14,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:39:14,042 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:14,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-11-16 12:39:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-16 12:39:14,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 224. [2022-11-16 12:39:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 222 states have (on average 2.2972972972972974) internal successors, (510), 223 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 510 transitions. [2022-11-16 12:39:14,051 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 510 transitions. Word has length 22 [2022-11-16 12:39:14,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:14,052 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 510 transitions. [2022-11-16 12:39:14,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 510 transitions. [2022-11-16 12:39:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:39:14,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:14,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:14,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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)] Ended with exit code 0 [2022-11-16 12:39:14,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:14,268 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:39:14,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:14,268 INFO L85 PathProgramCache]: Analyzing trace with hash -948032504, now seen corresponding path program 3 times [2022-11-16 12:39:14,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:14,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799578773] [2022-11-16 12:39:14,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:39:14,269 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 12:39:14,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:14,270 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:14,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:14,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 12:39:14,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:39:14,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 12:39:14,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:15,026 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 12:39:15,026 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:15,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:15,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799578773] [2022-11-16 12:39:15,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799578773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:15,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:15,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:39:15,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741064448] [2022-11-16 12:39:15,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:15,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:39:15,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:15,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:39:15,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:39:15,029 INFO L87 Difference]: Start difference. First operand 224 states and 510 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:15,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:15,117 INFO L93 Difference]: Finished difference Result 335 states and 765 transitions. [2022-11-16 12:39:15,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:39:15,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 12:39:15,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:15,119 INFO L225 Difference]: With dead ends: 335 [2022-11-16 12:39:15,119 INFO L226 Difference]: Without dead ends: 216 [2022-11-16 12:39:15,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:39:15,120 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:15,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 33 Unchecked, 0.1s Time] [2022-11-16 12:39:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-16 12:39:15,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-11-16 12:39:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 214 states have (on average 2.2850467289719627) internal successors, (489), 215 states have internal predecessors, (489), 0 states have call successors, (0), 0 states 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 12:39:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 489 transitions. [2022-11-16 12:39:15,128 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 489 transitions. Word has length 22 [2022-11-16 12:39:15,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:15,128 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 489 transitions. [2022-11-16 12:39:15,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 489 transitions. [2022-11-16 12:39:15,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:39:15,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:15,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:15,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:15,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:15,346 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:39:15,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:15,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1232215428, now seen corresponding path program 4 times [2022-11-16 12:39:15,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:15,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052264753] [2022-11-16 12:39:15,347 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:39:15,347 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 12:39:15,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:15,348 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:15,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 12:39:15,674 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:39:15,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:39:15,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 12:39:15,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:16,100 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 12:39:16,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:16,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:16,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052264753] [2022-11-16 12:39:16,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1052264753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:16,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:16,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:39:16,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079121916] [2022-11-16 12:39:16,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:16,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:39:16,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:16,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:39:16,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:39:16,104 INFO L87 Difference]: Start difference. First operand 216 states and 489 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:16,169 INFO L93 Difference]: Finished difference Result 215 states and 487 transitions. [2022-11-16 12:39:16,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:39:16,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 12:39:16,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:16,175 INFO L225 Difference]: With dead ends: 215 [2022-11-16 12:39:16,175 INFO L226 Difference]: Without dead ends: 104 [2022-11-16 12:39:16,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:39:16,176 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 5 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:16,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-11-16 12:39:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-16 12:39:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-11-16 12:39:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.0776699029126213) internal successors, (214), 103 states have internal predecessors, (214), 0 states have call successors, (0), 0 states 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 12:39:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 214 transitions. [2022-11-16 12:39:16,182 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 214 transitions. Word has length 22 [2022-11-16 12:39:16,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:16,182 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 214 transitions. [2022-11-16 12:39:16,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 214 transitions. [2022-11-16 12:39:16,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:39:16,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:16,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:16,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:16,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:16,406 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:39:16,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:16,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1900284392, now seen corresponding path program 2 times [2022-11-16 12:39:16,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:16,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290209955] [2022-11-16 12:39:16,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:39:16,407 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 12:39:16,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:16,408 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:16,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-16 12:39:16,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 12:39:16,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:39:16,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 12:39:16,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:16,987 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 12:39:16,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:16,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:16,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290209955] [2022-11-16 12:39:16,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290209955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:16,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:16,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:39:16,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334991046] [2022-11-16 12:39:16,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:16,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:39:16,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:16,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:39:16,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:39:16,990 INFO L87 Difference]: Start difference. First operand 104 states and 214 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:17,343 INFO L93 Difference]: Finished difference Result 213 states and 430 transitions. [2022-11-16 12:39:17,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:39:17,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 12:39:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:17,348 INFO L225 Difference]: With dead ends: 213 [2022-11-16 12:39:17,348 INFO L226 Difference]: Without dead ends: 157 [2022-11-16 12:39:17,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:39:17,349 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:17,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 5 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:39:17,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-16 12:39:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 128. [2022-11-16 12:39:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.0551181102362204) internal successors, (261), 127 states have internal predecessors, (261), 0 states have call successors, (0), 0 states 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 12:39:17,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 261 transitions. [2022-11-16 12:39:17,355 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 261 transitions. Word has length 22 [2022-11-16 12:39:17,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:17,355 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 261 transitions. [2022-11-16 12:39:17,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 261 transitions. [2022-11-16 12:39:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:39:17,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:17,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:17,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:17,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:17,557 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:39:17,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:17,558 INFO L85 PathProgramCache]: Analyzing trace with hash -757055684, now seen corresponding path program 3 times [2022-11-16 12:39:17,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:17,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807682131] [2022-11-16 12:39:17,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:39:17,558 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 12:39:17,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:17,559 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:17,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-16 12:39:17,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 12:39:17,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:39:17,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 12:39:17,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:18,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:18,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:18,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807682131] [2022-11-16 12:39:18,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807682131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:18,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:18,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:39:18,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446992163] [2022-11-16 12:39:18,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:18,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:39:18,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:18,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:39:18,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:39:18,132 INFO L87 Difference]: Start difference. First operand 128 states and 261 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:18,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:18,399 INFO L93 Difference]: Finished difference Result 169 states and 339 transitions. [2022-11-16 12:39:18,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:39:18,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 12:39:18,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:18,401 INFO L225 Difference]: With dead ends: 169 [2022-11-16 12:39:18,401 INFO L226 Difference]: Without dead ends: 132 [2022-11-16 12:39:18,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:39:18,402 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:18,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 7 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:39:18,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-16 12:39:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2022-11-16 12:39:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 2.032520325203252) internal successors, (250), 123 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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 12:39:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 250 transitions. [2022-11-16 12:39:18,408 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 250 transitions. Word has length 22 [2022-11-16 12:39:18,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:18,408 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 250 transitions. [2022-11-16 12:39:18,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 250 transitions. [2022-11-16 12:39:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:39:18,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:18,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:18,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:18,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:18,621 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:39:18,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:18,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1137150296, now seen corresponding path program 4 times [2022-11-16 12:39:18,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:18,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277143819] [2022-11-16 12:39:18,622 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:39:18,622 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 12:39:18,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:18,624 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:18,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-16 12:39:18,817 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:39:18,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:39:18,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 12:39:18,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:19,087 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 12:39:19,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:19,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:19,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277143819] [2022-11-16 12:39:19,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277143819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:19,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:19,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:39:19,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274209115] [2022-11-16 12:39:19,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:19,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:39:19,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:19,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:39:19,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:39:19,090 INFO L87 Difference]: Start difference. First operand 124 states and 250 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:19,434 INFO L93 Difference]: Finished difference Result 209 states and 411 transitions. [2022-11-16 12:39:19,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:39:19,435 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 12:39:19,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:19,436 INFO L225 Difference]: With dead ends: 209 [2022-11-16 12:39:19,436 INFO L226 Difference]: Without dead ends: 129 [2022-11-16 12:39:19,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:39:19,437 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 33 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:19,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 8 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:39:19,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-16 12:39:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2022-11-16 12:39:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.9906542056074767) internal successors, (213), 107 states have internal predecessors, (213), 0 states have call successors, (0), 0 states 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 12:39:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 213 transitions. [2022-11-16 12:39:19,442 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 213 transitions. Word has length 22 [2022-11-16 12:39:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:19,442 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 213 transitions. [2022-11-16 12:39:19,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:19,442 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 213 transitions. [2022-11-16 12:39:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:39:19,443 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:19,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:19,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:19,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:19,644 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:39:19,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1007248984, now seen corresponding path program 5 times [2022-11-16 12:39:19,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:19,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942987876] [2022-11-16 12:39:19,645 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:39:19,645 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 12:39:19,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:19,646 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:19,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 (15)] Waiting until timeout for monitored process [2022-11-16 12:39:19,834 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 12:39:19,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:39:19,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-16 12:39:19,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:20,488 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 12:39:20,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:20,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:20,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942987876] [2022-11-16 12:39:20,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942987876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:20,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:20,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:39:20,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491343474] [2022-11-16 12:39:20,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:20,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:39:20,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:20,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:39:20,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:39:20,491 INFO L87 Difference]: Start difference. First operand 108 states and 213 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:20,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:20,978 INFO L93 Difference]: Finished difference Result 137 states and 263 transitions. [2022-11-16 12:39:20,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:39:20,979 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 12:39:20,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:20,979 INFO L225 Difference]: With dead ends: 137 [2022-11-16 12:39:20,979 INFO L226 Difference]: Without dead ends: 110 [2022-11-16 12:39:20,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:39:20,980 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 34 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:20,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 13 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:39:20,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-16 12:39:20,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2022-11-16 12:39:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.970873786407767) internal successors, (203), 103 states have internal predecessors, (203), 0 states have call successors, (0), 0 states 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 12:39:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 203 transitions. [2022-11-16 12:39:20,984 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 203 transitions. Word has length 22 [2022-11-16 12:39:20,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:20,985 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 203 transitions. [2022-11-16 12:39:20,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:20,985 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 203 transitions. [2022-11-16 12:39:20,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:39:20,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:20,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:20,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 (15)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:21,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:21,198 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:39:21,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:21,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1143360834, now seen corresponding path program 6 times [2022-11-16 12:39:21,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:21,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313488543] [2022-11-16 12:39:21,199 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 12:39:21,199 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 12:39:21,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:21,200 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:21,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 (16)] Waiting until timeout for monitored process [2022-11-16 12:39:21,332 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-11-16 12:39:21,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:39:21,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 12:39:21,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:21,671 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 12:39:21,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:21,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:39:21,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313488543] [2022-11-16 12:39:21,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313488543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:21,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:21,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:39:21,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955865720] [2022-11-16 12:39:21,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:21,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:39:21,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:39:21,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:39:21,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:39:21,674 INFO L87 Difference]: Start difference. First operand 104 states and 203 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:39:21,972 INFO L93 Difference]: Finished difference Result 131 states and 252 transitions. [2022-11-16 12:39:21,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:39:21,973 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 12:39:21,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:39:21,974 INFO L225 Difference]: With dead ends: 131 [2022-11-16 12:39:21,974 INFO L226 Difference]: Without dead ends: 84 [2022-11-16 12:39:21,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:39:21,975 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 26 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:39:21,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:39:21,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-16 12:39:21,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2022-11-16 12:39:21,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.825) internal successors, (146), 80 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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 12:39:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 146 transitions. [2022-11-16 12:39:21,980 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 146 transitions. Word has length 22 [2022-11-16 12:39:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:39:21,981 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 146 transitions. [2022-11-16 12:39:21,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:21,981 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 146 transitions. [2022-11-16 12:39:21,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 12:39:21,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:39:21,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:22,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 (16)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:22,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:22,192 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 12:39:22,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:22,192 INFO L85 PathProgramCache]: Analyzing trace with hash -17116866, now seen corresponding path program 7 times [2022-11-16 12:39:22,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:39:22,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646559402] [2022-11-16 12:39:22,193 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 12:39:22,193 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 12:39:22,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:39:22,194 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:22,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 (17)] Waiting until timeout for monitored process [2022-11-16 12:39:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:39:22,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:39:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:39:22,567 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-16 12:39:22,568 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:39:22,569 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-16 12:39:22,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-16 12:39:22,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-16 12:39:22,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-16 12:39:22,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-16 12:39:22,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-16 12:39:22,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-16 12:39:22,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-16 12:39:22,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-16 12:39:22,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-16 12:39:22,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-16 12:39:22,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-16 12:39:22,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-16 12:39:22,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 (17)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:22,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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 12:39:22,790 INFO L444 BasicCegarLoop]: Path program histogram: [7, 4, 1, 1, 1, 1, 1] [2022-11-16 12:39:22,795 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:39:22,795 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:39:22,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:39:22 BasicIcfg [2022-11-16 12:39:22,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:39:22,877 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:39:22,877 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:39:22,877 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:39:22,878 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:38:57" (3/4) ... [2022-11-16 12:39:22,880 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 12:39:22,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:39:22,886 INFO L158 Benchmark]: Toolchain (without parser) took 28082.82ms. Allocated memory was 65.0MB in the beginning and 184.5MB in the end (delta: 119.5MB). Free memory was 44.0MB in the beginning and 97.4MB in the end (delta: -53.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2022-11-16 12:39:22,886 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 65.0MB. Free memory was 46.1MB in the beginning and 46.0MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:39:22,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 794.18ms. Allocated memory is still 65.0MB. Free memory was 43.7MB in the beginning and 33.7MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:39:22,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.06ms. Allocated memory is still 65.0MB. Free memory was 33.7MB in the beginning and 31.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 12:39:22,889 INFO L158 Benchmark]: Boogie Preprocessor took 90.16ms. Allocated memory is still 65.0MB. Free memory was 31.0MB in the beginning and 47.5MB in the end (delta: -16.6MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2022-11-16 12:39:22,890 INFO L158 Benchmark]: RCFGBuilder took 1448.25ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 47.5MB in the beginning and 51.1MB in the end (delta: -3.5MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2022-11-16 12:39:22,890 INFO L158 Benchmark]: TraceAbstraction took 25647.95ms. Allocated memory was 83.9MB in the beginning and 184.5MB in the end (delta: 100.7MB). Free memory was 50.1MB in the beginning and 98.5MB in the end (delta: -48.4MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2022-11-16 12:39:22,890 INFO L158 Benchmark]: Witness Printer took 8.74ms. Allocated memory is still 184.5MB. Free memory was 98.5MB in the beginning and 97.4MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:39:22,892 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.35ms. Allocated memory is still 65.0MB. Free memory was 46.1MB in the beginning and 46.0MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 794.18ms. Allocated memory is still 65.0MB. Free memory was 43.7MB in the beginning and 33.7MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.06ms. Allocated memory is still 65.0MB. Free memory was 33.7MB in the beginning and 31.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.16ms. Allocated memory is still 65.0MB. Free memory was 31.0MB in the beginning and 47.5MB in the end (delta: -16.6MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1448.25ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 47.5MB in the beginning and 51.1MB in the end (delta: -3.5MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * TraceAbstraction took 25647.95ms. Allocated memory was 83.9MB in the beginning and 184.5MB in the end (delta: 100.7MB). Free memory was 50.1MB in the beginning and 98.5MB in the end (delta: -48.4MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * Witness Printer took 8.74ms. Allocated memory is still 184.5MB. Free memory was 98.5MB in the beginning and 97.4MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.4s, 133 PlacesBefore, 44 PlacesAfterwards, 125 TransitionsBefore, 35 TransitionsAfterwards, 2264 CoEnabledTransitionPairs, 6 FixpointIterations, 50 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 124 TotalNumberOfCompositions, 5468 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2855, independent: 2709, independent conditional: 0, independent unconditional: 2709, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1588, independent: 1522, independent conditional: 0, independent unconditional: 1522, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1588, independent: 1492, independent conditional: 0, independent unconditional: 1492, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 96, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 921, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 853, dependent conditional: 0, dependent unconditional: 853, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2855, independent: 1187, independent conditional: 0, independent unconditional: 1187, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 1588, unknown conditional: 0, unknown unconditional: 1588] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 169, Positive conditional cache size: 0, Positive unconditional cache size: 169, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, 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: [L719] 0 _Bool x$flush_delayed; [L730] 0 int *x$read_delayed_var; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L720] 0 int x$mem_tmp; [L712] 0 int __unbuffered_p0_EAX = 0; [L724] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff0_thd1; [L714] 0 int __unbuffered_p1_EAX = 0; [L723] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$read_delayed; [L710] 0 int __unbuffered_cnt = 0; [L716] 0 _Bool main$tmp_guard1; [L734] 0 _Bool x$w_buff1_used; [L715] 0 _Bool main$tmp_guard0; [L732] 0 _Bool x$w_buff0_used; [L731] 0 int x$w_buff0; [L733] 0 int x$w_buff1; [L718] 0 int x = 0; [L726] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd0; [L736] 0 int y = 0; [L728] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$r_buff1_thd2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=0, t2537={-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] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=1, t2537={-6:0}, t2538={-10: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] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=2, t2537={-6:0}, t2538={-10:0}, t2539={-2: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] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, x$r_buff0_thd3=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, x$r_buff0_thd3=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, x$r_buff0_thd3=1, 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=2, 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_EAX = 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=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, 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=2, 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; [L772] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, x$r_buff0_thd3=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 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) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 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 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 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=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, x$r_buff0_thd3=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_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=4, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L798] 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) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={-6:0}, t2538={-10:0}, t2539={-2:0}, weak$$choice0=4, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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=2, 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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 852]: 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: 854]: 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, 152 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 25.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 393 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 125 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1522 IncrementalHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 21 mSDtfsCounter, 1522 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1028occurred in iteration=0, InterpolantAutomatonStates: 85, 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, 15 MinimizatonAttempts, 176 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 253 ConstructedInterpolants, 62 QuantifiedInterpolants, 3854 SizeOfPredicates, 22 NumberOfNonLiveVariables, 2399 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 12:39:22,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bff00e8-482a-45d2-a461-0f009e99e3e4/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