./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN --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 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea --- 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-6b4ec56 [2022-11-20 10:34:42,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:34:42,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:34:42,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:34:42,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:34:42,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:34:42,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:34:42,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:34:42,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:34:42,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:34:42,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:34:42,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:34:42,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:34:42,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:34:42,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:34:42,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:34:42,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:34:42,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:34:42,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:34:42,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:34:42,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:34:42,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:34:42,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:34:42,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:34:42,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:34:42,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:34:42,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:34:42,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:34:42,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:34:42,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:34:42,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:34:42,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:34:42,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:34:42,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:34:42,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:34:42,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:34:42,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:34:42,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:34:42,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:34:42,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:34:42,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:34:42,794 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 10:34:42,822 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:34:42,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:34:42,823 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:34:42,824 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:34:42,825 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:34:42,825 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:34:42,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:34:42,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:34:42,826 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:34:42,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:34:42,828 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:34:42,828 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:34:42,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:34:42,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:34:42,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:34:42,829 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:34:42,829 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:34:42,830 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:34:42,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:34:42,830 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:34:42,830 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:34:42,831 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:34:42,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:34:42,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:34:42,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:34:42,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:34:42,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:34:42,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:34:42,833 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:34:42,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:34:42,833 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_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/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_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN 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 -> 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea [2022-11-20 10:34:43,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:34:43,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:34:43,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:34:43,180 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:34:43,181 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:34:43,182 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2022-11-20 10:34:46,282 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:34:46,559 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:34:46,560 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2022-11-20 10:34:46,574 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/data/2d601ebf6/2727a82d8c394340ac967ceeae841d93/FLAGfe9267074 [2022-11-20 10:34:46,589 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/data/2d601ebf6/2727a82d8c394340ac967ceeae841d93 [2022-11-20 10:34:46,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:34:46,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:34:46,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:34:46,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:34:46,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:34:46,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:34:46" (1/1) ... [2022-11-20 10:34:46,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37a704b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:46, skipping insertion in model container [2022-11-20 10:34:46,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:34:46" (1/1) ... [2022-11-20 10:34:46,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:34:46,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:34:46,835 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/sv-benchmarks/c/pthread-wmm/mix042.oepc.i[945,958] [2022-11-20 10:34:47,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:34:47,134 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:34:47,152 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/sv-benchmarks/c/pthread-wmm/mix042.oepc.i[945,958] [2022-11-20 10:34:47,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:34:47,269 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:34:47,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:47 WrapperNode [2022-11-20 10:34:47,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:34:47,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:34:47,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:34:47,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:34:47,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:47" (1/1) ... [2022-11-20 10:34:47,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:47" (1/1) ... [2022-11-20 10:34:47,358 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-11-20 10:34:47,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:34:47,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:34:47,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:34:47,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:34:47,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:47" (1/1) ... [2022-11-20 10:34:47,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:47" (1/1) ... [2022-11-20 10:34:47,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:47" (1/1) ... [2022-11-20 10:34:47,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:47" (1/1) ... [2022-11-20 10:34:47,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:47" (1/1) ... [2022-11-20 10:34:47,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:47" (1/1) ... [2022-11-20 10:34:47,397 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:47" (1/1) ... [2022-11-20 10:34:47,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:47" (1/1) ... [2022-11-20 10:34:47,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:34:47,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:34:47,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:34:47,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:34:47,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:47" (1/1) ... [2022-11-20 10:34:47,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:34:47,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:34:47,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:34:47,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:34:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:34:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 10:34:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:34:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:34:47,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:34:47,498 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 10:34:47,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 10:34:47,498 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 10:34:47,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 10:34:47,498 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 10:34:47,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 10:34:47,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:34:47,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 10:34:47,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:34:47,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:34:47,501 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:34:47,643 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:34:47,645 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:34:48,043 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:34:48,339 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:34:48,343 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:34:48,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:34:48 BoogieIcfgContainer [2022-11-20 10:34:48,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:34:48,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:34:48,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:34:48,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:34:48,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:34:46" (1/3) ... [2022-11-20 10:34:48,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd05cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:34:48, skipping insertion in model container [2022-11-20 10:34:48,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:34:47" (2/3) ... [2022-11-20 10:34:48,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd05cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:34:48, skipping insertion in model container [2022-11-20 10:34:48,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:34:48" (3/3) ... [2022-11-20 10:34:48,358 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.oepc.i [2022-11-20 10:34:48,377 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:34:48,377 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-20 10:34:48,378 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:34:48,467 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 10:34:48,519 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 10:34:48,544 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 129 transitions, 273 flow [2022-11-20 10:34:48,548 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 129 transitions, 273 flow [2022-11-20 10:34:48,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 129 transitions, 273 flow [2022-11-20 10:34:48,634 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-11-20 10:34:48,634 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:34:48,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-20 10:34:48,646 INFO L119 LiptonReduction]: Number of co-enabled transitions 2524 [2022-11-20 10:34:54,224 INFO L134 LiptonReduction]: Checked pairs total: 6762 [2022-11-20 10:34:54,224 INFO L136 LiptonReduction]: Total number of compositions: 125 [2022-11-20 10:34:54,232 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 36 transitions, 87 flow [2022-11-20 10:34:54,345 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:54,372 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:34:54,381 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;@462a8c36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:34:54,381 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-20 10:34:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:54,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 10:34:54,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:34:54,394 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 10:34:54,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:34:54,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:54,403 INFO L85 PathProgramCache]: Analyzing trace with hash 552, now seen corresponding path program 1 times [2022-11-20 10:34:54,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:54,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420766709] [2022-11-20 10:34:54,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:54,546 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-20 10:34:54,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:54,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420766709] [2022-11-20 10:34:54,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420766709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:54,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:54,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 10:34:54,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848312153] [2022-11-20 10:34:54,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:54,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:34:54,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:54,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:34:54,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:34:54,580 INFO L87 Difference]: Start difference. First operand has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 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-20 10:34:54,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:34:54,683 INFO L93 Difference]: Finished difference Result 1214 states and 3934 transitions. [2022-11-20 10:34:54,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:34:54,698 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-20 10:34:54,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:34:54,735 INFO L225 Difference]: With dead ends: 1214 [2022-11-20 10:34:54,735 INFO L226 Difference]: Without dead ends: 1214 [2022-11-20 10:34:54,736 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-20 10:34:54,742 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:34:54,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:34:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2022-11-20 10:34:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2022-11-20 10:34:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1209 states have (on average 3.2539288668320925) internal successors, (3934), 1213 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3934 transitions. [2022-11-20 10:34:54,902 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3934 transitions. Word has length 1 [2022-11-20 10:34:54,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:34:54,903 INFO L495 AbstractCegarLoop]: Abstraction has 1214 states and 3934 transitions. [2022-11-20 10:34:54,906 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-20 10:34:54,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3934 transitions. [2022-11-20 10:34:54,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 10:34:54,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:34:54,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 10:34:54,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:34:54,910 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:34:54,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:54,912 INFO L85 PathProgramCache]: Analyzing trace with hash 544150, now seen corresponding path program 1 times [2022-11-20 10:34:54,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:54,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631681330] [2022-11-20 10:34:54,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:54,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:55,289 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-20 10:34:55,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:55,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631681330] [2022-11-20 10:34:55,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631681330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:55,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:55,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 10:34:55,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420088910] [2022-11-20 10:34:55,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:55,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:34:55,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:55,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:34:55,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:34:55,294 INFO L87 Difference]: Start difference. First operand 1214 states and 3934 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:55,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:34:55,395 INFO L93 Difference]: Finished difference Result 992 states and 3169 transitions. [2022-11-20 10:34:55,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:34:55,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 10:34:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:34:55,403 INFO L225 Difference]: With dead ends: 992 [2022-11-20 10:34:55,404 INFO L226 Difference]: Without dead ends: 962 [2022-11-20 10:34:55,405 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-20 10:34:55,412 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:34:55,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:34:55,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-11-20 10:34:55,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2022-11-20 10:34:55,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 960 states have (on average 3.21875) internal successors, (3090), 961 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 3090 transitions. [2022-11-20 10:34:55,463 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 3090 transitions. Word has length 3 [2022-11-20 10:34:55,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:34:55,463 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 3090 transitions. [2022-11-20 10:34:55,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:55,464 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 3090 transitions. [2022-11-20 10:34:55,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 10:34:55,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:34:55,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:34:55,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:34:55,471 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:34:55,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:55,472 INFO L85 PathProgramCache]: Analyzing trace with hash -286720706, now seen corresponding path program 1 times [2022-11-20 10:34:55,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:55,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134153757] [2022-11-20 10:34:55,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:55,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:55,758 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-20 10:34:55,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:55,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134153757] [2022-11-20 10:34:55,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134153757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:55,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:55,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:34:55,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752060689] [2022-11-20 10:34:55,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:55,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:34:55,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:55,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:34:55,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:34:55,761 INFO L87 Difference]: Start difference. First operand 962 states and 3090 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:34:55,998 INFO L93 Difference]: Finished difference Result 1922 states and 5940 transitions. [2022-11-20 10:34:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:34:55,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 10:34:55,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:34:56,013 INFO L225 Difference]: With dead ends: 1922 [2022-11-20 10:34:56,014 INFO L226 Difference]: Without dead ends: 1922 [2022-11-20 10:34:56,015 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-20 10:34:56,018 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:34:56,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 12 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:34:56,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2022-11-20 10:34:56,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1362. [2022-11-20 10:34:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1360 states have (on average 3.2323529411764707) internal successors, (4396), 1361 states have internal predecessors, (4396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:56,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 4396 transitions. [2022-11-20 10:34:56,078 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 4396 transitions. Word has length 10 [2022-11-20 10:34:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:34:56,079 INFO L495 AbstractCegarLoop]: Abstraction has 1362 states and 4396 transitions. [2022-11-20 10:34:56,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 4396 transitions. [2022-11-20 10:34:56,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 10:34:56,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:34:56,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:34:56,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:34:56,089 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:34:56,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:56,089 INFO L85 PathProgramCache]: Analyzing trace with hash -286720670, now seen corresponding path program 1 times [2022-11-20 10:34:56,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:56,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932414594] [2022-11-20 10:34:56,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:56,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:56,666 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-20 10:34:56,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:56,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932414594] [2022-11-20 10:34:56,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932414594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:56,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:56,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:34:56,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316195817] [2022-11-20 10:34:56,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:56,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:34:56,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:56,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:34:56,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:34:56,676 INFO L87 Difference]: Start difference. First operand 1362 states and 4396 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-20 10:34:56,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:34:56,897 INFO L93 Difference]: Finished difference Result 1212 states and 3741 transitions. [2022-11-20 10:34:56,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:34:56,898 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-20 10:34:56,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:34:56,905 INFO L225 Difference]: With dead ends: 1212 [2022-11-20 10:34:56,905 INFO L226 Difference]: Without dead ends: 981 [2022-11-20 10:34:56,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:34:56,908 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 42 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:34:56,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 21 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:34:56,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-11-20 10:34:56,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 981. [2022-11-20 10:34:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.1010204081632655) internal successors, (3039), 980 states have internal predecessors, (3039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3039 transitions. [2022-11-20 10:34:56,953 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3039 transitions. Word has length 10 [2022-11-20 10:34:56,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:34:56,953 INFO L495 AbstractCegarLoop]: Abstraction has 981 states and 3039 transitions. [2022-11-20 10:34:56,953 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-20 10:34:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3039 transitions. [2022-11-20 10:34:56,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 10:34:56,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:34:56,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:34:56,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:34:56,956 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:34:56,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:56,957 INFO L85 PathProgramCache]: Analyzing trace with hash -298411152, now seen corresponding path program 1 times [2022-11-20 10:34:56,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:56,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611558083] [2022-11-20 10:34:56,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:56,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:34:57,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:57,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611558083] [2022-11-20 10:34:57,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611558083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:57,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:57,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:34:57,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715992829] [2022-11-20 10:34:57,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:57,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:34:57,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:57,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:34:57,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:34:57,124 INFO L87 Difference]: Start difference. First operand 981 states and 3039 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:34:57,268 INFO L93 Difference]: Finished difference Result 1041 states and 3132 transitions. [2022-11-20 10:34:57,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:34:57,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 10:34:57,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:34:57,274 INFO L225 Difference]: With dead ends: 1041 [2022-11-20 10:34:57,275 INFO L226 Difference]: Without dead ends: 901 [2022-11-20 10:34:57,275 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-20 10:34:57,276 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 30 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:34:57,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 13 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:34:57,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-11-20 10:34:57,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 811. [2022-11-20 10:34:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 3.0753086419753086) internal successors, (2491), 810 states have internal predecessors, (2491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:57,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2491 transitions. [2022-11-20 10:34:57,305 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2491 transitions. Word has length 11 [2022-11-20 10:34:57,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:34:57,305 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 2491 transitions. [2022-11-20 10:34:57,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:57,306 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2491 transitions. [2022-11-20 10:34:57,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 10:34:57,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:34:57,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:34:57,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:34:57,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:34:57,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:57,308 INFO L85 PathProgramCache]: Analyzing trace with hash -660887053, now seen corresponding path program 1 times [2022-11-20 10:34:57,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:57,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122556906] [2022-11-20 10:34:57,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:57,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:57,484 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-20 10:34:57,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:57,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122556906] [2022-11-20 10:34:57,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122556906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:57,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:57,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:34:57,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038328081] [2022-11-20 10:34:57,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:57,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:34:57,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:57,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:34:57,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:34:57,487 INFO L87 Difference]: Start difference. First operand 811 states and 2491 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:34:57,612 INFO L93 Difference]: Finished difference Result 706 states and 1878 transitions. [2022-11-20 10:34:57,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:34:57,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 10:34:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:34:57,616 INFO L225 Difference]: With dead ends: 706 [2022-11-20 10:34:57,616 INFO L226 Difference]: Without dead ends: 523 [2022-11-20 10:34:57,616 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-20 10:34:57,617 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 46 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:34:57,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 9 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:34:57,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-11-20 10:34:57,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2022-11-20 10:34:57,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 2.5804597701149423) internal successors, (1347), 522 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 1347 transitions. [2022-11-20 10:34:57,634 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 1347 transitions. Word has length 12 [2022-11-20 10:34:57,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:34:57,634 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 1347 transitions. [2022-11-20 10:34:57,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 1347 transitions. [2022-11-20 10:34:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 10:34:57,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:34:57,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:34:57,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:34:57,636 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:34:57,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:57,637 INFO L85 PathProgramCache]: Analyzing trace with hash -782037825, now seen corresponding path program 1 times [2022-11-20 10:34:57,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:57,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335160254] [2022-11-20 10:34:57,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:57,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:57,873 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-20 10:34:57,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:57,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335160254] [2022-11-20 10:34:57,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335160254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:57,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:57,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:34:57,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208171384] [2022-11-20 10:34:57,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:57,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:34:57,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:57,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:34:57,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:34:57,876 INFO L87 Difference]: Start difference. First operand 523 states and 1347 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-20 10:34:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:34:58,013 INFO L93 Difference]: Finished difference Result 390 states and 916 transitions. [2022-11-20 10:34:58,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:34:58,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-20 10:34:58,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:34:58,015 INFO L225 Difference]: With dead ends: 390 [2022-11-20 10:34:58,016 INFO L226 Difference]: Without dead ends: 303 [2022-11-20 10:34:58,016 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-20 10:34:58,017 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 85 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:34:58,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 12 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:34:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-11-20 10:34:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 297. [2022-11-20 10:34:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 2.293918918918919) internal successors, (679), 296 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:58,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 679 transitions. [2022-11-20 10:34:58,027 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 679 transitions. Word has length 15 [2022-11-20 10:34:58,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:34:58,027 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 679 transitions. [2022-11-20 10:34:58,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-20 10:34:58,028 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 679 transitions. [2022-11-20 10:34:58,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 10:34:58,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:34:58,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:34:58,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:34:58,030 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:34:58,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:58,030 INFO L85 PathProgramCache]: Analyzing trace with hash 237558911, now seen corresponding path program 1 times [2022-11-20 10:34:58,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:58,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864030006] [2022-11-20 10:34:58,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:58,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:58,376 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-20 10:34:58,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:58,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864030006] [2022-11-20 10:34:58,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864030006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:58,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:58,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:34:58,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938484374] [2022-11-20 10:34:58,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:58,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:34:58,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:58,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:34:58,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:34:58,381 INFO L87 Difference]: Start difference. First operand 297 states and 679 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:34:58,513 INFO L93 Difference]: Finished difference Result 260 states and 604 transitions. [2022-11-20 10:34:58,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:34:58,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 10:34:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:34:58,515 INFO L225 Difference]: With dead ends: 260 [2022-11-20 10:34:58,515 INFO L226 Difference]: Without dead ends: 225 [2022-11-20 10:34:58,515 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-20 10:34:58,516 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:34:58,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 8 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:34:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-20 10:34:58,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 198. [2022-11-20 10:34:58,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.3604060913705585) internal successors, (465), 197 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 465 transitions. [2022-11-20 10:34:58,524 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 465 transitions. Word has length 19 [2022-11-20 10:34:58,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:34:58,524 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 465 transitions. [2022-11-20 10:34:58,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 465 transitions. [2022-11-20 10:34:58,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:34:58,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:34:58,525 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, 1] [2022-11-20 10:34:58,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:34:58,526 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:34:58,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:58,526 INFO L85 PathProgramCache]: Analyzing trace with hash -119078677, now seen corresponding path program 1 times [2022-11-20 10:34:58,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:58,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534960565] [2022-11-20 10:34:58,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:58,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:58,859 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-20 10:34:58,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:58,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534960565] [2022-11-20 10:34:58,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534960565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:34:58,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:34:58,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:34:58,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996307725] [2022-11-20 10:34:58,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:34:58,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:34:58,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:58,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:34:58,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:34:58,867 INFO L87 Difference]: Start difference. First operand 198 states and 465 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:59,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:34:59,079 INFO L93 Difference]: Finished difference Result 336 states and 780 transitions. [2022-11-20 10:34:59,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:34:59,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-20 10:34:59,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:34:59,080 INFO L225 Difference]: With dead ends: 336 [2022-11-20 10:34:59,080 INFO L226 Difference]: Without dead ends: 146 [2022-11-20 10:34:59,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:34:59,081 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 19 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.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:34:59,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 19 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:34:59,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-20 10:34:59,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2022-11-20 10:34:59,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.1653543307086616) internal successors, (275), 127 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 275 transitions. [2022-11-20 10:34:59,086 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 275 transitions. Word has length 23 [2022-11-20 10:34:59,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:34:59,087 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 275 transitions. [2022-11-20 10:34:59,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:34:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 275 transitions. [2022-11-20 10:34:59,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:34:59,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:34:59,088 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, 1] [2022-11-20 10:34:59,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:34:59,088 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:34:59,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:59,089 INFO L85 PathProgramCache]: Analyzing trace with hash 796524215, now seen corresponding path program 2 times [2022-11-20 10:34:59,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:59,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448146223] [2022-11-20 10:34:59,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:59,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:00,466 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-20 10:35:00,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:00,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448146223] [2022-11-20 10:35:00,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448146223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:00,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:00,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:35:00,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919493271] [2022-11-20 10:35:00,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:00,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:35:00,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:00,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:35:00,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:35:00,469 INFO L87 Difference]: Start difference. First operand 128 states and 275 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:00,889 INFO L93 Difference]: Finished difference Result 211 states and 433 transitions. [2022-11-20 10:35:00,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:35:00,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-20 10:35:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:00,890 INFO L225 Difference]: With dead ends: 211 [2022-11-20 10:35:00,890 INFO L226 Difference]: Without dead ends: 124 [2022-11-20 10:35:00,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:35:00,891 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 68 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:00,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 32 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:35:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-20 10:35:00,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 94. [2022-11-20 10:35:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.946236559139785) internal successors, (181), 93 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 181 transitions. [2022-11-20 10:35:00,895 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 181 transitions. Word has length 23 [2022-11-20 10:35:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:00,896 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 181 transitions. [2022-11-20 10:35:00,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 181 transitions. [2022-11-20 10:35:00,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:35:00,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:00,897 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, 1] [2022-11-20 10:35:00,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:35:00,898 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:35:00,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:00,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1313103891, now seen corresponding path program 3 times [2022-11-20 10:35:00,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:00,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718221472] [2022-11-20 10:35:00,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:00,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:01,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:01,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718221472] [2022-11-20 10:35:01,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718221472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:01,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:01,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:35:01,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389308950] [2022-11-20 10:35:01,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:01,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:35:01,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:01,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:35:01,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:35:01,785 INFO L87 Difference]: Start difference. First operand 94 states and 181 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:02,011 INFO L93 Difference]: Finished difference Result 109 states and 204 transitions. [2022-11-20 10:35:02,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:35:02,012 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-20 10:35:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:02,013 INFO L225 Difference]: With dead ends: 109 [2022-11-20 10:35:02,013 INFO L226 Difference]: Without dead ends: 74 [2022-11-20 10:35:02,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:35:02,014 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:02,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:35:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-20 10:35:02,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-20 10:35:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.7945205479452055) internal successors, (131), 73 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:02,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 131 transitions. [2022-11-20 10:35:02,017 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 131 transitions. Word has length 23 [2022-11-20 10:35:02,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:02,017 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 131 transitions. [2022-11-20 10:35:02,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:02,018 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 131 transitions. [2022-11-20 10:35:02,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:35:02,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:02,018 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, 1] [2022-11-20 10:35:02,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:35:02,019 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:35:02,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:02,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2121291081, now seen corresponding path program 4 times [2022-11-20 10:35:02,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:02,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888915518] [2022-11-20 10:35:02,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:02,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:35:02,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:35:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:35:02,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:35:02,188 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:35:02,189 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-20 10:35:02,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-20 10:35:02,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-20 10:35:02,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-20 10:35:02,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-20 10:35:02,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-20 10:35:02,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-20 10:35:02,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-20 10:35:02,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-20 10:35:02,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-20 10:35:02,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-20 10:35:02,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-20 10:35:02,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-20 10:35:02,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:35:02,196 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:02,201 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 10:35:02,202 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:35:02,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:35:02 BasicIcfg [2022-11-20 10:35:02,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:35:02,307 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:35:02,307 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:35:02,307 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:35:02,308 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:34:48" (3/4) ... [2022-11-20 10:35:02,311 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 10:35:02,311 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:35:02,312 INFO L158 Benchmark]: Toolchain (without parser) took 15713.88ms. Allocated memory was 138.4MB in the beginning and 262.1MB in the end (delta: 123.7MB). Free memory was 101.3MB in the beginning and 189.3MB in the end (delta: -88.1MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2022-11-20 10:35:02,312 INFO L158 Benchmark]: CDTParser took 0.82ms. Allocated memory is still 138.4MB. Free memory is still 107.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:35:02,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 673.38ms. Allocated memory is still 138.4MB. Free memory was 101.3MB in the beginning and 77.7MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 10:35:02,313 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.75ms. Allocated memory is still 138.4MB. Free memory was 77.7MB in the beginning and 75.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:35:02,313 INFO L158 Benchmark]: Boogie Preprocessor took 59.40ms. Allocated memory is still 138.4MB. Free memory was 75.2MB in the beginning and 73.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:35:02,314 INFO L158 Benchmark]: RCFGBuilder took 926.56ms. Allocated memory is still 138.4MB. Free memory was 73.5MB in the beginning and 103.5MB in the end (delta: -30.0MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2022-11-20 10:35:02,314 INFO L158 Benchmark]: TraceAbstraction took 13957.10ms. Allocated memory was 138.4MB in the beginning and 262.1MB in the end (delta: 123.7MB). Free memory was 102.9MB in the beginning and 189.3MB in the end (delta: -86.4MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2022-11-20 10:35:02,315 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 262.1MB. Free memory is still 189.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:35:02,317 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.82ms. Allocated memory is still 138.4MB. Free memory is still 107.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 673.38ms. Allocated memory is still 138.4MB. Free memory was 101.3MB in the beginning and 77.7MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.75ms. Allocated memory is still 138.4MB. Free memory was 77.7MB in the beginning and 75.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.40ms. Allocated memory is still 138.4MB. Free memory was 75.2MB in the beginning and 73.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 926.56ms. Allocated memory is still 138.4MB. Free memory was 73.5MB in the beginning and 103.5MB in the end (delta: -30.0MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13957.10ms. Allocated memory was 138.4MB in the beginning and 262.1MB in the end (delta: 123.7MB). Free memory was 102.9MB in the beginning and 189.3MB in the end (delta: -86.4MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 262.1MB. Free memory is still 189.3MB. 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: 5.7s, 137 PlacesBefore, 45 PlacesAfterwards, 129 TransitionsBefore, 36 TransitionsAfterwards, 2524 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 125 TotalNumberOfCompositions, 6762 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3561, independent: 3379, independent conditional: 0, independent unconditional: 3379, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1766, independent: 1719, independent conditional: 0, independent unconditional: 1719, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1766, independent: 1701, independent conditional: 0, independent unconditional: 1701, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 380, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 355, dependent conditional: 0, dependent unconditional: 355, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3561, independent: 1660, independent conditional: 0, independent unconditional: 1660, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 1766, unknown conditional: 0, unknown unconditional: 1766] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 179, Positive conditional cache size: 0, Positive unconditional cache size: 179, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1105; [L844] FCALL, FORK 0 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1105, ((void *)0), P0, ((void *)0))=-2, t1105={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1106; [L846] FCALL, FORK 0 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1106, ((void *)0), P1, ((void *)0))=-1, t1105={5:0}, t1106={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L776] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L847] 0 pthread_t t1107; [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L848] FCALL, FORK 0 pthread_create(&t1107, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1107, ((void *)0), P2, ((void *)0))=0, t1105={5:0}, t1106={6:0}, t1107={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L796] 3 y = 2 [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1105={5:0}, t1106={6:0}, t1107={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L861] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 848]: 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: 844]: 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: 846]: 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, 158 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 482 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 482 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1133 IncrementalHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 55 mSDtfsCounter, 1133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1362occurred in iteration=3, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 731 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1458 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 10:35:02,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN --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 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea --- 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-6b4ec56 [2022-11-20 10:35:04,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:35:04,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:35:04,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:35:04,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:35:04,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:35:04,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:35:04,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:35:04,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:35:04,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:35:04,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:35:04,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:35:04,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:35:04,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:35:04,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:35:04,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:35:04,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:35:04,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:35:04,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:35:04,873 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:35:04,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:35:04,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:35:04,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:35:04,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:35:04,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:35:04,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:35:04,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:35:04,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:35:04,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:35:04,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:35:04,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:35:04,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:35:04,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:35:04,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:35:04,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:35:04,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:35:04,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:35:04,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:35:04,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:35:04,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:35:04,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:35:04,940 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-20 10:35:04,979 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:35:04,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:35:04,981 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:35:04,981 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:35:04,982 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:35:04,983 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:35:04,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:35:04,984 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:35:04,984 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:35:04,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:35:04,985 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:35:04,986 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:35:04,986 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:35:04,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:35:04,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:35:04,986 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:35:04,987 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:35:04,987 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:35:04,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:35:04,987 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:35:04,988 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 10:35:04,988 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 10:35:04,988 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:35:04,988 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:35:04,989 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:35:04,989 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:35:04,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:35:04,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:35:04,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:35:04,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:35:04,990 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 10:35:04,990 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 10:35:04,991 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 10:35:04,991 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_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/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_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN 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 -> 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea [2022-11-20 10:35:05,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:35:05,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:35:05,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:35:05,375 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:35:05,375 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:35:05,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2022-11-20 10:35:08,732 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:35:09,079 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:35:09,080 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2022-11-20 10:35:09,121 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/data/52d052737/da18079abf6444b1b69ece8a0f250357/FLAG79c88891b [2022-11-20 10:35:09,141 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/data/52d052737/da18079abf6444b1b69ece8a0f250357 [2022-11-20 10:35:09,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:35:09,150 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:35:09,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:35:09,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:35:09,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:35:09,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:35:09" (1/1) ... [2022-11-20 10:35:09,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166cd4de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:09, skipping insertion in model container [2022-11-20 10:35:09,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:35:09" (1/1) ... [2022-11-20 10:35:09,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:35:09,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:35:09,468 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/sv-benchmarks/c/pthread-wmm/mix042.oepc.i[945,958] [2022-11-20 10:35:09,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:35:09,752 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:35:09,765 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/sv-benchmarks/c/pthread-wmm/mix042.oepc.i[945,958] [2022-11-20 10:35:09,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:35:09,886 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:35:09,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:09 WrapperNode [2022-11-20 10:35:09,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:35:09,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:35:09,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:35:09,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:35:09,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:09" (1/1) ... [2022-11-20 10:35:09,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:09" (1/1) ... [2022-11-20 10:35:09,936 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-11-20 10:35:09,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:35:09,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:35:09,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:35:09,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:35:09,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:09" (1/1) ... [2022-11-20 10:35:09,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:09" (1/1) ... [2022-11-20 10:35:09,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:09" (1/1) ... [2022-11-20 10:35:09,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:09" (1/1) ... [2022-11-20 10:35:09,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:09" (1/1) ... [2022-11-20 10:35:09,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:09" (1/1) ... [2022-11-20 10:35:09,970 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:09" (1/1) ... [2022-11-20 10:35:09,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:09" (1/1) ... [2022-11-20 10:35:09,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:35:09,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:35:09,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:35:09,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:35:09,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:09" (1/1) ... [2022-11-20 10:35:09,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:35:09,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:35:10,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:35:10,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:35:10,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 10:35:10,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:35:10,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:35:10,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:35:10,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 10:35:10,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 10:35:10,063 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 10:35:10,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 10:35:10,064 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 10:35:10,064 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 10:35:10,065 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 10:35:10,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 10:35:10,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 10:35:10,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:35:10,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:35:10,067 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 10:35:10,263 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:35:10,265 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:35:10,775 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:35:10,920 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:35:10,920 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 10:35:10,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:35:10 BoogieIcfgContainer [2022-11-20 10:35:10,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:35:10,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:35:10,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:35:10,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:35:10,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:35:09" (1/3) ... [2022-11-20 10:35:10,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a7fcc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:35:10, skipping insertion in model container [2022-11-20 10:35:10,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:35:09" (2/3) ... [2022-11-20 10:35:10,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a7fcc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:35:10, skipping insertion in model container [2022-11-20 10:35:10,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:35:10" (3/3) ... [2022-11-20 10:35:10,931 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.oepc.i [2022-11-20 10:35:10,958 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:35:10,958 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-20 10:35:10,959 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:35:11,032 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 10:35:11,068 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 10:35:11,088 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-20 10:35:11,097 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-20 10:35:11,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 130 transitions, 275 flow [2022-11-20 10:35:11,193 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-11-20 10:35:11,193 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 10:35:11,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-20 10:35:11,205 INFO L119 LiptonReduction]: Number of co-enabled transitions 2524 [2022-11-20 10:35:20,922 INFO L134 LiptonReduction]: Checked pairs total: 6897 [2022-11-20 10:35:20,923 INFO L136 LiptonReduction]: Total number of compositions: 124 [2022-11-20 10:35:20,930 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 36 transitions, 87 flow [2022-11-20 10:35:21,047 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:21,067 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:35:21,073 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;@13d0a94b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:35:21,074 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-20 10:35:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:21,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 10:35:21,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:21,084 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 10:35:21,084 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:35:21,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:21,090 INFO L85 PathProgramCache]: Analyzing trace with hash 553, now seen corresponding path program 1 times [2022-11-20 10:35:21,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:21,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641219558] [2022-11-20 10:35:21,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:21,110 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-20 10:35:21,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:21,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:21,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:21,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 10:35:21,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:21,211 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-20 10:35:21,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:35:21,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:35:21,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641219558] [2022-11-20 10:35:21,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641219558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:21,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:21,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 10:35:21,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422996618] [2022-11-20 10:35:21,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:21,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:35:21,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:35:21,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:35:21,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:35:21,247 INFO L87 Difference]: Start difference. First operand has 1288 states, 1273 states have (on average 3.3747054202670856) internal successors, (4296), 1287 states have internal predecessors, (4296), 0 states have call successors, (0), 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-20 10:35:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:21,462 INFO L93 Difference]: Finished difference Result 1214 states and 3934 transitions. [2022-11-20 10:35:21,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:35:21,465 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-20 10:35:21,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:21,504 INFO L225 Difference]: With dead ends: 1214 [2022-11-20 10:35:21,504 INFO L226 Difference]: Without dead ends: 1214 [2022-11-20 10:35:21,505 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-20 10:35:21,508 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:21,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:35:21,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2022-11-20 10:35:21,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2022-11-20 10:35:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1209 states have (on average 3.2539288668320925) internal successors, (3934), 1213 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3934 transitions. [2022-11-20 10:35:21,655 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3934 transitions. Word has length 1 [2022-11-20 10:35:21,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:21,656 INFO L495 AbstractCegarLoop]: Abstraction has 1214 states and 3934 transitions. [2022-11-20 10:35:21,656 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-20 10:35:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3934 transitions. [2022-11-20 10:35:21,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 10:35:21,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:21,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 10:35:21,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:21,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:21,883 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:35:21,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:21,883 INFO L85 PathProgramCache]: Analyzing trace with hash 546135, now seen corresponding path program 1 times [2022-11-20 10:35:21,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:21,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199842143] [2022-11-20 10:35:21,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:21,884 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-20 10:35:21,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:21,886 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:21,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:22,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:35:22,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:22,036 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-20 10:35:22,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:35:22,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:35:22,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199842143] [2022-11-20 10:35:22,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199842143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:22,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:22,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 10:35:22,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883252155] [2022-11-20 10:35:22,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:22,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:35:22,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:35:22,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:35:22,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:22,050 INFO L87 Difference]: Start difference. First operand 1214 states and 3934 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:22,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:22,176 INFO L93 Difference]: Finished difference Result 992 states and 3169 transitions. [2022-11-20 10:35:22,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:35:22,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 10:35:22,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:22,186 INFO L225 Difference]: With dead ends: 992 [2022-11-20 10:35:22,186 INFO L226 Difference]: Without dead ends: 962 [2022-11-20 10:35:22,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:35:22,189 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:22,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:35:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-11-20 10:35:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2022-11-20 10:35:22,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 960 states have (on average 3.21875) internal successors, (3090), 961 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 3090 transitions. [2022-11-20 10:35:22,242 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 3090 transitions. Word has length 3 [2022-11-20 10:35:22,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:22,243 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 3090 transitions. [2022-11-20 10:35:22,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 3090 transitions. [2022-11-20 10:35:22,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 10:35:22,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:22,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:22,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:35:22,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:22,457 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:35:22,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:22,458 INFO L85 PathProgramCache]: Analyzing trace with hash -755344223, now seen corresponding path program 1 times [2022-11-20 10:35:22,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:22,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725194756] [2022-11-20 10:35:22,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:22,459 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-20 10:35:22,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:22,460 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:22,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:22,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:35:22,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:22,630 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-20 10:35:22,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:35:22,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:35:22,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725194756] [2022-11-20 10:35:22,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725194756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:22,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:22,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:35:22,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826619046] [2022-11-20 10:35:22,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:22,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:35:22,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:35:22,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:35:22,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:35:22,667 INFO L87 Difference]: Start difference. First operand 962 states and 3090 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-20 10:35:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:22,855 INFO L93 Difference]: Finished difference Result 712 states and 1935 transitions. [2022-11-20 10:35:22,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:35:22,856 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-20 10:35:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:22,860 INFO L225 Difference]: With dead ends: 712 [2022-11-20 10:35:22,860 INFO L226 Difference]: Without dead ends: 562 [2022-11-20 10:35:22,860 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-20 10:35:22,861 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:22,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 15 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:35:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-11-20 10:35:22,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2022-11-20 10:35:22,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 560 states have (on average 2.6607142857142856) internal successors, (1490), 561 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1490 transitions. [2022-11-20 10:35:22,884 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1490 transitions. Word has length 10 [2022-11-20 10:35:22,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:22,884 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 1490 transitions. [2022-11-20 10:35:22,884 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-20 10:35:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1490 transitions. [2022-11-20 10:35:22,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 10:35:22,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:22,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:35:22,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:23,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:23,098 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:35:23,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:23,099 INFO L85 PathProgramCache]: Analyzing trace with hash -528158604, now seen corresponding path program 1 times [2022-11-20 10:35:23,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:23,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338832798] [2022-11-20 10:35:23,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:23,100 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-20 10:35:23,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:23,102 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:23,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:23,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:35:23,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:23,295 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-20 10:35:23,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:35:23,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:35:23,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338832798] [2022-11-20 10:35:23,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338832798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:23,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:23,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:35:23,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815025636] [2022-11-20 10:35:23,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:23,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:35:23,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:35:23,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:35:23,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:35:23,300 INFO L87 Difference]: Start difference. First operand 562 states and 1490 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:23,534 INFO L93 Difference]: Finished difference Result 352 states and 831 transitions. [2022-11-20 10:35:23,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:35:23,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 10:35:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:23,537 INFO L225 Difference]: With dead ends: 352 [2022-11-20 10:35:23,537 INFO L226 Difference]: Without dead ends: 282 [2022-11-20 10:35:23,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:35:23,538 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 48 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:23,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 27 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:35:23,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-20 10:35:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-11-20 10:35:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 280 states have (on average 2.3214285714285716) internal successors, (650), 281 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 650 transitions. [2022-11-20 10:35:23,554 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 650 transitions. Word has length 14 [2022-11-20 10:35:23,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:23,555 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 650 transitions. [2022-11-20 10:35:23,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:23,557 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 650 transitions. [2022-11-20 10:35:23,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 10:35:23,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:23,566 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-20 10:35:23,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:23,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:23,778 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:35:23,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1846467090, now seen corresponding path program 1 times [2022-11-20 10:35:23,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:23,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931833582] [2022-11-20 10:35:23,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:23,779 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-20 10:35:23,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:23,780 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:23,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:23,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 10:35:23,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:23,959 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-20 10:35:23,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:35:23,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:35:23,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931833582] [2022-11-20 10:35:23,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931833582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:23,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:23,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:35:23,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69838868] [2022-11-20 10:35:23,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:23,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:35:23,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:35:23,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:35:23,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:35:23,962 INFO L87 Difference]: Start difference. First operand 282 states and 650 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:24,249 INFO L93 Difference]: Finished difference Result 231 states and 546 transitions. [2022-11-20 10:35:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:35:24,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 10:35:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:24,251 INFO L225 Difference]: With dead ends: 231 [2022-11-20 10:35:24,251 INFO L226 Difference]: Without dead ends: 217 [2022-11-20 10:35:24,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:35:24,252 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:24,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 45 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:35:24,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-20 10:35:24,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-11-20 10:35:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 215 states have (on average 2.4186046511627906) internal successors, (520), 216 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 520 transitions. [2022-11-20 10:35:24,259 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 520 transitions. Word has length 18 [2022-11-20 10:35:24,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:24,259 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 520 transitions. [2022-11-20 10:35:24,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:24,259 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 520 transitions. [2022-11-20 10:35:24,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:35:24,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:24,260 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, 1] [2022-11-20 10:35:24,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:24,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:24,461 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:35:24,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:24,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1281388287, now seen corresponding path program 1 times [2022-11-20 10:35:24,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:24,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127635484] [2022-11-20 10:35:24,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:24,463 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-20 10:35:24,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:24,464 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:24,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:24,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 10:35:24,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:24,815 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-20 10:35:24,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:35:24,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:35:24,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127635484] [2022-11-20 10:35:24,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127635484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:24,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:24,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:35:24,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629139443] [2022-11-20 10:35:24,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:24,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:35:24,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:35:24,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:35:24,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:35:24,817 INFO L87 Difference]: Start difference. First operand 217 states and 520 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:25,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:25,148 INFO L93 Difference]: Finished difference Result 329 states and 743 transitions. [2022-11-20 10:35:25,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:35:25,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-20 10:35:25,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:25,150 INFO L225 Difference]: With dead ends: 329 [2022-11-20 10:35:25,150 INFO L226 Difference]: Without dead ends: 329 [2022-11-20 10:35:25,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 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-20 10:35:25,151 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 48 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:25,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 34 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:35:25,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-11-20 10:35:25,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 290. [2022-11-20 10:35:25,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 288 states have (on average 2.3368055555555554) internal successors, (673), 289 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 673 transitions. [2022-11-20 10:35:25,161 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 673 transitions. Word has length 23 [2022-11-20 10:35:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:25,161 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 673 transitions. [2022-11-20 10:35:25,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:25,162 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 673 transitions. [2022-11-20 10:35:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:35:25,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:25,163 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, 1] [2022-11-20 10:35:25,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:25,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:25,372 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:35:25,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:25,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1281388321, now seen corresponding path program 1 times [2022-11-20 10:35:25,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:25,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407178574] [2022-11-20 10:35:25,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:25,373 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-20 10:35:25,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:25,374 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:25,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:25,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 10:35:25,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:25,922 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-20 10:35:25,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:35:25,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:35:25,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407178574] [2022-11-20 10:35:25,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407178574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:25,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:25,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:35:25,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122775348] [2022-11-20 10:35:25,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:25,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:35:25,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:35:25,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:35:25,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:35:25,924 INFO L87 Difference]: Start difference. First operand 290 states and 673 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:25,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:25,992 INFO L93 Difference]: Finished difference Result 480 states and 1109 transitions. [2022-11-20 10:35:25,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:35:25,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-20 10:35:25,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:25,995 INFO L225 Difference]: With dead ends: 480 [2022-11-20 10:35:25,995 INFO L226 Difference]: Without dead ends: 452 [2022-11-20 10:35:25,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-20 10:35:25,996 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:25,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2022-11-20 10:35:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-11-20 10:35:26,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 317. [2022-11-20 10:35:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 315 states have (on average 2.2603174603174603) internal successors, (712), 316 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 712 transitions. [2022-11-20 10:35:26,007 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 712 transitions. Word has length 23 [2022-11-20 10:35:26,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:26,007 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 712 transitions. [2022-11-20 10:35:26,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 712 transitions. [2022-11-20 10:35:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:35:26,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:26,009 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, 1] [2022-11-20 10:35:26,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:26,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:26,221 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:35:26,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:26,221 INFO L85 PathProgramCache]: Analyzing trace with hash -641089293, now seen corresponding path program 2 times [2022-11-20 10:35:26,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:26,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437711514] [2022-11-20 10:35:26,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:35:26,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:35:26,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:26,225 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:26,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:26,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 10:35:26,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:35:26,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:35:26,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:26,391 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-20 10:35:26,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:35:26,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:35:26,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437711514] [2022-11-20 10:35:26,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437711514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:26,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:26,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:35:26,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974177077] [2022-11-20 10:35:26,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:26,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:35:26,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:35:26,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:35:26,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:35:26,395 INFO L87 Difference]: Start difference. First operand 317 states and 712 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:26,525 INFO L93 Difference]: Finished difference Result 448 states and 978 transitions. [2022-11-20 10:35:26,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:35:26,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-20 10:35:26,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:26,528 INFO L225 Difference]: With dead ends: 448 [2022-11-20 10:35:26,528 INFO L226 Difference]: Without dead ends: 429 [2022-11-20 10:35:26,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-20 10:35:26,529 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 12 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-20 10:35:26,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 12 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:35:26,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-11-20 10:35:26,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 350. [2022-11-20 10:35:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 348 states have (on average 2.295977011494253) internal successors, (799), 349 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:26,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 799 transitions. [2022-11-20 10:35:26,542 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 799 transitions. Word has length 23 [2022-11-20 10:35:26,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:26,543 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 799 transitions. [2022-11-20 10:35:26,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:26,543 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 799 transitions. [2022-11-20 10:35:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:35:26,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:26,551 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, 1] [2022-11-20 10:35:26,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:35:26,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:26,763 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:35:26,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:26,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1436957839, now seen corresponding path program 3 times [2022-11-20 10:35:26,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:26,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802691676] [2022-11-20 10:35:26,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:35:26,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 10:35:26,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:26,765 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:26,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:26,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 10:35:26,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:35:26,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 10:35:26,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:27,228 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-20 10:35:27,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:35:27,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:35:27,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802691676] [2022-11-20 10:35:27,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802691676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:27,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:27,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:35:27,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747770427] [2022-11-20 10:35:27,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:27,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:35:27,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:35:27,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:35:27,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:35:27,230 INFO L87 Difference]: Start difference. First operand 350 states and 799 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:27,586 INFO L93 Difference]: Finished difference Result 399 states and 885 transitions. [2022-11-20 10:35:27,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:35:27,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-20 10:35:27,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:27,589 INFO L225 Difference]: With dead ends: 399 [2022-11-20 10:35:27,589 INFO L226 Difference]: Without dead ends: 367 [2022-11-20 10:35:27,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 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-20 10:35:27,590 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 52 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:27,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 38 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:35:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-11-20 10:35:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 276. [2022-11-20 10:35:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 274 states have (on average 2.372262773722628) internal successors, (650), 275 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 650 transitions. [2022-11-20 10:35:27,599 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 650 transitions. Word has length 23 [2022-11-20 10:35:27,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:27,600 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 650 transitions. [2022-11-20 10:35:27,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:27,600 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 650 transitions. [2022-11-20 10:35:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:35:27,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:27,601 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, 1] [2022-11-20 10:35:27,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:27,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:27,826 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:35:27,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:27,826 INFO L85 PathProgramCache]: Analyzing trace with hash 530708785, now seen corresponding path program 2 times [2022-11-20 10:35:27,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:27,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573756528] [2022-11-20 10:35:27,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:35:27,827 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-20 10:35:27,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:27,829 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:27,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:28,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 10:35:28,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:35:28,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 10:35:28,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:28,376 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-20 10:35:28,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:35:28,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:35:28,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573756528] [2022-11-20 10:35:28,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573756528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:28,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:28,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:35:28,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356924561] [2022-11-20 10:35:28,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:28,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:35:28,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:35:28,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:35:28,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:35:28,378 INFO L87 Difference]: Start difference. First operand 276 states and 650 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:28,451 INFO L93 Difference]: Finished difference Result 449 states and 1064 transitions. [2022-11-20 10:35:28,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:35:28,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-20 10:35:28,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:28,454 INFO L225 Difference]: With dead ends: 449 [2022-11-20 10:35:28,454 INFO L226 Difference]: Without dead ends: 369 [2022-11-20 10:35:28,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:35:28,455 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:28,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-11-20 10:35:28,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-11-20 10:35:28,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 269. [2022-11-20 10:35:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 267 states have (on average 2.3670411985018727) internal successors, (632), 268 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 632 transitions. [2022-11-20 10:35:28,466 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 632 transitions. Word has length 23 [2022-11-20 10:35:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:28,466 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 632 transitions. [2022-11-20 10:35:28,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 632 transitions. [2022-11-20 10:35:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:35:28,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:28,468 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, 1] [2022-11-20 10:35:28,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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)] Ended with exit code 0 [2022-11-20 10:35:28,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:28,683 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:35:28,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:28,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1808130849, now seen corresponding path program 3 times [2022-11-20 10:35:28,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:28,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992766136] [2022-11-20 10:35:28,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:35:28,684 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-20 10:35:28,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:28,686 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:28,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:28,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-20 10:35:28,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:35:28,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 10:35:28,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:29,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:29,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:35:29,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 10:35:29,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992766136] [2022-11-20 10:35:29,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992766136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:35:29,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:35:29,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:35:29,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269062100] [2022-11-20 10:35:29,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:35:29,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:35:29,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 10:35:29,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:35:29,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:35:29,243 INFO L87 Difference]: Start difference. First operand 269 states and 632 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:29,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:35:29,313 INFO L93 Difference]: Finished difference Result 463 states and 1083 transitions. [2022-11-20 10:35:29,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:35:29,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-20 10:35:29,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:35:29,315 INFO L225 Difference]: With dead ends: 463 [2022-11-20 10:35:29,315 INFO L226 Difference]: Without dead ends: 340 [2022-11-20 10:35:29,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:35:29,316 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:35:29,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 28 Unchecked, 0.1s Time] [2022-11-20 10:35:29,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-11-20 10:35:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2022-11-20 10:35:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 338 states have (on average 2.304733727810651) internal successors, (779), 339 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:29,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 779 transitions. [2022-11-20 10:35:29,335 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 779 transitions. Word has length 23 [2022-11-20 10:35:29,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:35:29,335 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 779 transitions. [2022-11-20 10:35:29,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:35:29,336 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 779 transitions. [2022-11-20 10:35:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:35:29,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:35:29,340 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, 1] [2022-11-20 10:35:29,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:29,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:29,546 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-20 10:35:29,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:29,547 INFO L85 PathProgramCache]: Analyzing trace with hash 760549207, now seen corresponding path program 4 times [2022-11-20 10:35:29,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 10:35:29,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194943265] [2022-11-20 10:35:29,547 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:35:29,547 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-20 10:35:29,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 10:35:29,548 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:29,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:29,699 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:35:29,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 10:35:29,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:35:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:35:29,830 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-20 10:35:29,837 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:35:29,839 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-20 10:35:29,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-20 10:35:29,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-20 10:35:29,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-20 10:35:29,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-20 10:35:29,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-20 10:35:29,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-20 10:35:29,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-20 10:35:29,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-20 10:35:29,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-20 10:35:29,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-20 10:35:29,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-20 10:35:29,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-20 10:35:29,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:30,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/mathsat -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-20 10:35:30,069 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1] [2022-11-20 10:35:30,074 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 10:35:30,074 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:35:30,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:35:30 BasicIcfg [2022-11-20 10:35:30,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:35:30,188 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:35:30,188 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:35:30,189 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:35:30,189 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:35:10" (3/4) ... [2022-11-20 10:35:30,199 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 10:35:30,200 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:35:30,200 INFO L158 Benchmark]: Toolchain (without parser) took 21050.27ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 48.4MB in the beginning and 44.3MB in the end (delta: 4.1MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2022-11-20 10:35:30,201 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 54.5MB. Free memory was 32.7MB in the beginning and 32.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:35:30,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 734.03ms. Allocated memory is still 71.3MB. Free memory was 48.2MB in the beginning and 41.3MB in the end (delta: 6.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 10:35:30,201 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.42ms. Allocated memory is still 71.3MB. Free memory was 41.3MB in the beginning and 38.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:35:30,202 INFO L158 Benchmark]: Boogie Preprocessor took 38.20ms. Allocated memory is still 71.3MB. Free memory was 38.6MB in the beginning and 36.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:35:30,202 INFO L158 Benchmark]: RCFGBuilder took 946.95ms. Allocated memory is still 71.3MB. Free memory was 36.5MB in the beginning and 29.6MB in the end (delta: 6.9MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-11-20 10:35:30,202 INFO L158 Benchmark]: TraceAbstraction took 19262.61ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 28.9MB in the beginning and 44.3MB in the end (delta: -15.4MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2022-11-20 10:35:30,202 INFO L158 Benchmark]: Witness Printer took 11.58ms. Allocated memory is still 125.8MB. Free memory is still 44.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:35:30,204 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 54.5MB. Free memory was 32.7MB in the beginning and 32.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 734.03ms. Allocated memory is still 71.3MB. Free memory was 48.2MB in the beginning and 41.3MB in the end (delta: 6.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.42ms. Allocated memory is still 71.3MB. Free memory was 41.3MB in the beginning and 38.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.20ms. Allocated memory is still 71.3MB. Free memory was 38.6MB in the beginning and 36.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 946.95ms. Allocated memory is still 71.3MB. Free memory was 36.5MB in the beginning and 29.6MB in the end (delta: 6.9MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19262.61ms. Allocated memory was 71.3MB in the beginning and 125.8MB in the end (delta: 54.5MB). Free memory was 28.9MB in the beginning and 44.3MB in the end (delta: -15.4MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. * Witness Printer took 11.58ms. Allocated memory is still 125.8MB. Free memory is still 44.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.8s, 138 PlacesBefore, 45 PlacesAfterwards, 130 TransitionsBefore, 36 TransitionsAfterwards, 2524 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 124 TotalNumberOfCompositions, 6897 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3736, independent: 3551, independent conditional: 0, independent unconditional: 3551, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1793, independent: 1747, independent conditional: 0, independent unconditional: 1747, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1793, independent: 1729, independent conditional: 0, independent unconditional: 1729, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 393, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 361, dependent conditional: 0, dependent unconditional: 361, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3736, independent: 1804, independent conditional: 0, independent unconditional: 1804, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 1793, unknown conditional: 0, unknown unconditional: 1793] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 190, Positive conditional cache size: 0, Positive unconditional cache size: 190, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1105; [L844] FCALL, FORK 0 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1105, ((void *)0), P0, ((void *)0))=0, t1105={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1106; [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1106, ((void *)0), P1, ((void *)0))=1, t1105={3:0}, t1106={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1107; [L848] FCALL, FORK 0 pthread_create(&t1107, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1107, ((void *)0), P2, ((void *)0))=2, t1105={3:0}, t1106={7:0}, t1107={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L776] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L796] 3 y = 2 [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1105={3:0}, t1106={7:0}, t1107={11:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] [L861] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 848]: 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: 844]: 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, 159 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 278 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 278 mSDsluCounter, 237 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 90 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1150 IncrementalHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 72 mSDtfsCounter, 1150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1288occurred in iteration=0, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 444 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 173 ConstructedInterpolants, 45 QuantifiedInterpolants, 2730 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1470 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 10:35:30,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d322b81b-ff9c-4a06-a7d6-f6f15fa3ec05/bin/uautomizer-ug76WZFUDN/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